./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec.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.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 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a --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:37,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 15:14:37,484 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 15:14:37,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 15:14:37,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 15:14:37,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 15:14:37,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 15:14:37,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 15:14:37,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 15:14:37,516 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 15:14:37,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 15:14:37,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 15:14:37,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 15:14:37,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 15:14:37,519 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 15:14:37,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 15:14:37,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 15:14:37,519 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 15:14:37,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 15:14:37,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 15:14:37,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 15:14:37,520 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 15:14:37,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 15:14:37,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 15:14:37,523 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 15:14:37,523 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 15:14:37,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 15:14:37,523 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 15:14:37,523 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 15:14:37,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 15:14:37,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 15:14:37,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 15:14:37,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:14:37,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 15:14:37,524 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 15:14:37,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 15:14:37,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 15:14:37,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 15:14:37,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 15:14:37,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 15:14:37,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 15:14:37,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 15:14:37,527 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 -> 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a 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:37,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 15:14:37,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 15:14:37,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 15:14:37,754 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 15:14:37,754 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 15:14:37,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-10-15 15:14:39,002 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 15:14:39,168 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 15:14:39,169 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-10-15 15:14:39,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/5a7ce25f3/218d79bb35ad441993dcef8139791570/FLAG6c33807c9 [2024-10-15 15:14:39,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/5a7ce25f3/218d79bb35ad441993dcef8139791570 [2024-10-15 15:14:39,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 15:14:39,187 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 15:14:39,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 15:14:39,188 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 15:14:39,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 15:14:39,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:14:39" (1/1) ... [2024-10-15 15:14:39,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69509660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:39, skipping insertion in model container [2024-10-15 15:14:39,193 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:14:39" (1/1) ... [2024-10-15 15:14:39,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 15:14:39,331 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.c[493,506] [2024-10-15 15:14:39,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:14:39,358 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 15:14:39,367 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.c[493,506] [2024-10-15 15:14:39,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:14:39,392 INFO L204 MainTranslator]: Completed translation [2024-10-15 15:14:39,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:39 WrapperNode [2024-10-15 15:14:39,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 15:14:39,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 15:14:39,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 15:14:39,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 15:14:39,401 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:39" (1/1) ... [2024-10-15 15:14:39,407 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:39" (1/1) ... [2024-10-15 15:14:39,412 INFO L138 Inliner]: procedures = 19, calls = 20, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 15:14:39,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 15:14:39,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 15:14:39,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 15:14:39,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 15:14:39,420 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:39" (1/1) ... [2024-10-15 15:14:39,420 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:39" (1/1) ... [2024-10-15 15:14:39,422 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:39" (1/1) ... [2024-10-15 15:14:39,435 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 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:39,435 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:39" (1/1) ... [2024-10-15 15:14:39,435 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:39" (1/1) ... [2024-10-15 15:14:39,439 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:39" (1/1) ... [2024-10-15 15:14:39,440 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:39" (1/1) ... [2024-10-15 15:14:39,441 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:39" (1/1) ... [2024-10-15 15:14:39,441 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:39" (1/1) ... [2024-10-15 15:14:39,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 15:14:39,444 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 15:14:39,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 15:14:39,444 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 15:14:39,445 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:39" (1/1) ... [2024-10-15 15:14:39,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:14:39,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:14:39,473 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:39,478 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:39,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 15:14:39,518 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-15 15:14:39,518 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-15 15:14:39,518 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 15:14:39,518 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 15:14:39,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 15:14:39,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-15 15:14:39,519 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-10-15 15:14:39,520 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-10-15 15:14:39,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 15:14:39,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 15:14:39,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-15 15:14:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 15:14:39,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 15:14:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 15:14:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-15 15:14:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-15 15:14:39,521 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-15 15:14:39,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 15:14:39,522 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 15:14:39,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 15:14:39,594 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 15:14:39,596 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 15:14:39,753 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-15 15:14:39,753 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 15:14:39,771 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 15:14:39,771 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-15 15:14:39,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:14:39 BoogieIcfgContainer [2024-10-15 15:14:39,771 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 15:14:39,773 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 15:14:39,773 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 15:14:39,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 15:14:39,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:14:39" (1/3) ... [2024-10-15 15:14:39,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5940d3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:14:39, skipping insertion in model container [2024-10-15 15:14:39,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:39" (2/3) ... [2024-10-15 15:14:39,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5940d3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:14:39, skipping insertion in model container [2024-10-15 15:14:39,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:14:39" (3/3) ... [2024-10-15 15:14:39,795 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2024-10-15 15:14:39,806 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 15:14:39,806 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 15:14:39,844 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 15:14:39,848 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;@221c4ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 15:14:39,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 15:14:39,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-15 15:14:39,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-15 15:14:39,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:14:39,857 INFO L215 NwaCegarLoop]: trace histogram [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:39,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:14:39,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:39,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2039448540, now seen corresponding path program 1 times [2024-10-15 15:14:39,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:14:39,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145416201] [2024-10-15 15:14:39,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:39,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:14:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:39,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:14:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:39,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:14:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:40,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 15:14:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:14:40,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:14:40,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145416201] [2024-10-15 15:14:40,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145416201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:14:40,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:14:40,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 15:14:40,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393807309] [2024-10-15 15:14:40,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:14:40,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-15 15:14:40,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:14:40,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 15:14:40,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 15:14:40,039 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-15 15:14:40,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:14:40,123 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2024-10-15 15:14:40,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 15:14:40,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-10-15 15:14:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:14:40,132 INFO L225 Difference]: With dead ends: 72 [2024-10-15 15:14:40,132 INFO L226 Difference]: Without dead ends: 35 [2024-10-15 15:14:40,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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:40,137 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:14:40,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 16 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:14:40,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-15 15:14:40,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-15 15:14:40,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-15 15:14:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-10-15 15:14:40,171 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2024-10-15 15:14:40,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:14:40,171 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-10-15 15:14:40,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-15 15:14:40,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:40,172 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-10-15 15:14:40,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-15 15:14:40,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:14:40,173 INFO L215 NwaCegarLoop]: trace histogram [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:40,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 15:14:40,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:14:40,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:40,175 INFO L85 PathProgramCache]: Analyzing trace with hash 975655078, now seen corresponding path program 1 times [2024-10-15 15:14:40,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:14:40,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350261676] [2024-10-15 15:14:40,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:40,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:14:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:40,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:14:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:40,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:14:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:40,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 15:14:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:40,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:14:40,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:14:40,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350261676] [2024-10-15 15:14:40,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350261676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:14:40,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:14:40,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 15:14:40,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918462717] [2024-10-15 15:14:40,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:14:40,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 15:14:40,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:14:40,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 15:14:40,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-15 15:14:40,463 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-15 15:14:40,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:14:40,694 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2024-10-15 15:14:40,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 15:14:40,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2024-10-15 15:14:40,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:14:40,697 INFO L225 Difference]: With dead ends: 62 [2024-10-15 15:14:40,698 INFO L226 Difference]: Without dead ends: 60 [2024-10-15 15:14:40,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 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:40,700 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 56 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:14:40,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 46 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:14:40,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-15 15:14:40,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2024-10-15 15:14:40,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-15 15:14:40,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2024-10-15 15:14:40,722 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 22 [2024-10-15 15:14:40,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:14:40,722 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-10-15 15:14:40,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-15 15:14:40,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:40,723 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2024-10-15 15:14:40,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-15 15:14:40,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:14:40,725 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-15 15:14:40,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 15:14:40,725 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:14:40,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:40,727 INFO L85 PathProgramCache]: Analyzing trace with hash -599674086, now seen corresponding path program 1 times [2024-10-15 15:14:40,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:14:40,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510907129] [2024-10-15 15:14:40,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:40,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:14:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:40,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:14:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:41,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:14:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:41,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 15:14:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:41,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-15 15:14:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:41,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:14:41,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:14:41,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510907129] [2024-10-15 15:14:41,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510907129] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:14:41,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131932102] [2024-10-15 15:14:41,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:41,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:14:41,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:14:41,034 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:41,035 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:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:41,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-15 15:14:41,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:14:41,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:14:41,234 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 15:14:41,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131932102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:14:41,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 15:14:41,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2024-10-15 15:14:41,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619942495] [2024-10-15 15:14:41,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:14:41,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-15 15:14:41,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:14:41,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 15:14:41,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-15 15:14:41,236 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 15:14:41,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:14:41,377 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2024-10-15 15:14:41,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-15 15:14:41,378 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-10-15 15:14:41,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:14:41,379 INFO L225 Difference]: With dead ends: 70 [2024-10-15 15:14:41,379 INFO L226 Difference]: Without dead ends: 68 [2024-10-15 15:14:41,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-10-15 15:14:41,380 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 39 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:14:41,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 187 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:14:41,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-15 15:14:41,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2024-10-15 15:14:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-15 15:14:41,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-10-15 15:14:41,391 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2024-10-15 15:14:41,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:14:41,391 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-10-15 15:14:41,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 15:14:41,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:41,392 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-10-15 15:14:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-15 15:14:41,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:14:41,393 INFO L215 NwaCegarLoop]: trace histogram [2, 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] [2024-10-15 15:14:41,407 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:41,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:14:41,596 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:14:41,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:41,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1182090583, now seen corresponding path program 1 times [2024-10-15 15:14:41,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:14:41,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333091634] [2024-10-15 15:14:41,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:41,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:14:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:41,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:14:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:41,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:14:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:41,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 15:14:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:41,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-15 15:14:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:41,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-15 15:14:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:41,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-15 15:14:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 15:14:41,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:14:41,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333091634] [2024-10-15 15:14:41,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333091634] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:14:41,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128895680] [2024-10-15 15:14:41,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:41,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:14:41,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:14:41,866 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:41,867 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:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:41,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-15 15:14:41,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:14:41,957 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:42,196 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:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:14:42,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:14:46,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128895680] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:14:46,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 15:14:46,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 20 [2024-10-15 15:14:46,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287106038] [2024-10-15 15:14:46,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 15:14:46,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-15 15:14:46,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:14:46,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-15 15:14:46,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-10-15 15:14:46,376 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 20 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-15 15:14:46,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:14:46,717 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2024-10-15 15:14:46,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-15 15:14:46,717 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 41 [2024-10-15 15:14:46,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:14:46,718 INFO L225 Difference]: With dead ends: 45 [2024-10-15 15:14:46,718 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 15:14:46,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2024-10-15 15:14:46,719 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 56 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:14:46,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 56 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:14:46,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 15:14:46,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 15:14:46,720 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:14:46,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 15:14:46,720 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2024-10-15 15:14:46,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:14:46,720 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 15:14:46,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-15 15:14:46,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:46,720 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 15:14:46,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 15:14:46,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-15 15:14:46,735 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:46,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:14:46,929 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-15 15:14:46,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 15:14:47,747 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 15:14:47,755 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:14:47,758 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:14:47,761 INFO L158 Benchmark]: Toolchain (without parser) took 8574.61ms. Allocated memory was 167.8MB in the beginning and 255.9MB in the end (delta: 88.1MB). Free memory was 111.9MB in the beginning and 93.0MB in the end (delta: 18.9MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. [2024-10-15 15:14:47,761 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 15:14:47,762 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.44ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 99.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 15:14:47,762 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.65ms. Allocated memory is still 167.8MB. Free memory was 99.2MB in the beginning and 98.3MB in the end (delta: 940.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 15:14:47,762 INFO L158 Benchmark]: Boogie Preprocessor took 30.03ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 96.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 15:14:47,762 INFO L158 Benchmark]: RCFGBuilder took 327.69ms. Allocated memory is still 167.8MB. Free memory was 96.3MB in the beginning and 80.8MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-15 15:14:47,763 INFO L158 Benchmark]: TraceAbstraction took 7987.58ms. Allocated memory was 167.8MB in the beginning and 255.9MB in the end (delta: 88.1MB). Free memory was 80.4MB in the beginning and 93.0MB in the end (delta: -12.5MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2024-10-15 15:14:47,763 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.15ms. Allocated memory is still 167.8MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.44ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 99.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.65ms. Allocated memory is still 167.8MB. Free memory was 99.2MB in the beginning and 98.3MB in the end (delta: 940.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.03ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 96.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 327.69ms. Allocated memory is still 167.8MB. Free memory was 96.3MB in the beginning and 80.8MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7987.58ms. Allocated memory was 167.8MB in the beginning and 255.9MB in the end (delta: 88.1MB). Free memory was 80.4MB in the beginning and 93.0MB in the end (delta: -12.5MB). Peak memory consumption was 77.6MB. 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, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 305 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 235 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 727 IncrementalHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 70 mSDtfsCounter, 727 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=2, InterpolantAutomatonStates: 32, 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, 4 MinimizatonAttempts, 36 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 184 ConstructedInterpolants, 13 QuantifiedInterpolants, 680 SizeOfPredicates, 17 NumberOfNonLiveVariables, 326 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 17/26 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 - 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:14:47,792 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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.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 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a --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:49,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 15:14:49,583 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-15 15:14:49,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 15:14:49,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 15:14:49,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 15:14:49,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 15:14:49,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 15:14:49,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 15:14:49,616 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 15:14:49,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 15:14:49,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 15:14:49,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 15:14:49,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 15:14:49,620 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 15:14:49,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 15:14:49,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 15:14:49,620 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 15:14:49,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 15:14:49,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 15:14:49,621 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 15:14:49,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 15:14:49,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 15:14:49,624 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-15 15:14:49,625 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-15 15:14:49,625 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 15:14:49,625 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-15 15:14:49,625 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 15:14:49,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 15:14:49,625 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 15:14:49,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 15:14:49,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 15:14:49,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 15:14:49,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 15:14:49,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:14:49,626 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 15:14:49,626 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 15:14:49,626 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 15:14:49,627 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-15 15:14:49,627 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-15 15:14:49,627 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 15:14:49,627 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 15:14:49,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 15:14:49,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 15:14:49,628 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-15 15:14:49,628 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 -> 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a 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:49,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 15:14:49,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 15:14:49,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 15:14:49,892 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 15:14:49,894 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 15:14:49,895 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-10-15 15:14:51,212 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 15:14:51,342 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 15:14:51,343 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-10-15 15:14:51,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a137993d6/cb844a15954b41b18488cce68ccb0c24/FLAG7630bf2c2 [2024-10-15 15:14:51,364 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a137993d6/cb844a15954b41b18488cce68ccb0c24 [2024-10-15 15:14:51,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 15:14:51,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 15:14:51,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 15:14:51,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 15:14:51,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 15:14:51,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:14:51" (1/1) ... [2024-10-15 15:14:51,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@414f4d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:51, skipping insertion in model container [2024-10-15 15:14:51,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:14:51" (1/1) ... [2024-10-15 15:14:51,393 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 15:14:51,544 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.c[493,506] [2024-10-15 15:14:51,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:14:51,575 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 15:14:51,585 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.c[493,506] [2024-10-15 15:14:51,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:14:51,608 INFO L204 MainTranslator]: Completed translation [2024-10-15 15:14:51,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:51 WrapperNode [2024-10-15 15:14:51,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 15:14:51,609 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 15:14:51,609 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 15:14:51,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 15:14:51,614 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:51" (1/1) ... [2024-10-15 15:14:51,626 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:51" (1/1) ... [2024-10-15 15:14:51,631 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 15:14:51,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 15:14:51,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 15:14:51,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 15:14:51,633 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 15:14:51,639 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:51" (1/1) ... [2024-10-15 15:14:51,639 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:51" (1/1) ... [2024-10-15 15:14:51,643 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:51" (1/1) ... [2024-10-15 15:14:51,655 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 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:51,656 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:51" (1/1) ... [2024-10-15 15:14:51,656 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:51" (1/1) ... [2024-10-15 15:14:51,664 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:51" (1/1) ... [2024-10-15 15:14:51,666 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:51" (1/1) ... [2024-10-15 15:14:51,668 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:51" (1/1) ... [2024-10-15 15:14:51,669 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:51" (1/1) ... [2024-10-15 15:14:51,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 15:14:51,672 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 15:14:51,673 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 15:14:51,673 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 15:14:51,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:51" (1/1) ... [2024-10-15 15:14:51,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:14:51,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:14:51,698 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:51,700 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:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 15:14:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-15 15:14:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-15 15:14:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-15 15:14:51,732 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-15 15:14:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 15:14:51,733 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 15:14:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-10-15 15:14:51,733 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-10-15 15:14:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 15:14:51,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 15:14:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-15 15:14:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-15 15:14:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-15 15:14:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 15:14:51,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 15:14:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-15 15:14:51,733 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-15 15:14:51,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 15:14:51,734 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 15:14:51,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 15:14:51,794 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 15:14:51,796 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 15:14:51,949 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-15 15:14:51,949 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 15:14:51,987 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 15:14:51,987 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-15 15:14:51,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:14:51 BoogieIcfgContainer [2024-10-15 15:14:51,987 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 15:14:51,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 15:14:51,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 15:14:51,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 15:14:51,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:14:51" (1/3) ... [2024-10-15 15:14:51,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0e56bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:14:51, skipping insertion in model container [2024-10-15 15:14:51,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:51" (2/3) ... [2024-10-15 15:14:51,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0e56bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:14:51, skipping insertion in model container [2024-10-15 15:14:51,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:14:51" (3/3) ... [2024-10-15 15:14:51,996 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2024-10-15 15:14:52,009 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 15:14:52,010 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 15:14:52,053 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 15:14:52,058 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;@3cc8831e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 15:14:52,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 15:14:52,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-15 15:14:52,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-15 15:14:52,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:14:52,067 INFO L215 NwaCegarLoop]: trace histogram [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,067 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:14:52,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:52,071 INFO L85 PathProgramCache]: Analyzing trace with hash -2039448540, now seen corresponding path program 1 times [2024-10-15 15:14:52,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-15 15:14:52,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074446664] [2024-10-15 15:14:52,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:52,080 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:14:52,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-10-15 15:14:52,083 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:14:52,084 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:14:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:52,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-15 15:14:52,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:14:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:14:52,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 15:14:52,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-15 15:14:52,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074446664] [2024-10-15 15:14:52,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074446664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:14:52,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:14:52,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 15:14:52,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939897745] [2024-10-15 15:14:52,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:14:52,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-15 15:14:52,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-15 15:14:52,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 15:14:52,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 15:14:52,196 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-15 15:14:52,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:14:52,221 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2024-10-15 15:14:52,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 15:14:52,223 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-10-15 15:14:52,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:14:52,228 INFO L225 Difference]: With dead ends: 72 [2024-10-15 15:14:52,228 INFO L226 Difference]: Without dead ends: 35 [2024-10-15 15:14:52,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 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:14:52,235 INFO L432 NwaCegarLoop]: 40 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, 40 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:14:52,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 15:14:52,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-15 15:14:52,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-15 15:14:52,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-15 15:14:52,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-10-15 15:14:52,265 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2024-10-15 15:14:52,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:14:52,266 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-10-15 15:14:52,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-15 15:14:52,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:52,267 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-10-15 15:14:52,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-15 15:14:52,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:14:52,268 INFO L215 NwaCegarLoop]: trace histogram [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,272 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:14:52,468 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:14:52,469 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:14:52,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:52,470 INFO L85 PathProgramCache]: Analyzing trace with hash 975655078, now seen corresponding path program 1 times [2024-10-15 15:14:52,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-15 15:14:52,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675496623] [2024-10-15 15:14:52,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:52,471 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:14:52,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-10-15 15:14:52,473 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:14:52,474 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:14:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:52,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 15:14:52,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:14:52,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:14:52,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 15:14:52,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-15 15:14:52,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675496623] [2024-10-15 15:14:52,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675496623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:14:52,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:14:52,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-15 15:14:52,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346591787] [2024-10-15 15:14:52,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:14:52,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-15 15:14:52,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-15 15:14:52,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-15 15:14:52,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-15 15:14:52,826 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-15 15:14:53,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:14:53,078 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2024-10-15 15:14:53,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-15 15:14:53,079 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-10-15 15:14:53,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:14:53,080 INFO L225 Difference]: With dead ends: 54 [2024-10-15 15:14:53,081 INFO L226 Difference]: Without dead ends: 49 [2024-10-15 15:14:53,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-15 15:14:53,082 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:14:53,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 179 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:14:53,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-15 15:14:53,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-15 15:14:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-15 15:14:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2024-10-15 15:14:53,101 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 22 [2024-10-15 15:14:53,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:14:53,102 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2024-10-15 15:14:53,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-15 15:14:53,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:53,103 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2024-10-15 15:14:53,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-15 15:14:53,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:14:53,105 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-15 15:14:53,108 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 (3)] Ended with exit code 0 [2024-10-15 15:14:53,305 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:14:53,306 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:14:53,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:53,306 INFO L85 PathProgramCache]: Analyzing trace with hash -599674086, now seen corresponding path program 1 times [2024-10-15 15:14:53,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-15 15:14:53,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229819101] [2024-10-15 15:14:53,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:53,307 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:14:53,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-10-15 15:14:53,310 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:14:53,310 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:14:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:53,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-15 15:14:53,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:14:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:14:53,771 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:14:54,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:14:54,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-15 15:14:54,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229819101] [2024-10-15 15:14:54,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229819101] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:14:54,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 15:14:54,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 20 [2024-10-15 15:14:54,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387775937] [2024-10-15 15:14:54,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 15:14:54,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-15 15:14:54,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-15 15:14:54,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-15 15:14:54,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-10-15 15:14:54,027 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-15 15:14:55,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:14:55,054 INFO L93 Difference]: Finished difference Result 108 states and 140 transitions. [2024-10-15 15:14:55,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-15 15:14:55,055 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 32 [2024-10-15 15:14:55,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:14:55,057 INFO L225 Difference]: With dead ends: 108 [2024-10-15 15:14:55,057 INFO L226 Difference]: Without dead ends: 106 [2024-10-15 15:14:55,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=766, Unknown=0, NotChecked=0, Total=930 [2024-10-15 15:14:55,059 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 60 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-15 15:14:55,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 523 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-15 15:14:55,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-15 15:14:55,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 82. [2024-10-15 15:14:55,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 52 states have internal predecessors, (56), 24 states have call successors, (24), 11 states have call predecessors, (24), 9 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-15 15:14:55,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2024-10-15 15:14:55,080 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 32 [2024-10-15 15:14:55,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:14:55,081 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2024-10-15 15:14:55,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-15 15:14:55,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2024-10-15 15:14:55,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-15 15:14:55,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:14:55,083 INFO L215 NwaCegarLoop]: trace histogram [2, 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] [2024-10-15 15:14:55,087 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 (4)] Forceful destruction successful, exit code 0 [2024-10-15 15:14:55,283 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:14:55,284 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:14:55,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:55,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1182090583, now seen corresponding path program 1 times [2024-10-15 15:14:55,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-15 15:14:55,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648124604] [2024-10-15 15:14:55,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:55,285 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:14:55,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-10-15 15:14:55,287 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:14:55,288 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:14:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:55,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-15 15:14:55,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:15:00,607 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-15 15:15:00,608 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-15 15:15:00,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-15 15:15:00,769 INFO L349 Elim1Store]: treesize reduction 96, result has 47.3 percent of original size [2024-10-15 15:15:00,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 56 treesize of output 101 [2024-10-15 15:15:00,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:15:00,906 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:15:01,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-15 15:15:01,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648124604] [2024-10-15 15:15:01,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [648124604] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:15:01,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1581871894] [2024-10-15 15:15:01,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:15:01,147 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-15 15:15:01,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-10-15 15:15:01,149 INFO L229 MonitoredProcess]: Starting monitored process 6 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:01,150 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-15 15:15:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:15:01,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-15 15:15:01,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:15:01,247 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:15:37,285 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_3 (_ BitVec 32))) (= (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_3) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2024-10-15 15:15:44,464 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_4 (_ BitVec 32))) (= (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_4) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2024-10-15 15:15:52,085 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_5 (_ BitVec 32))) (= (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_5) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2024-10-15 15:15:54,131 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:15:54,284 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-15 15:15:54,285 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:16:22,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1581871894] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:16:22,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 15:16:22,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13] total 33 [2024-10-15 15:16:22,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97869389] [2024-10-15 15:16:22,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 15:16:22,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-15 15:16:22,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-15 15:16:22,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-15 15:16:22,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1078, Unknown=15, NotChecked=204, Total=1406 [2024-10-15 15:16:22,655 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 33 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 24 states have internal predecessors, (47), 10 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-15 15:16:26,827 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:16:30,864 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:16:36,621 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:16:40,655 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:17:28,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-15 15:18:32,456 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:35,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-15 15:18:37,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-15 15:18:41,207 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:45,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s 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,355 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,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:18:50,380 INFO L93 Difference]: Finished difference Result 149 states and 181 transitions. [2024-10-15 15:18:50,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-15 15:18:50,381 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 24 states have internal predecessors, (47), 10 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Word has length 41 [2024-10-15 15:18:50,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:18:50,383 INFO L225 Difference]: With dead ends: 149 [2024-10-15 15:18:50,384 INFO L226 Difference]: Without dead ends: 56 [2024-10-15 15:18:50,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 192.9s TimeCoverageRelationStatistics Valid=345, Invalid=2719, Unknown=28, NotChecked=330, Total=3422 [2024-10-15 15:18:50,386 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 68 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 41 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 41.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:18:50,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 416 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 557 Invalid, 8 Unknown, 188 Unchecked, 41.1s Time] [2024-10-15 15:18:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-15 15:18:50,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-10-15 15:18:50,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 12 states have call successors, (12), 11 states have call predecessors, (12), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-15 15:18:50,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2024-10-15 15:18:50,395 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 41 [2024-10-15 15:18:50,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:18:50,395 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-10-15 15:18:50,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 24 states have internal predecessors, (47), 10 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-15 15:18:50,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:18:50,396 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-10-15 15:18:50,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-15 15:18:50,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:18:50,397 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:18:50,403 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:18:50,600 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-10-15 15:18:50,798 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,6 /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt [2024-10-15 15:18:50,798 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:18:50,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:18:50,799 INFO L85 PathProgramCache]: Analyzing trace with hash -837710144, now seen corresponding path program 1 times [2024-10-15 15:18:50,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-15 15:18:50,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976855329] [2024-10-15 15:18:50,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:18:50,799 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:18:50,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-10-15 15:18:50,800 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:18:50,801 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:18:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:18:50,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-15 15:18:50,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:18:52,085 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-15 15:18:52,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:18:54,209 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-15 15:18:54,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-15 15:18:54,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976855329] [2024-10-15 15:18:54,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976855329] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:18:54,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 15:18:54,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 31 [2024-10-15 15:18:54,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844646912] [2024-10-15 15:18:54,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 15:18:54,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-15 15:18:54,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-15 15:18:54,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-15 15:18:54,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2024-10-15 15:18:54,211 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 31 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 23 states have internal predecessors, (54), 12 states have call successors, (21), 10 states have call predecessors, (21), 3 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-10-15 15:19:00,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:19:00,273 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2024-10-15 15:19:00,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-15 15:19:00,274 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 23 states have internal predecessors, (54), 12 states have call successors, (21), 10 states have call predecessors, (21), 3 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) Word has length 52 [2024-10-15 15:19:00,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:19:00,276 INFO L225 Difference]: With dead ends: 85 [2024-10-15 15:19:00,276 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 15:19:00,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=610, Invalid=2582, Unknown=0, NotChecked=0, Total=3192 [2024-10-15 15:19:00,278 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 94 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-15 15:19:00,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 280 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-15 15:19:00,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 15:19:00,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 15:19:00,278 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:19:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 15:19:00,279 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2024-10-15 15:19:00,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:19:00,279 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 15:19:00,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 23 states have internal predecessors, (54), 12 states have call successors, (21), 10 states have call predecessors, (21), 3 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-10-15 15:19:00,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:19:00,279 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 15:19:00,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 15:19:00,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-15 15:19:00,286 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 (7)] Forceful destruction successful, exit code 0 [2024-10-15 15:19:00,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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:19:00,485 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-15 15:19:00,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 15:19:15,573 WARN L286 SmtUtils]: Spent 6.43s on a formula simplification. DAG size of input: 150 DAG size of output: 78 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter)