./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 15:14:46,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 15:14:46,381 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 15:14:46,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 15:14:46,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 15:14:46,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 15:14:46,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 15:14:46,425 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 15:14:46,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 15:14:46,427 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 15:14:46,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 15:14:46,428 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 15:14:46,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 15:14:46,428 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 15:14:46,430 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 15:14:46,430 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 15:14:46,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 15:14:46,431 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 15:14:46,431 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 15:14:46,431 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 15:14:46,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 15:14:46,435 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 15:14:46,435 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 15:14:46,436 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 15:14:46,436 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 15:14:46,436 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 15:14:46,436 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 15:14:46,437 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 15:14:46,437 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 15:14:46,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 15:14:46,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 15:14:46,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 15:14:46,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:14:46,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 15:14:46,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 15:14:46,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 15:14:46,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 15:14:46,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 15:14:46,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 15:14:46,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 15:14:46,440 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 15:14:46,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 15:14:46,441 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 15:14:46,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 15:14:46,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 15:14:46,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 15:14:46,721 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 15:14:46,721 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 15:14:46,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-10-15 15:14:48,166 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 15:14:48,382 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 15:14:48,383 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-10-15 15:14:48,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/93c6a1fae/f6941e6d474246f8bf93b95490332176/FLAG44acf313c [2024-10-15 15:14:48,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/93c6a1fae/f6941e6d474246f8bf93b95490332176 [2024-10-15 15:14:48,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 15:14:48,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 15:14:48,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 15:14:48,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 15:14:48,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 15:14:48,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:14:48" (1/1) ... [2024-10-15 15:14:48,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b76e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:48, skipping insertion in model container [2024-10-15 15:14:48,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:14:48" (1/1) ... [2024-10-15 15:14:48,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 15:14:48,949 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-10-15 15:14:48,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:14:48,975 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 15:14:48,986 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-10-15 15:14:48,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:14:49,010 INFO L204 MainTranslator]: Completed translation [2024-10-15 15:14:49,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:49 WrapperNode [2024-10-15 15:14:49,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 15:14:49,012 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 15:14:49,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 15:14:49,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 15:14:49,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:49" (1/1) ... [2024-10-15 15:14:49,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:49" (1/1) ... [2024-10-15 15:14:49,032 INFO L138 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 15:14:49,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 15:14:49,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 15:14:49,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 15:14:49,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 15:14:49,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:49" (1/1) ... [2024-10-15 15:14:49,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:49" (1/1) ... [2024-10-15 15:14:49,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:49" (1/1) ... [2024-10-15 15:14:49,060 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-10-15 15:14:49,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:49" (1/1) ... [2024-10-15 15:14:49,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:49" (1/1) ... [2024-10-15 15:14:49,070 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:49" (1/1) ... [2024-10-15 15:14:49,071 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:49" (1/1) ... [2024-10-15 15:14:49,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:49" (1/1) ... [2024-10-15 15:14:49,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:49" (1/1) ... [2024-10-15 15:14:49,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 15:14:49,076 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 15:14:49,076 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 15:14:49,077 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 15:14:49,077 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:49" (1/1) ... [2024-10-15 15:14:49,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:14:49,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:14:49,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-15 15:14:49,105 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-15 15:14:49,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 15:14:49,146 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-15 15:14:49,146 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-15 15:14:49,147 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 15:14:49,147 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 15:14:49,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 15:14:49,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-15 15:14:49,147 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-10-15 15:14:49,148 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-10-15 15:14:49,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 15:14:49,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 15:14:49,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-15 15:14:49,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 15:14:49,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 15:14:49,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 15:14:49,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-15 15:14:49,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-15 15:14:49,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-15 15:14:49,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 15:14:49,150 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 15:14:49,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 15:14:49,229 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 15:14:49,230 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 15:14:49,403 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-15 15:14:49,403 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 15:14:49,431 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 15:14:49,432 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-15 15:14:49,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:14:49 BoogieIcfgContainer [2024-10-15 15:14:49,432 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 15:14:49,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 15:14:49,437 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 15:14:49,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 15:14:49,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:14:48" (1/3) ... [2024-10-15 15:14:49,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf11e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:14:49, skipping insertion in model container [2024-10-15 15:14:49,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:49" (2/3) ... [2024-10-15 15:14:49,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf11e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:14:49, skipping insertion in model container [2024-10-15 15:14:49,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:14:49" (3/3) ... [2024-10-15 15:14:49,444 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2024-10-15 15:14:49,456 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 15:14:49,456 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 15:14:49,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 15:14:49,505 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@483b2a46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 15:14:49,506 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 15:14:49,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-15 15:14:49,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-15 15:14:49,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:14:49,515 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:14:49,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:14:49,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:49,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1437097425, now seen corresponding path program 1 times [2024-10-15 15:14:49,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:14:49,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840657570] [2024-10-15 15:14:49,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:49,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:14:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:49,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:14:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:49,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:14:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:49,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 15:14:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:49,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 15:14:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:49,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 15:14:49,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:14:49,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840657570] [2024-10-15 15:14:49,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840657570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:14:49,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:14:49,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 15:14:49,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283874104] [2024-10-15 15:14:49,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:14:49,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-15 15:14:49,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:14:49,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 15:14:49,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 15:14:49,777 INFO L87 Difference]: Start difference. First operand has 42 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 15:14:49,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:14:49,908 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2024-10-15 15:14:49,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 15:14:49,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-10-15 15:14:49,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:14:49,929 INFO L225 Difference]: With dead ends: 78 [2024-10-15 15:14:49,929 INFO L226 Difference]: Without dead ends: 38 [2024-10-15 15:14:49,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 15:14:49,938 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:14:49,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 21 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:14:49,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-15 15:14:49,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-15 15:14:49,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-15 15:14:50,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-10-15 15:14:50,003 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 28 [2024-10-15 15:14:50,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:14:50,004 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-10-15 15:14:50,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 15:14:50,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-10-15 15:14:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-15 15:14:50,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:14:50,007 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:14:50,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 15:14:50,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:14:50,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:50,008 INFO L85 PathProgramCache]: Analyzing trace with hash 579935573, now seen corresponding path program 1 times [2024-10-15 15:14:50,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:14:50,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763089094] [2024-10-15 15:14:50,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:50,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:14:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:50,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:14:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:50,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:14:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:50,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 15:14:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:50,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 15:14:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:50,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 15:14:50,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:14:50,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763089094] [2024-10-15 15:14:50,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763089094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:14:50,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:14:50,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 15:14:50,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941618489] [2024-10-15 15:14:50,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:14:50,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 15:14:50,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:14:50,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 15:14:50,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-15 15:14:50,398 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-15 15:14:50,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:14:50,698 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2024-10-15 15:14:50,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 15:14:50,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2024-10-15 15:14:50,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:14:50,701 INFO L225 Difference]: With dead ends: 62 [2024-10-15 15:14:50,701 INFO L226 Difference]: Without dead ends: 60 [2024-10-15 15:14:50,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-15 15:14:50,705 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 53 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:14:50,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 65 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:14:50,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-15 15:14:50,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2024-10-15 15:14:50,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-15 15:14:50,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2024-10-15 15:14:50,730 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 28 [2024-10-15 15:14:50,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:14:50,731 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2024-10-15 15:14:50,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-15 15:14:50,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:50,731 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2024-10-15 15:14:50,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-15 15:14:50,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:14:50,736 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:14:50,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 15:14:50,736 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:14:50,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:50,737 INFO L85 PathProgramCache]: Analyzing trace with hash 2135763327, now seen corresponding path program 1 times [2024-10-15 15:14:50,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:14:50,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040665277] [2024-10-15 15:14:50,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:50,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:14:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:51,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:14:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:51,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:14:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:51,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 15:14:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:51,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 15:14:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:51,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-15 15:14:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 15:14:51,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:14:51,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040665277] [2024-10-15 15:14:51,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040665277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:14:51,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:14:51,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-15 15:14:51,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417115477] [2024-10-15 15:14:51,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:14:51,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-15 15:14:51,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:14:51,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-15 15:14:51,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-15 15:14:51,065 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 15:14:51,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:14:51,281 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2024-10-15 15:14:51,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-15 15:14:51,284 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 31 [2024-10-15 15:14:51,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:14:51,285 INFO L225 Difference]: With dead ends: 61 [2024-10-15 15:14:51,285 INFO L226 Difference]: Without dead ends: 53 [2024-10-15 15:14:51,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-15 15:14:51,287 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:14:51,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 54 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:14:51,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-15 15:14:51,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-15 15:14:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-15 15:14:51,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2024-10-15 15:14:51,301 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 31 [2024-10-15 15:14:51,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:14:51,301 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2024-10-15 15:14:51,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 15:14:51,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:51,302 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2024-10-15 15:14:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-15 15:14:51,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:14:51,305 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:14:51,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-15 15:14:51,305 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:14:51,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:51,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1566356218, now seen corresponding path program 1 times [2024-10-15 15:14:51,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:14:51,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330253790] [2024-10-15 15:14:51,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:51,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:14:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:51,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:14:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:51,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:14:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:51,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 15:14:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:51,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 15:14:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:51,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-15 15:14:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:51,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-15 15:14:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:51,557 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 15:14:51,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:14:51,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330253790] [2024-10-15 15:14:51,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330253790] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:14:51,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791287884] [2024-10-15 15:14:51,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:51,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:14:51,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:14:51,571 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:14:51,576 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 15:14:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:51,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-15 15:14:51,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:14:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 15:14:51,869 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 15:14:51,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791287884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:14:51,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 15:14:51,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2024-10-15 15:14:51,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968007325] [2024-10-15 15:14:51,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:14:51,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-15 15:14:51,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:14:51,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 15:14:51,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-15 15:14:51,874 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-15 15:14:52,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:14:52,088 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2024-10-15 15:14:52,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-15 15:14:52,089 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2024-10-15 15:14:52,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:14:52,091 INFO L225 Difference]: With dead ends: 68 [2024-10-15 15:14:52,092 INFO L226 Difference]: Without dead ends: 66 [2024-10-15 15:14:52,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-10-15 15:14:52,094 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 30 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:14:52,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 201 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:14:52,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-15 15:14:52,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 40. [2024-10-15 15:14:52,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-15 15:14:52,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-10-15 15:14:52,112 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 43 [2024-10-15 15:14:52,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:14:52,113 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-10-15 15:14:52,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-15 15:14:52,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:52,114 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-10-15 15:14:52,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-15 15:14:52,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:14:52,115 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:14:52,132 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-15 15:14:52,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:14:52,320 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:14:52,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:52,320 INFO L85 PathProgramCache]: Analyzing trace with hash -920124993, now seen corresponding path program 1 times [2024-10-15 15:14:52,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:14:52,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965940609] [2024-10-15 15:14:52,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:52,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:14:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:52,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:14:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:52,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:14:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:52,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 15:14:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:52,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 15:14:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:52,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-15 15:14:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:52,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-15 15:14:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:52,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-15 15:14:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:52,512 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 15:14:52,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:14:52,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965940609] [2024-10-15 15:14:52,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965940609] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:14:52,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051255186] [2024-10-15 15:14:52,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:52,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:14:52,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:14:52,515 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:14:52,518 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 15:14:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:52,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-15 15:14:52,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:14:52,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-15 15:14:52,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-10-15 15:14:52,808 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 15:14:52,808 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 15:14:52,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051255186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:14:52,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 15:14:52,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 12 [2024-10-15 15:14:52,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662941843] [2024-10-15 15:14:52,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:14:52,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-15 15:14:52,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:14:52,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-15 15:14:52,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-15 15:14:52,811 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-15 15:14:52,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:14:52,939 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2024-10-15 15:14:52,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-15 15:14:52,939 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2024-10-15 15:14:52,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:14:52,940 INFO L225 Difference]: With dead ends: 72 [2024-10-15 15:14:52,941 INFO L226 Difference]: Without dead ends: 46 [2024-10-15 15:14:52,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-10-15 15:14:52,942 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:14:52,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 143 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:14:52,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-15 15:14:52,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2024-10-15 15:14:52,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-15 15:14:52,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2024-10-15 15:14:52,952 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 46 [2024-10-15 15:14:52,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:14:52,953 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2024-10-15 15:14:52,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-15 15:14:52,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:52,954 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2024-10-15 15:14:52,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-15 15:14:52,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:14:52,955 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:14:52,973 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-15 15:14:53,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:14:53,159 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:14:53,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:53,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1621189571, now seen corresponding path program 1 times [2024-10-15 15:14:53,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:14:53,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836214338] [2024-10-15 15:14:53,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:53,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:14:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:53,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:14:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:53,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:14:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:53,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 15:14:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:53,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 15:14:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:53,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-15 15:14:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:53,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-15 15:14:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:53,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-15 15:14:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 15:14:53,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:14:53,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836214338] [2024-10-15 15:14:53,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836214338] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:14:53,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899729239] [2024-10-15 15:14:53,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:53,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:14:53,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:14:53,374 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:14:53,375 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 15:14:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:53,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-15 15:14:53,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:14:53,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-15 15:14:53,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-10-15 15:14:53,857 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 15:14:53,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:15:01,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899729239] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:15:01,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 15:15:01,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 22 [2024-10-15 15:15:01,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435958319] [2024-10-15 15:15:01,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 15:15:01,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-15 15:15:01,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:15:01,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-15 15:15:01,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-10-15 15:15:01,935 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 22 states, 17 states have (on average 2.588235294117647) internal successors, (44), 15 states have internal predecessors, (44), 7 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-15 15:15:02,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:15:02,513 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2024-10-15 15:15:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-15 15:15:02,514 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.588235294117647) internal successors, (44), 15 states have internal predecessors, (44), 7 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 46 [2024-10-15 15:15:02,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:15:02,514 INFO L225 Difference]: With dead ends: 46 [2024-10-15 15:15:02,514 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 15:15:02,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2024-10-15 15:15:02,516 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 37 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-15 15:15:02,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 91 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-15 15:15:02,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 15:15:02,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 15:15:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 15:15:02,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 15:15:02,518 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2024-10-15 15:15:02,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:15:02,518 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 15:15:02,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.588235294117647) internal successors, (44), 15 states have internal predecessors, (44), 7 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-15 15:15:02,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:15:02,518 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 15:15:02,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 15:15:02,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-15 15:15:02,537 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-15 15:15:02,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-15 15:15:02,728 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-15 15:15:02,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 15:15:04,102 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 15:15:04,116 WARN L156 FloydHoareUtils]: Requires clause for main contained old-variable. Original clause: (= |#memory_int#1| |old(#memory_int#1)|) Eliminated clause: true [2024-10-15 15:15:04,121 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:166) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateProcedureContract(DefaultTranslator.java:377) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:349) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:338) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateProcedureContract(BacktranslationService.java:94) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createProcedureContractResults(FloydHoareUtils.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-15 15:15:04,127 INFO L158 Benchmark]: Toolchain (without parser) took 15377.49ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 104.3MB in the beginning and 87.9MB in the end (delta: 16.4MB). Peak memory consumption was 85.4MB. Max. memory is 16.1GB. [2024-10-15 15:15:04,127 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 15:15:04,127 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.02ms. Allocated memory is still 174.1MB. Free memory was 104.1MB in the beginning and 141.0MB in the end (delta: -36.9MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-10-15 15:15:04,127 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.75ms. Allocated memory is still 174.1MB. Free memory was 141.0MB in the beginning and 140.1MB in the end (delta: 907.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 15:15:04,128 INFO L158 Benchmark]: Boogie Preprocessor took 42.71ms. Allocated memory is still 174.1MB. Free memory was 140.1MB in the beginning and 138.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 15:15:04,128 INFO L158 Benchmark]: RCFGBuilder took 356.18ms. Allocated memory is still 174.1MB. Free memory was 138.1MB in the beginning and 121.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-15 15:15:04,128 INFO L158 Benchmark]: TraceAbstraction took 14691.50ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 120.9MB in the beginning and 87.9MB in the end (delta: 33.0MB). Peak memory consumption was 99.8MB. Max. memory is 16.1GB. [2024-10-15 15:15:04,130 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.02ms. Allocated memory is still 174.1MB. Free memory was 104.1MB in the beginning and 141.0MB in the end (delta: -36.9MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.75ms. Allocated memory is still 174.1MB. Free memory was 141.0MB in the beginning and 140.1MB in the end (delta: 907.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.71ms. Allocated memory is still 174.1MB. Free memory was 140.1MB in the beginning and 138.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 356.18ms. Allocated memory is still 174.1MB. Free memory was 138.1MB in the beginning and 121.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14691.50ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 120.9MB in the beginning and 87.9MB in the end (delta: 33.0MB). Peak memory consumption was 99.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 11]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.2s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 189 mSDsluCounter, 575 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 451 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1307 IncrementalHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 124 mSDtfsCounter, 1307 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 188 SyntacticMatches, 8 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=2, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 33 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 348 ConstructedInterpolants, 22 QuantifiedInterpolants, 1064 SizeOfPredicates, 21 NumberOfNonLiveVariables, 563 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 93/110 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-15 15:15:04,169 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 15:15:06,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 15:15:06,307 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-15 15:15:06,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 15:15:06,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 15:15:06,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 15:15:06,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 15:15:06,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 15:15:06,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 15:15:06,350 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 15:15:06,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 15:15:06,354 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 15:15:06,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 15:15:06,356 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 15:15:06,356 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 15:15:06,357 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 15:15:06,357 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 15:15:06,358 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 15:15:06,360 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 15:15:06,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 15:15:06,361 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 15:15:06,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 15:15:06,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 15:15:06,362 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-15 15:15:06,363 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-15 15:15:06,363 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 15:15:06,366 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-15 15:15:06,366 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 15:15:06,366 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 15:15:06,366 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 15:15:06,367 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 15:15:06,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 15:15:06,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 15:15:06,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 15:15:06,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:15:06,368 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 15:15:06,368 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 15:15:06,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 15:15:06,369 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-15 15:15:06,369 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-15 15:15:06,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 15:15:06,370 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 15:15:06,370 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 15:15:06,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 15:15:06,371 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-15 15:15:06,371 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 15:15:06,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 15:15:06,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 15:15:06,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 15:15:06,706 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 15:15:06,708 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 15:15:06,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-10-15 15:15:08,211 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 15:15:08,422 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 15:15:08,423 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-10-15 15:15:08,431 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/21f88eacc/c586a2b7c52b4e818d7fc13064331f69/FLAGd21b5706d [2024-10-15 15:15:08,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/21f88eacc/c586a2b7c52b4e818d7fc13064331f69 [2024-10-15 15:15:08,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 15:15:08,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 15:15:08,454 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 15:15:08,454 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 15:15:08,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 15:15:08,461 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:15:08" (1/1) ... [2024-10-15 15:15:08,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79fd0b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:15:08, skipping insertion in model container [2024-10-15 15:15:08,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:15:08" (1/1) ... [2024-10-15 15:15:08,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 15:15:08,677 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-10-15 15:15:08,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:15:08,725 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 15:15:08,737 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-10-15 15:15:08,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:15:08,765 INFO L204 MainTranslator]: Completed translation [2024-10-15 15:15:08,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:15:08 WrapperNode [2024-10-15 15:15:08,766 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 15:15:08,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 15:15:08,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 15:15:08,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 15:15:08,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:15:08" (1/1) ... [2024-10-15 15:15:08,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:15:08" (1/1) ... [2024-10-15 15:15:08,790 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 15:15:08,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 15:15:08,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 15:15:08,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 15:15:08,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 15:15:08,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:15:08" (1/1) ... [2024-10-15 15:15:08,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:15:08" (1/1) ... [2024-10-15 15:15:08,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:15:08" (1/1) ... [2024-10-15 15:15:08,824 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-10-15 15:15:08,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:15:08" (1/1) ... [2024-10-15 15:15:08,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:15:08" (1/1) ... [2024-10-15 15:15:08,837 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:15:08" (1/1) ... [2024-10-15 15:15:08,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:15:08" (1/1) ... [2024-10-15 15:15:08,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:15:08" (1/1) ... [2024-10-15 15:15:08,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:15:08" (1/1) ... [2024-10-15 15:15:08,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 15:15:08,844 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 15:15:08,844 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 15:15:08,844 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 15:15:08,845 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:15:08" (1/1) ... [2024-10-15 15:15:08,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:15:08,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:15:08,880 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-15 15:15:08,887 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-15 15:15:08,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 15:15:08,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-15 15:15:08,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-15 15:15:08,932 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-15 15:15:08,932 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-15 15:15:08,934 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 15:15:08,934 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 15:15:08,934 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-10-15 15:15:08,934 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-10-15 15:15:08,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 15:15:08,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 15:15:08,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-15 15:15:08,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-15 15:15:08,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-15 15:15:08,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 15:15:08,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 15:15:08,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-15 15:15:08,935 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-15 15:15:08,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 15:15:08,935 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 15:15:08,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 15:15:09,050 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 15:15:09,052 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 15:15:09,313 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-15 15:15:09,316 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 15:15:09,349 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 15:15:09,349 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-15 15:15:09,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:15:09 BoogieIcfgContainer [2024-10-15 15:15:09,350 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 15:15:09,353 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 15:15:09,354 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 15:15:09,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 15:15:09,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:15:08" (1/3) ... [2024-10-15 15:15:09,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d535a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:15:09, skipping insertion in model container [2024-10-15 15:15:09,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:15:08" (2/3) ... [2024-10-15 15:15:09,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d535a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:15:09, skipping insertion in model container [2024-10-15 15:15:09,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:15:09" (3/3) ... [2024-10-15 15:15:09,362 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2024-10-15 15:15:09,391 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 15:15:09,391 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 15:15:09,456 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 15:15:09,462 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e2bf2f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 15:15:09,463 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 15:15:09,467 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-15 15:15:09,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-15 15:15:09,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:15:09,475 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:15:09,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:15:09,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:15:09,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1437097425, now seen corresponding path program 1 times [2024-10-15 15:15:09,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-15 15:15:09,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390653920] [2024-10-15 15:15:09,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:15:09,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-15 15:15:09,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-10-15 15:15:09,498 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-15 15:15:09,499 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-15 15:15:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:15:09,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-15 15:15:09,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:15:09,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 15:15:09,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 15:15:09,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-15 15:15:09,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390653920] [2024-10-15 15:15:09,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1390653920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:15:09,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:15:09,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 15:15:09,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302111691] [2024-10-15 15:15:09,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:15:09,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-15 15:15:09,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-15 15:15:09,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 15:15:09,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 15:15:09,657 INFO L87 Difference]: Start difference. First operand has 42 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 15:15:09,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:15:09,695 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2024-10-15 15:15:09,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 15:15:09,698 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-10-15 15:15:09,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:15:09,705 INFO L225 Difference]: With dead ends: 78 [2024-10-15 15:15:09,705 INFO L226 Difference]: Without dead ends: 38 [2024-10-15 15:15:09,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 15:15:09,714 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 15:15:09,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 15:15:09,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-15 15:15:09,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-15 15:15:09,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-15 15:15:09,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-10-15 15:15:09,763 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 28 [2024-10-15 15:15:09,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:15:09,765 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-10-15 15:15:09,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 15:15:09,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:15:09,766 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-10-15 15:15:09,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-15 15:15:09,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:15:09,768 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:15:09,775 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-15 15:15:09,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-15 15:15:09,970 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:15:09,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:15:09,971 INFO L85 PathProgramCache]: Analyzing trace with hash 579935573, now seen corresponding path program 1 times [2024-10-15 15:15:09,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-15 15:15:09,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025306374] [2024-10-15 15:15:09,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:15:09,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-15 15:15:09,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-10-15 15:15:09,976 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-15 15:15:09,977 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-15 15:15:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:15:10,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-15 15:15:10,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:15:10,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 15:15:10,516 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 15:15:10,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-15 15:15:10,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025306374] [2024-10-15 15:15:10,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025306374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:15:10,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:15:10,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-15 15:15:10,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877514468] [2024-10-15 15:15:10,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:15:10,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-15 15:15:10,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-15 15:15:10,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-15 15:15:10,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-15 15:15:10,522 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-15 15:15:10,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:15:10,910 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2024-10-15 15:15:10,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-15 15:15:10,911 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-10-15 15:15:10,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:15:10,913 INFO L225 Difference]: With dead ends: 56 [2024-10-15 15:15:10,913 INFO L226 Difference]: Without dead ends: 54 [2024-10-15 15:15:10,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-15 15:15:10,914 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:15:10,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 220 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:15:10,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-15 15:15:10,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-15 15:15:10,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-15 15:15:10,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2024-10-15 15:15:10,938 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 28 [2024-10-15 15:15:10,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:15:10,938 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2024-10-15 15:15:10,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-15 15:15:10,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:15:10,939 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2024-10-15 15:15:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-15 15:15:10,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:15:10,943 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:15:10,948 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-15 15:15:11,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-15 15:15:11,144 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:15:11,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:15:11,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2135763327, now seen corresponding path program 1 times [2024-10-15 15:15:11,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-15 15:15:11,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13917528] [2024-10-15 15:15:11,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:15:11,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-15 15:15:11,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-10-15 15:15:11,151 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-15 15:15:11,153 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-15 15:15:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:15:11,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-15 15:15:11,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:15:11,548 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-15 15:15:11,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 15:15:11,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2024-10-15 15:15:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 15:15:11,636 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 15:15:11,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-15 15:15:11,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13917528] [2024-10-15 15:15:11,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [13917528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:15:11,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:15:11,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-15 15:15:11,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012892094] [2024-10-15 15:15:11,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:15:11,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-15 15:15:11,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-15 15:15:11,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-15 15:15:11,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-15 15:15:11,639 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-15 15:15:11,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:15:11,973 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2024-10-15 15:15:11,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-15 15:15:11,973 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 31 [2024-10-15 15:15:11,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:15:11,977 INFO L225 Difference]: With dead ends: 66 [2024-10-15 15:15:11,977 INFO L226 Difference]: Without dead ends: 56 [2024-10-15 15:15:11,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-10-15 15:15:11,980 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:15:11,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 285 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:15:11,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-15 15:15:11,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2024-10-15 15:15:11,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-15 15:15:12,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2024-10-15 15:15:12,000 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 31 [2024-10-15 15:15:12,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:15:12,003 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2024-10-15 15:15:12,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-15 15:15:12,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:15:12,004 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2024-10-15 15:15:12,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-15 15:15:12,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:15:12,007 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:15:12,015 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-15 15:15:12,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-15 15:15:12,211 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:15:12,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:15:12,212 INFO L85 PathProgramCache]: Analyzing trace with hash 757009592, now seen corresponding path program 1 times [2024-10-15 15:15:12,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-15 15:15:12,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356849153] [2024-10-15 15:15:12,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:15:12,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-15 15:15:12,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-10-15 15:15:12,217 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-15 15:15:12,222 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-15 15:15:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:15:12,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-15 15:15:12,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:15:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-15 15:15:12,928 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:15:13,570 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 15:15:13,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-15 15:15:13,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356849153] [2024-10-15 15:15:13,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356849153] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:15:13,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 15:15:13,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 23 [2024-10-15 15:15:13,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563046947] [2024-10-15 15:15:13,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 15:15:13,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-15 15:15:13,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-15 15:15:13,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-15 15:15:13,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2024-10-15 15:15:13,575 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 23 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 10 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-15 15:15:15,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:15:15,426 INFO L93 Difference]: Finished difference Result 108 states and 140 transitions. [2024-10-15 15:15:15,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-15 15:15:15,427 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 10 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) Word has length 43 [2024-10-15 15:15:15,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:15:15,429 INFO L225 Difference]: With dead ends: 108 [2024-10-15 15:15:15,429 INFO L226 Difference]: Without dead ends: 106 [2024-10-15 15:15:15,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=205, Invalid=985, Unknown=0, NotChecked=0, Total=1190 [2024-10-15 15:15:15,431 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 80 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-15 15:15:15,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 441 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-15 15:15:15,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-15 15:15:15,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 85. [2024-10-15 15:15:15,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 52 states have internal predecessors, (56), 26 states have call successors, (26), 11 states have call predecessors, (26), 10 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-15 15:15:15,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2024-10-15 15:15:15,464 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 43 [2024-10-15 15:15:15,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:15:15,466 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2024-10-15 15:15:15,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 10 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-15 15:15:15,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:15:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2024-10-15 15:15:15,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-15 15:15:15,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:15:15,469 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:15:15,474 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-15 15:15:15,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-15 15:15:15,670 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:15:15,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:15:15,671 INFO L85 PathProgramCache]: Analyzing trace with hash -920124993, now seen corresponding path program 1 times [2024-10-15 15:15:15,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-15 15:15:15,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338110877] [2024-10-15 15:15:15,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:15:15,672 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-15 15:15:15,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-10-15 15:15:15,673 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-15 15:15:15,674 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-15 15:15:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:15:15,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-15 15:15:15,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:15:16,784 INFO L349 Elim1Store]: treesize reduction 80, result has 41.6 percent of original size [2024-10-15 15:15:16,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 49 treesize of output 71 [2024-10-15 15:15:17,047 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-15 15:15:17,047 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:15:30,201 INFO L349 Elim1Store]: treesize reduction 15, result has 59.5 percent of original size [2024-10-15 15:15:30,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 28 [2024-10-15 15:15:31,939 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-15 15:15:31,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-15 15:15:31,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338110877] [2024-10-15 15:15:31,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338110877] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:15:31,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 15:15:31,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 33 [2024-10-15 15:15:31,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669913369] [2024-10-15 15:15:31,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 15:15:31,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-15 15:15:31,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-15 15:15:31,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-15 15:15:31,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=951, Unknown=3, NotChecked=0, Total=1056 [2024-10-15 15:15:31,943 INFO L87 Difference]: Start difference. First operand 85 states and 106 transitions. Second operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 25 states have internal predecessors, (41), 11 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2024-10-15 15:15:47,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-15 15:15:52,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-15 15:15:54,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:15:54,723 INFO L93 Difference]: Finished difference Result 165 states and 203 transitions. [2024-10-15 15:15:54,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-15 15:15:54,724 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 25 states have internal predecessors, (41), 11 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) Word has length 46 [2024-10-15 15:15:54,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:15:54,726 INFO L225 Difference]: With dead ends: 165 [2024-10-15 15:15:54,727 INFO L226 Difference]: Without dead ends: 163 [2024-10-15 15:15:54,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=258, Invalid=2494, Unknown=4, NotChecked=0, Total=2756 [2024-10-15 15:15:54,729 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 84 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 59 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2024-10-15 15:15:54,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 632 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 673 Invalid, 2 Unknown, 0 Unchecked, 11.0s Time] [2024-10-15 15:15:54,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-15 15:15:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2024-10-15 15:15:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 85 states have (on average 1.1529411764705881) internal successors, (98), 93 states have internal predecessors, (98), 40 states have call successors, (40), 18 states have call predecessors, (40), 20 states have return successors, (42), 34 states have call predecessors, (42), 37 states have call successors, (42) [2024-10-15 15:15:54,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 180 transitions. [2024-10-15 15:15:54,789 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 180 transitions. Word has length 46 [2024-10-15 15:15:54,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:15:54,789 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 180 transitions. [2024-10-15 15:15:54,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 25 states have internal predecessors, (41), 11 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2024-10-15 15:15:54,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:15:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 180 transitions. [2024-10-15 15:15:54,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-15 15:15:54,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:15:54,796 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:15:54,803 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-15 15:15:54,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-15 15:15:54,997 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:15:54,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:15:54,997 INFO L85 PathProgramCache]: Analyzing trace with hash 986908330, now seen corresponding path program 1 times [2024-10-15 15:15:54,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-15 15:15:54,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [329512217] [2024-10-15 15:15:54,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:15:54,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-15 15:15:54,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-10-15 15:15:54,999 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-15 15:15:55,000 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-15 15:15:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:15:55,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-15 15:15:55,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:15:55,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 15:15:55,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2024-10-15 15:15:55,942 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-15 15:15:55,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:15:57,077 INFO L349 Elim1Store]: treesize reduction 5, result has 94.6 percent of original size [2024-10-15 15:15:57,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 95 [2024-10-15 15:15:58,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-15 15:15:58,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [329512217] [2024-10-15 15:15:58,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [329512217] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:15:58,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1937502217] [2024-10-15 15:15:58,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:15:58,226 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-15 15:15:58,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-10-15 15:15:58,230 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-15 15:15:58,232 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-15 15:15:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:15:58,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 15:15:58,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:15:58,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-15 15:16:02,603 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_2 (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int#1| v_main_~a~0.base_BEFORE_CALL_2))) is different from true [2024-10-15 15:17:28,865 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2024-10-15 15:17:28,866 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:18:01,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1937502217] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:18:01,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 15:18:01,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2024-10-15 15:18:01,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399197010] [2024-10-15 15:18:01,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 15:18:01,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-15 15:18:01,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-15 15:18:01,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-15 15:18:01,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=770, Unknown=25, NotChecked=56, Total=930 [2024-10-15 15:18:01,190 INFO L87 Difference]: Start difference. First operand 146 states and 180 transitions. Second operand has 24 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 8 states have call successors, (17), 6 states have call predecessors, (17), 9 states have return successors, (15), 9 states have call predecessors, (15), 6 states have call successors, (15) [2024-10-15 15:18:17,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-15 15:18:21,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-15 15:18:25,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-15 15:18:29,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-15 15:18:42,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-15 15:18:46,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-15 15:18:50,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-15 15:18:54,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-15 15:18:58,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-15 15:19:03,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-15 15:19:07,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]