./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_262cfdef-b130-40d4-b837-bdd2f2b5c544/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_262cfdef-b130-40d4-b837-bdd2f2b5c544/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_262cfdef-b130-40d4-b837-bdd2f2b5c544/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_262cfdef-b130-40d4-b837-bdd2f2b5c544/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_262cfdef-b130-40d4-b837-bdd2f2b5c544/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_262cfdef-b130-40d4-b837-bdd2f2b5c544/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:12:32,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:12:32,394 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_262cfdef-b130-40d4-b837-bdd2f2b5c544/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-13 13:12:32,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:12:32,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:12:32,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:12:32,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:12:32,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:12:32,419 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:12:32,419 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:12:32,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:12:32,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:12:32,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:12:32,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:12:32,420 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:12:32,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:12:32,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:12:32,420 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:12:32,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:12:32,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:12:32,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:12:32,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:12:32,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:12:32,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:12:32,421 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:12:32,421 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-13 13:12:32,421 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:12:32,421 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:12:32,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:12:32,421 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:12:32,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:12:32,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:12:32,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:12:32,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:12:32,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:12:32,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:12:32,422 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:12:32,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:12:32,422 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:12:32,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:12:32,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:12:32,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:12:32,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:12:32,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:12:32,423 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_262cfdef-b130-40d4-b837-bdd2f2b5c544/bin/uautomizer-verify-qhAvR1uOyd 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 ! overflow) ) 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 -> 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 [2024-11-13 13:12:32,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:12:32,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:12:32,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:12:32,714 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:12:32,714 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:12:32,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_262cfdef-b130-40d4-b837-bdd2f2b5c544/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c Unable to find full path for "g++" [2024-11-13 13:12:34,882 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:12:35,116 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:12:35,117 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_262cfdef-b130-40d4-b837-bdd2f2b5c544/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2024-11-13 13:12:35,133 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_262cfdef-b130-40d4-b837-bdd2f2b5c544/bin/uautomizer-verify-qhAvR1uOyd/data/8c54385b5/359318631bdf47b39a26af416d68a969/FLAG601b0a5ff [2024-11-13 13:12:35,159 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_262cfdef-b130-40d4-b837-bdd2f2b5c544/bin/uautomizer-verify-qhAvR1uOyd/data/8c54385b5/359318631bdf47b39a26af416d68a969 [2024-11-13 13:12:35,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:12:35,164 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:12:35,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:12:35,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:12:35,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:12:35,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:12:35" (1/1) ... [2024-11-13 13:12:35,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13fd7640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:35, skipping insertion in model container [2024-11-13 13:12:35,178 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:12:35" (1/1) ... [2024-11-13 13:12:35,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:12:35,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:12:35,470 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:12:35,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:12:35,551 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:12:35,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:35 WrapperNode [2024-11-13 13:12:35,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:12:35,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:12:35,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:12:35,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:12:35,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:35" (1/1) ... [2024-11-13 13:12:35,569 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:35" (1/1) ... [2024-11-13 13:12:35,599 INFO L138 Inliner]: procedures = 30, calls = 35, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 220 [2024-11-13 13:12:35,603 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:12:35,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:12:35,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:12:35,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:12:35,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:35" (1/1) ... [2024-11-13 13:12:35,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:35" (1/1) ... [2024-11-13 13:12:35,618 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:35" (1/1) ... [2024-11-13 13:12:35,645 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 13:12:35,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:35" (1/1) ... [2024-11-13 13:12:35,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:35" (1/1) ... [2024-11-13 13:12:35,653 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:35" (1/1) ... [2024-11-13 13:12:35,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:35" (1/1) ... [2024-11-13 13:12:35,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:35" (1/1) ... [2024-11-13 13:12:35,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:35" (1/1) ... [2024-11-13 13:12:35,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:12:35,678 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:12:35,679 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:12:35,680 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:12:35,681 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:35" (1/1) ... [2024-11-13 13:12:35,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:12:35,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_262cfdef-b130-40d4-b837-bdd2f2b5c544/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:12:35,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_262cfdef-b130-40d4-b837-bdd2f2b5c544/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:12:35,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_262cfdef-b130-40d4-b837-bdd2f2b5c544/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:12:35,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:12:35,756 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-13 13:12:35,757 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-13 13:12:35,757 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-13 13:12:35,757 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-13 13:12:35,757 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-13 13:12:35,757 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-13 13:12:35,757 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-13 13:12:35,757 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-13 13:12:35,757 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-13 13:12:35,757 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-13 13:12:35,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:12:35,758 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-13 13:12:35,758 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-13 13:12:35,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:12:35,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:12:35,848 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:12:35,851 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:12:36,344 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-13 13:12:36,346 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:12:36,363 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:12:36,366 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-13 13:12:36,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:12:36 BoogieIcfgContainer [2024-11-13 13:12:36,366 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:12:36,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:12:36,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:12:36,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:12:36,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:12:35" (1/3) ... [2024-11-13 13:12:36,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f59f0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:12:36, skipping insertion in model container [2024-11-13 13:12:36,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:35" (2/3) ... [2024-11-13 13:12:36,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f59f0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:12:36, skipping insertion in model container [2024-11-13 13:12:36,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:12:36" (3/3) ... [2024-11-13 13:12:36,379 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2024-11-13 13:12:36,397 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:12:36,400 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.01.cil-1.c that has 7 procedures, 116 locations, 1 initial locations, 4 loop locations, and 4 error locations. [2024-11-13 13:12:36,477 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:12:36,492 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=LoopHeads, 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;@36fb18aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:12:36,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-13 13:12:36,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 90 states have (on average 1.5222222222222221) internal successors, (137), 95 states have internal predecessors, (137), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 13:12:36,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-13 13:12:36,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:36,511 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:36,512 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 13:12:36,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:36,518 INFO L85 PathProgramCache]: Analyzing trace with hash 777908495, now seen corresponding path program 1 times [2024-11-13 13:12:36,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:36,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762233174] [2024-11-13 13:12:36,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:36,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:36,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:12:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:36,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:12:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:37,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:12:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:37,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:12:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:37,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:12:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:37,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:37,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762233174] [2024-11-13 13:12:37,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762233174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:37,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:37,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:12:37,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962475739] [2024-11-13 13:12:37,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:37,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:12:37,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:37,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:12:37,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:12:37,132 INFO L87 Difference]: Start difference. First operand has 116 states, 90 states have (on average 1.5222222222222221) internal successors, (137), 95 states have internal predecessors, (137), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:38,119 INFO L93 Difference]: Finished difference Result 364 states and 536 transitions. [2024-11-13 13:12:38,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:12:38,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-11-13 13:12:38,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:38,136 INFO L225 Difference]: With dead ends: 364 [2024-11-13 13:12:38,137 INFO L226 Difference]: Without dead ends: 247 [2024-11-13 13:12:38,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:12:38,145 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 309 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:38,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 423 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 13:12:38,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-13 13:12:38,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 204. [2024-11-13 13:12:38,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 162 states have (on average 1.4444444444444444) internal successors, (234), 167 states have internal predecessors, (234), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2024-11-13 13:12:38,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 287 transitions. [2024-11-13 13:12:38,294 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 287 transitions. Word has length 55 [2024-11-13 13:12:38,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:38,294 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 287 transitions. [2024-11-13 13:12:38,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:38,297 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 287 transitions. [2024-11-13 13:12:38,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-13 13:12:38,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:38,299 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:38,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:12:38,301 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 13:12:38,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:38,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1052624629, now seen corresponding path program 1 times [2024-11-13 13:12:38,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:38,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246119083] [2024-11-13 13:12:38,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:38,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:38,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:12:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:38,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:12:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:38,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:12:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:38,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:12:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:38,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:12:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:38,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:38,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:38,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246119083] [2024-11-13 13:12:38,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246119083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:38,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:38,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:12:38,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648211552] [2024-11-13 13:12:38,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:38,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:12:38,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:38,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:12:38,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:12:38,557 INFO L87 Difference]: Start difference. First operand 204 states and 287 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:39,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:39,651 INFO L93 Difference]: Finished difference Result 555 states and 783 transitions. [2024-11-13 13:12:39,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:12:39,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-11-13 13:12:39,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:39,658 INFO L225 Difference]: With dead ends: 555 [2024-11-13 13:12:39,660 INFO L226 Difference]: Without dead ends: 360 [2024-11-13 13:12:39,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:12:39,665 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 293 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:39,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 700 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 13:12:39,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-13 13:12:39,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 294. [2024-11-13 13:12:39,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 235 states have (on average 1.4340425531914893) internal successors, (337), 241 states have internal predecessors, (337), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2024-11-13 13:12:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 412 transitions. [2024-11-13 13:12:39,742 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 412 transitions. Word has length 55 [2024-11-13 13:12:39,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:39,743 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 412 transitions. [2024-11-13 13:12:39,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:39,743 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 412 transitions. [2024-11-13 13:12:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-13 13:12:39,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:39,748 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:39,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:12:39,750 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 13:12:39,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:39,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1950017907, now seen corresponding path program 1 times [2024-11-13 13:12:39,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:39,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640958509] [2024-11-13 13:12:39,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:39,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:39,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:12:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:39,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:12:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:39,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:12:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:40,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:12:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:40,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:12:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:40,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:40,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640958509] [2024-11-13 13:12:40,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640958509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:40,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:40,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:12:40,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977520199] [2024-11-13 13:12:40,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:40,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:12:40,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:40,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:12:40,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:12:40,026 INFO L87 Difference]: Start difference. First operand 294 states and 412 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:41,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:41,051 INFO L93 Difference]: Finished difference Result 906 states and 1274 transitions. [2024-11-13 13:12:41,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:12:41,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-11-13 13:12:41,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:41,061 INFO L225 Difference]: With dead ends: 906 [2024-11-13 13:12:41,061 INFO L226 Difference]: Without dead ends: 621 [2024-11-13 13:12:41,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-13 13:12:41,064 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 348 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:41,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 688 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 13:12:41,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-11-13 13:12:41,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 467. [2024-11-13 13:12:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 376 states have (on average 1.4202127659574468) internal successors, (534), 384 states have internal predecessors, (534), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2024-11-13 13:12:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 653 transitions. [2024-11-13 13:12:41,151 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 653 transitions. Word has length 55 [2024-11-13 13:12:41,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:41,151 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 653 transitions. [2024-11-13 13:12:41,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:41,151 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 653 transitions. [2024-11-13 13:12:41,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-13 13:12:41,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:41,156 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:41,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:12:41,156 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 13:12:41,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:41,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1701871413, now seen corresponding path program 1 times [2024-11-13 13:12:41,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:41,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888210475] [2024-11-13 13:12:41,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:41,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:41,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:12:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:41,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:12:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:41,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:12:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:41,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:12:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:41,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:12:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:41,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:41,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:41,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888210475] [2024-11-13 13:12:41,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888210475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:41,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:41,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:12:41,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034900140] [2024-11-13 13:12:41,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:41,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:12:41,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:41,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:12:41,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:12:41,331 INFO L87 Difference]: Start difference. First operand 467 states and 653 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:42,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:42,303 INFO L93 Difference]: Finished difference Result 1452 states and 2035 transitions. [2024-11-13 13:12:42,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:12:42,304 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-11-13 13:12:42,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:42,310 INFO L225 Difference]: With dead ends: 1452 [2024-11-13 13:12:42,310 INFO L226 Difference]: Without dead ends: 994 [2024-11-13 13:12:42,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-13 13:12:42,312 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 288 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:42,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 658 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 13:12:42,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2024-11-13 13:12:42,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 776. [2024-11-13 13:12:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 627 states have (on average 1.4098883572567784) internal successors, (884), 639 states have internal predecessors, (884), 85 states have call successors, (85), 52 states have call predecessors, (85), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2024-11-13 13:12:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1089 transitions. [2024-11-13 13:12:42,402 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1089 transitions. Word has length 55 [2024-11-13 13:12:42,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:42,402 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1089 transitions. [2024-11-13 13:12:42,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:42,402 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1089 transitions. [2024-11-13 13:12:42,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-13 13:12:42,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:42,405 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:42,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:12:42,407 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 13:12:42,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:42,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1278224691, now seen corresponding path program 1 times [2024-11-13 13:12:42,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:42,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499392640] [2024-11-13 13:12:42,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:42,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:42,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:12:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:42,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:12:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:42,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:12:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:42,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:12:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:42,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:12:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:42,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:42,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499392640] [2024-11-13 13:12:42,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499392640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:42,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:42,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:12:42,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079559140] [2024-11-13 13:12:42,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:42,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:12:42,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:42,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:12:42,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:12:42,499 INFO L87 Difference]: Start difference. First operand 776 states and 1089 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:43,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:43,377 INFO L93 Difference]: Finished difference Result 2163 states and 3049 transitions. [2024-11-13 13:12:43,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:12:43,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-11-13 13:12:43,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:43,390 INFO L225 Difference]: With dead ends: 2163 [2024-11-13 13:12:43,390 INFO L226 Difference]: Without dead ends: 1397 [2024-11-13 13:12:43,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-13 13:12:43,393 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 411 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:43,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 502 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:12:43,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2024-11-13 13:12:43,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1190. [2024-11-13 13:12:43,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 958 states have (on average 1.3872651356993737) internal successors, (1329), 979 states have internal predecessors, (1329), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2024-11-13 13:12:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1642 transitions. [2024-11-13 13:12:43,559 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1642 transitions. Word has length 55 [2024-11-13 13:12:43,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:43,559 INFO L471 AbstractCegarLoop]: Abstraction has 1190 states and 1642 transitions. [2024-11-13 13:12:43,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:43,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1642 transitions. [2024-11-13 13:12:43,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-13 13:12:43,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:43,562 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:43,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:12:43,562 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 13:12:43,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:43,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1723817895, now seen corresponding path program 1 times [2024-11-13 13:12:43,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:43,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744156484] [2024-11-13 13:12:43,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:43,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:43,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:12:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:43,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:12:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:43,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:12:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:43,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:12:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:43,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:12:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:43,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:43,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:43,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744156484] [2024-11-13 13:12:43,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744156484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:43,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:43,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:12:43,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193547105] [2024-11-13 13:12:43,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:43,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:12:43,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:43,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:12:43,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:12:43,796 INFO L87 Difference]: Start difference. First operand 1190 states and 1642 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:44,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:44,419 INFO L93 Difference]: Finished difference Result 2522 states and 3527 transitions. [2024-11-13 13:12:44,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:12:44,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2024-11-13 13:12:44,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:44,428 INFO L225 Difference]: With dead ends: 2522 [2024-11-13 13:12:44,429 INFO L226 Difference]: Without dead ends: 1342 [2024-11-13 13:12:44,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:12:44,433 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 109 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:44,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 488 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:12:44,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2024-11-13 13:12:44,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1205. [2024-11-13 13:12:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 973 states have (on average 1.3720452209660843) internal successors, (1335), 994 states have internal predecessors, (1335), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2024-11-13 13:12:44,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1648 transitions. [2024-11-13 13:12:44,557 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1648 transitions. Word has length 56 [2024-11-13 13:12:44,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:44,557 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1648 transitions. [2024-11-13 13:12:44,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:44,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1648 transitions. [2024-11-13 13:12:44,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-13 13:12:44,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:44,559 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:44,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 13:12:44,559 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 13:12:44,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:44,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1651431337, now seen corresponding path program 1 times [2024-11-13 13:12:44,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:44,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833979305] [2024-11-13 13:12:44,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:44,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:44,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:12:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:44,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:12:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:44,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:12:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:44,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:12:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:44,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:12:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:44,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:44,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833979305] [2024-11-13 13:12:44,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833979305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:44,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:44,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:12:44,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725405602] [2024-11-13 13:12:44,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:44,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:12:44,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:44,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:12:44,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:12:44,690 INFO L87 Difference]: Start difference. First operand 1205 states and 1648 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:45,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:45,302 INFO L93 Difference]: Finished difference Result 2594 states and 3595 transitions. [2024-11-13 13:12:45,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 13:12:45,302 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2024-11-13 13:12:45,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:45,313 INFO L225 Difference]: With dead ends: 2594 [2024-11-13 13:12:45,313 INFO L226 Difference]: Without dead ends: 1399 [2024-11-13 13:12:45,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-13 13:12:45,318 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 114 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:45,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 483 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:12:45,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2024-11-13 13:12:45,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1247. [2024-11-13 13:12:45,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 1015 states have (on average 1.3566502463054186) internal successors, (1377), 1036 states have internal predecessors, (1377), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2024-11-13 13:12:45,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1690 transitions. [2024-11-13 13:12:45,440 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1690 transitions. Word has length 56 [2024-11-13 13:12:45,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:45,441 INFO L471 AbstractCegarLoop]: Abstraction has 1247 states and 1690 transitions. [2024-11-13 13:12:45,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1690 transitions. [2024-11-13 13:12:45,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-13 13:12:45,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:45,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:45,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 13:12:45,443 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 13:12:45,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:45,444 INFO L85 PathProgramCache]: Analyzing trace with hash -720307925, now seen corresponding path program 1 times [2024-11-13 13:12:45,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:45,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26590790] [2024-11-13 13:12:45,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:45,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:45,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:12:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:45,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:12:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:45,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:12:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:45,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:12:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:45,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:12:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:45,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:45,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26590790] [2024-11-13 13:12:45,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26590790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:45,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:45,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:12:45,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296680532] [2024-11-13 13:12:45,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:45,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:12:45,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:45,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:12:45,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:12:45,653 INFO L87 Difference]: Start difference. First operand 1247 states and 1690 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:46,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:46,508 INFO L93 Difference]: Finished difference Result 1803 states and 2446 transitions. [2024-11-13 13:12:46,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 13:12:46,509 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2024-11-13 13:12:46,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:46,516 INFO L225 Difference]: With dead ends: 1803 [2024-11-13 13:12:46,517 INFO L226 Difference]: Without dead ends: 1068 [2024-11-13 13:12:46,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-13 13:12:46,519 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 365 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:46,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 525 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:12:46,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2024-11-13 13:12:46,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 898. [2024-11-13 13:12:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 729 states have (on average 1.3443072702331962) internal successors, (980), 743 states have internal predecessors, (980), 100 states have call successors, (100), 59 states have call predecessors, (100), 65 states have return successors, (115), 99 states have call predecessors, (115), 100 states have call successors, (115) [2024-11-13 13:12:46,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1195 transitions. [2024-11-13 13:12:46,598 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1195 transitions. Word has length 56 [2024-11-13 13:12:46,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:46,598 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1195 transitions. [2024-11-13 13:12:46,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:46,599 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1195 transitions. [2024-11-13 13:12:46,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-13 13:12:46,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:46,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:46,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 13:12:46,601 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 13:12:46,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:46,602 INFO L85 PathProgramCache]: Analyzing trace with hash -501453207, now seen corresponding path program 1 times [2024-11-13 13:12:46,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:46,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668715616] [2024-11-13 13:12:46,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:46,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:46,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:12:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:46,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:12:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:46,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:12:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:46,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:12:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:46,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:12:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:46,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:46,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:46,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668715616] [2024-11-13 13:12:46,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668715616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:46,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:46,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:12:46,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935742204] [2024-11-13 13:12:46,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:46,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:12:46,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:46,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:12:46,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:12:46,784 INFO L87 Difference]: Start difference. First operand 898 states and 1195 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:47,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:47,671 INFO L93 Difference]: Finished difference Result 1744 states and 2330 transitions. [2024-11-13 13:12:47,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 13:12:47,672 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2024-11-13 13:12:47,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:47,699 INFO L225 Difference]: With dead ends: 1744 [2024-11-13 13:12:47,700 INFO L226 Difference]: Without dead ends: 1096 [2024-11-13 13:12:47,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:12:47,705 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 362 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:47,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 520 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:12:47,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2024-11-13 13:12:47,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 892. [2024-11-13 13:12:47,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 725 states have (on average 1.3393103448275863) internal successors, (971), 737 states have internal predecessors, (971), 100 states have call successors, (100), 59 states have call predecessors, (100), 63 states have return successors, (107), 97 states have call predecessors, (107), 100 states have call successors, (107) [2024-11-13 13:12:47,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1178 transitions. [2024-11-13 13:12:47,778 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1178 transitions. Word has length 56 [2024-11-13 13:12:47,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:47,779 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1178 transitions. [2024-11-13 13:12:47,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:47,779 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1178 transitions. [2024-11-13 13:12:47,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-13 13:12:47,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:47,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:47,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 13:12:47,783 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 13:12:47,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:47,783 INFO L85 PathProgramCache]: Analyzing trace with hash -78751381, now seen corresponding path program 1 times [2024-11-13 13:12:47,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:47,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103728259] [2024-11-13 13:12:47,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:47,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:47,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:12:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:47,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:12:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:47,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:12:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:47,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:12:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:47,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:12:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:47,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:47,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:47,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103728259] [2024-11-13 13:12:47,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103728259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:47,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:47,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:12:47,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100296421] [2024-11-13 13:12:47,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:47,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:12:47,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:47,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:12:47,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:12:47,976 INFO L87 Difference]: Start difference. First operand 892 states and 1178 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:48,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:48,831 INFO L93 Difference]: Finished difference Result 1681 states and 2217 transitions. [2024-11-13 13:12:48,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 13:12:48,832 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2024-11-13 13:12:48,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:48,840 INFO L225 Difference]: With dead ends: 1681 [2024-11-13 13:12:48,840 INFO L226 Difference]: Without dead ends: 948 [2024-11-13 13:12:48,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-13 13:12:48,843 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 411 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:48,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 492 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:12:48,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2024-11-13 13:12:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 776. [2024-11-13 13:12:48,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 634 states have (on average 1.334384858044164) internal successors, (846), 644 states have internal predecessors, (846), 85 states have call successors, (85), 51 states have call predecessors, (85), 53 states have return successors, (87), 81 states have call predecessors, (87), 85 states have call successors, (87) [2024-11-13 13:12:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1018 transitions. [2024-11-13 13:12:48,915 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1018 transitions. Word has length 56 [2024-11-13 13:12:48,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:48,916 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1018 transitions. [2024-11-13 13:12:48,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:48,916 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1018 transitions. [2024-11-13 13:12:48,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-13 13:12:48,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:48,917 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:48,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 13:12:48,917 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 13:12:48,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:48,918 INFO L85 PathProgramCache]: Analyzing trace with hash -896399831, now seen corresponding path program 1 times [2024-11-13 13:12:48,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:48,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715695318] [2024-11-13 13:12:48,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:48,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:48,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:12:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:48,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:12:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:48,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:12:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:49,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:12:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:49,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:12:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:49,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:49,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715695318] [2024-11-13 13:12:49,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715695318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:49,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:49,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:12:49,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546168598] [2024-11-13 13:12:49,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:49,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:12:49,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:49,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:12:49,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:12:49,032 INFO L87 Difference]: Start difference. First operand 776 states and 1018 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:49,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:49,681 INFO L93 Difference]: Finished difference Result 2414 states and 3226 transitions. [2024-11-13 13:12:49,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:12:49,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2024-11-13 13:12:49,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:49,694 INFO L225 Difference]: With dead ends: 2414 [2024-11-13 13:12:49,694 INFO L226 Difference]: Without dead ends: 1649 [2024-11-13 13:12:49,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-13 13:12:49,699 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 333 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:49,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 418 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:12:49,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2024-11-13 13:12:49,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1475. [2024-11-13 13:12:49,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1205 states have (on average 1.3195020746887967) internal successors, (1590), 1222 states have internal predecessors, (1590), 158 states have call successors, (158), 97 states have call predecessors, (158), 108 states have return successors, (201), 157 states have call predecessors, (201), 158 states have call successors, (201) [2024-11-13 13:12:49,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1949 transitions. [2024-11-13 13:12:49,835 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1949 transitions. Word has length 56 [2024-11-13 13:12:49,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:49,835 INFO L471 AbstractCegarLoop]: Abstraction has 1475 states and 1949 transitions. [2024-11-13 13:12:49,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:49,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1949 transitions. [2024-11-13 13:12:49,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 13:12:49,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:49,839 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:49,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 13:12:49,839 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 13:12:49,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:49,840 INFO L85 PathProgramCache]: Analyzing trace with hash 626565710, now seen corresponding path program 1 times [2024-11-13 13:12:49,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:49,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019368008] [2024-11-13 13:12:49,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:49,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:49,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:12:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:49,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:12:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:49,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:12:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:49,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:12:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:49,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:12:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:49,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:49,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019368008] [2024-11-13 13:12:49,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019368008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:49,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:49,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:12:49,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024352939] [2024-11-13 13:12:49,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:49,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:12:49,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:49,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:12:49,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:12:49,898 INFO L87 Difference]: Start difference. First operand 1475 states and 1949 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:50,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:50,296 INFO L93 Difference]: Finished difference Result 2839 states and 3733 transitions. [2024-11-13 13:12:50,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:12:50,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-13 13:12:50,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:50,304 INFO L225 Difference]: With dead ends: 2839 [2024-11-13 13:12:50,304 INFO L226 Difference]: Without dead ends: 1375 [2024-11-13 13:12:50,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:12:50,308 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 268 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:50,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 220 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:12:50,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2024-11-13 13:12:50,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1198. [2024-11-13 13:12:50,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 984 states have (on average 1.309959349593496) internal successors, (1289), 999 states have internal predecessors, (1289), 122 states have call successors, (122), 78 states have call predecessors, (122), 88 states have return successors, (152), 121 states have call predecessors, (152), 122 states have call successors, (152) [2024-11-13 13:12:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1563 transitions. [2024-11-13 13:12:50,419 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1563 transitions. Word has length 57 [2024-11-13 13:12:50,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:50,419 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1563 transitions. [2024-11-13 13:12:50,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 13:12:50,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1563 transitions. [2024-11-13 13:12:50,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-13 13:12:50,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:50,421 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:50,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 13:12:50,421 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 13:12:50,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:50,422 INFO L85 PathProgramCache]: Analyzing trace with hash 898161852, now seen corresponding path program 1 times [2024-11-13 13:12:50,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:50,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787683177] [2024-11-13 13:12:50,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:50,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:50,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:12:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:50,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:12:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:50,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:12:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:50,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:12:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:50,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:12:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:50,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:50,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:50,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787683177] [2024-11-13 13:12:50,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787683177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:50,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:50,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:12:50,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625591548] [2024-11-13 13:12:50,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:50,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:12:50,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:50,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:12:50,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:12:50,499 INFO L87 Difference]: Start difference. First operand 1198 states and 1563 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-13 13:12:51,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:51,190 INFO L93 Difference]: Finished difference Result 3437 states and 4509 transitions. [2024-11-13 13:12:51,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:12:51,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2024-11-13 13:12:51,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:51,203 INFO L225 Difference]: With dead ends: 3437 [2024-11-13 13:12:51,203 INFO L226 Difference]: Without dead ends: 2249 [2024-11-13 13:12:51,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:12:51,208 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 320 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:51,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 358 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:12:51,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2024-11-13 13:12:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 1957. [2024-11-13 13:12:51,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1957 states, 1605 states have (on average 1.291588785046729) internal successors, (2073), 1629 states have internal predecessors, (2073), 200 states have call successors, (200), 132 states have call predecessors, (200), 148 states have return successors, (249), 196 states have call predecessors, (249), 200 states have call successors, (249) [2024-11-13 13:12:51,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 2522 transitions. [2024-11-13 13:12:51,409 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 2522 transitions. Word has length 58 [2024-11-13 13:12:51,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:51,410 INFO L471 AbstractCegarLoop]: Abstraction has 1957 states and 2522 transitions. [2024-11-13 13:12:51,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-13 13:12:51,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 2522 transitions. [2024-11-13 13:12:51,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 13:12:51,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:51,412 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:51,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 13:12:51,413 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 13:12:51,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:51,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1994135923, now seen corresponding path program 1 times [2024-11-13 13:12:51,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:51,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708577925] [2024-11-13 13:12:51,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:51,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:51,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:12:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:51,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:12:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:51,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:12:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:51,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:12:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:51,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:12:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:51,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 13:12:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 13:12:51,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:51,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708577925] [2024-11-13 13:12:51,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708577925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:51,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:51,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:12:51,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628419017] [2024-11-13 13:12:51,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:51,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:12:51,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:51,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:12:51,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:12:51,519 INFO L87 Difference]: Start difference. First operand 1957 states and 2522 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-13 13:12:52,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:52,730 INFO L93 Difference]: Finished difference Result 6219 states and 8078 transitions. [2024-11-13 13:12:52,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 13:12:52,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 77 [2024-11-13 13:12:52,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:52,753 INFO L225 Difference]: With dead ends: 6219 [2024-11-13 13:12:52,753 INFO L226 Difference]: Without dead ends: 4273 [2024-11-13 13:12:52,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-13 13:12:52,759 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 664 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:52,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 501 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 13:12:52,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4273 states. [2024-11-13 13:12:53,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4273 to 3838. [2024-11-13 13:12:53,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3838 states, 3136 states have (on average 1.2729591836734695) internal successors, (3992), 3197 states have internal predecessors, (3992), 384 states have call successors, (384), 258 states have call predecessors, (384), 314 states have return successors, (586), 384 states have call predecessors, (586), 384 states have call successors, (586) [2024-11-13 13:12:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3838 states to 3838 states and 4962 transitions. [2024-11-13 13:12:53,216 INFO L78 Accepts]: Start accepts. Automaton has 3838 states and 4962 transitions. Word has length 77 [2024-11-13 13:12:53,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:53,217 INFO L471 AbstractCegarLoop]: Abstraction has 3838 states and 4962 transitions. [2024-11-13 13:12:53,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-13 13:12:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3838 states and 4962 transitions. [2024-11-13 13:12:53,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 13:12:53,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:53,218 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:53,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 13:12:53,222 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 13:12:53,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:53,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1260924178, now seen corresponding path program 1 times [2024-11-13 13:12:53,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:53,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098375642] [2024-11-13 13:12:53,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:53,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:53,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:12:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:53,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:12:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:53,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:12:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:53,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:12:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:53,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:12:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:53,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 13:12:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:53,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 13:12:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:53,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 13:12:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 13:12:53,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:53,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098375642] [2024-11-13 13:12:53,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098375642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:53,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:53,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:12:53,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094559909] [2024-11-13 13:12:53,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:53,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:12:53,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:53,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:12:53,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:12:53,535 INFO L87 Difference]: Start difference. First operand 3838 states and 4962 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-13 13:12:54,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:54,447 INFO L93 Difference]: Finished difference Result 7403 states and 9536 transitions. [2024-11-13 13:12:54,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:12:54,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2024-11-13 13:12:54,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:54,471 INFO L225 Difference]: With dead ends: 7403 [2024-11-13 13:12:54,472 INFO L226 Difference]: Without dead ends: 4339 [2024-11-13 13:12:54,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:12:54,480 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 443 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:54,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 368 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:12:54,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4339 states. [2024-11-13 13:12:54,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4339 to 3806. [2024-11-13 13:12:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3806 states, 3100 states have (on average 1.2632258064516129) internal successors, (3916), 3165 states have internal predecessors, (3916), 384 states have call successors, (384), 258 states have call predecessors, (384), 318 states have return successors, (531), 384 states have call predecessors, (531), 384 states have call successors, (531) [2024-11-13 13:12:54,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 4831 transitions. [2024-11-13 13:12:54,884 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 4831 transitions. Word has length 91 [2024-11-13 13:12:54,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:54,884 INFO L471 AbstractCegarLoop]: Abstraction has 3806 states and 4831 transitions. [2024-11-13 13:12:54,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-13 13:12:54,884 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 4831 transitions. [2024-11-13 13:12:54,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 13:12:54,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:54,886 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:54,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 13:12:54,887 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 13:12:54,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:54,887 INFO L85 PathProgramCache]: Analyzing trace with hash 63932016, now seen corresponding path program 1 times [2024-11-13 13:12:54,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:54,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135033409] [2024-11-13 13:12:54,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:54,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:54,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:12:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:54,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:12:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:54,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:12:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:54,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:12:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:54,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:12:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:54,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 13:12:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:54,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 13:12:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:54,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 13:12:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 13:12:54,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:54,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135033409] [2024-11-13 13:12:54,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135033409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:54,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:54,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:12:54,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345620093] [2024-11-13 13:12:54,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:54,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:12:54,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:54,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:12:54,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:12:54,978 INFO L87 Difference]: Start difference. First operand 3806 states and 4831 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-13 13:12:55,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:55,748 INFO L93 Difference]: Finished difference Result 4201 states and 5349 transitions. [2024-11-13 13:12:55,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:12:55,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2024-11-13 13:12:55,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:55,771 INFO L225 Difference]: With dead ends: 4201 [2024-11-13 13:12:55,771 INFO L226 Difference]: Without dead ends: 3463 [2024-11-13 13:12:55,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:12:55,778 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 266 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:55,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 215 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:12:55,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3463 states. [2024-11-13 13:12:56,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3463 to 3070. [2024-11-13 13:12:56,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3070 states, 2505 states have (on average 1.2686626746506986) internal successors, (3178), 2560 states have internal predecessors, (3178), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (431), 306 states have call predecessors, (431), 303 states have call successors, (431) [2024-11-13 13:12:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 3912 transitions. [2024-11-13 13:12:56,117 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 3912 transitions. Word has length 91 [2024-11-13 13:12:56,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:56,117 INFO L471 AbstractCegarLoop]: Abstraction has 3070 states and 3912 transitions. [2024-11-13 13:12:56,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-13 13:12:56,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 3912 transitions. [2024-11-13 13:12:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 13:12:56,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:56,121 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:56,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 13:12:56,122 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 13:12:56,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:56,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1522361689, now seen corresponding path program 1 times [2024-11-13 13:12:56,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:56,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55502909] [2024-11-13 13:12:56,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:56,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:56,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:12:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:56,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:12:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:56,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:12:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:56,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:12:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:56,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:12:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:56,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 13:12:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:56,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 13:12:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:56,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:12:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 13:12:56,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:56,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55502909] [2024-11-13 13:12:56,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55502909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:56,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:56,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:12:56,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652263300] [2024-11-13 13:12:56,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:56,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:12:56,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:56,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:12:56,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:12:56,252 INFO L87 Difference]: Start difference. First operand 3070 states and 3912 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-13 13:12:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:57,639 INFO L93 Difference]: Finished difference Result 5358 states and 6905 transitions. [2024-11-13 13:12:57,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 13:12:57,640 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 93 [2024-11-13 13:12:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:57,655 INFO L225 Difference]: With dead ends: 5358 [2024-11-13 13:12:57,655 INFO L226 Difference]: Without dead ends: 3380 [2024-11-13 13:12:57,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2024-11-13 13:12:57,660 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1024 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:57,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 570 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 13:12:57,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3380 states. [2024-11-13 13:12:57,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3380 to 3070. [2024-11-13 13:12:57,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3070 states, 2505 states have (on average 1.259880239520958) internal successors, (3156), 2560 states have internal predecessors, (3156), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (398), 306 states have call predecessors, (398), 303 states have call successors, (398) [2024-11-13 13:12:57,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 3857 transitions. [2024-11-13 13:12:57,961 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 3857 transitions. Word has length 93 [2024-11-13 13:12:57,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:57,961 INFO L471 AbstractCegarLoop]: Abstraction has 3070 states and 3857 transitions. [2024-11-13 13:12:57,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-13 13:12:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 3857 transitions. [2024-11-13 13:12:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 13:12:57,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:57,964 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:57,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 13:12:57,964 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 13:12:57,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:57,964 INFO L85 PathProgramCache]: Analyzing trace with hash 580439869, now seen corresponding path program 1 times [2024-11-13 13:12:57,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:57,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297650451] [2024-11-13 13:12:57,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:57,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:58,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:12:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:58,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:12:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:58,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:12:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:58,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:12:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:58,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:12:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:58,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 13:12:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:58,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:12:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:58,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 13:12:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:58,098 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 13:12:58,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:58,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297650451] [2024-11-13 13:12:58,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297650451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:58,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:58,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:12:58,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159235596] [2024-11-13 13:12:58,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:58,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:12:58,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:58,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:12:58,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:12:58,100 INFO L87 Difference]: Start difference. First operand 3070 states and 3857 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-13 13:12:58,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:58,738 INFO L93 Difference]: Finished difference Result 3463 states and 4375 transitions. [2024-11-13 13:12:58,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:12:58,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 100 [2024-11-13 13:12:58,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:58,758 INFO L225 Difference]: With dead ends: 3463 [2024-11-13 13:12:58,759 INFO L226 Difference]: Without dead ends: 3462 [2024-11-13 13:12:58,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:12:58,761 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 260 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:58,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 203 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:12:58,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2024-11-13 13:12:59,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3069. [2024-11-13 13:12:59,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3069 states, 2505 states have (on average 1.2562874251497007) internal successors, (3147), 2559 states have internal predecessors, (3147), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (398), 306 states have call predecessors, (398), 303 states have call successors, (398) [2024-11-13 13:12:59,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 3069 states and 3848 transitions. [2024-11-13 13:12:59,239 INFO L78 Accepts]: Start accepts. Automaton has 3069 states and 3848 transitions. Word has length 100 [2024-11-13 13:12:59,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:59,240 INFO L471 AbstractCegarLoop]: Abstraction has 3069 states and 3848 transitions. [2024-11-13 13:12:59,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-13 13:12:59,240 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 3848 transitions. [2024-11-13 13:12:59,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 13:12:59,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:59,243 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-11-13 13:12:59,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 13:12:59,244 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 13:12:59,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:59,244 INFO L85 PathProgramCache]: Analyzing trace with hash 813767037, now seen corresponding path program 1 times [2024-11-13 13:12:59,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:59,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53912036] [2024-11-13 13:12:59,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:59,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:12:59,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:12:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:12:59,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:12:59,321 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:12:59,323 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-13 13:12:59,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-13 13:12:59,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-13 13:12:59,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-13 13:12:59,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 13:12:59,329 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:59,454 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:12:59,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:12:59 BoogieIcfgContainer [2024-11-13 13:12:59,465 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:12:59,466 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:12:59,466 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:12:59,466 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:12:59,467 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:12:36" (3/4) ... [2024-11-13 13:12:59,468 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 13:12:59,618 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_262cfdef-b130-40d4-b837-bdd2f2b5c544/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 13:12:59,626 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:12:59,627 INFO L158 Benchmark]: Toolchain (without parser) took 24462.73ms. Allocated memory was 117.4MB in the beginning and 662.7MB in the end (delta: 545.3MB). Free memory was 92.3MB in the beginning and 443.1MB in the end (delta: -350.8MB). Peak memory consumption was 197.8MB. Max. memory is 16.1GB. [2024-11-13 13:12:59,627 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 117.4MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:12:59,627 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.43ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 79.3MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 13:12:59,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.58ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 77.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:12:59,628 INFO L158 Benchmark]: Boogie Preprocessor took 73.03ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 75.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:12:59,628 INFO L158 Benchmark]: RCFGBuilder took 688.33ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 57.7MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 13:12:59,628 INFO L158 Benchmark]: TraceAbstraction took 23095.66ms. Allocated memory was 117.4MB in the beginning and 662.7MB in the end (delta: 545.3MB). Free memory was 57.2MB in the beginning and 452.6MB in the end (delta: -395.4MB). Peak memory consumption was 147.5MB. Max. memory is 16.1GB. [2024-11-13 13:12:59,628 INFO L158 Benchmark]: Witness Printer took 159.97ms. Allocated memory is still 662.7MB. Free memory was 452.6MB in the beginning and 443.1MB in the end (delta: 9.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 13:12:59,637 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.40ms. Allocated memory is still 117.4MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.43ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 79.3MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.58ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 77.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 73.03ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 75.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 688.33ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 57.7MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23095.66ms. Allocated memory was 117.4MB in the beginning and 662.7MB in the end (delta: 545.3MB). Free memory was 57.2MB in the beginning and 452.6MB in the end (delta: -395.4MB). Peak memory consumption was 147.5MB. Max. memory is 16.1GB. * Witness Printer took 159.97ms. Allocated memory is still 662.7MB. Free memory was 452.6MB in the beginning and 443.1MB in the end (delta: 9.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 107]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, token=0] [L473] int __retres1 ; [L477] CALL init_model() [L388] m_i = 1 [L389] t1_i = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L477] RET init_model() [L478] CALL start_simulation() [L414] int kernel_st ; [L415] int tmp ; [L416] int tmp___0 ; [L420] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L421] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L422] CALL init_threads() [L170] COND TRUE m_i == 1 [L171] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L175] COND TRUE t1_i == 1 [L176] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L422] RET init_threads() [L423] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L259] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L264] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L269] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L274] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L423] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L124] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L134] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L325] CALL, EXPR is_transmit1_triggered() [L140] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L143] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L153] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L287] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L292] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L297] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L302] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L428] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L431] kernel_st = 1 [L432] CALL eval() [L206] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L210] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L185] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L188] COND TRUE m_st == 0 [L189] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L201] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] tmp = exists_runnable_thread() [L215] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE \read(tmp_ndt_2) [L239] t1_st = 1 [L240] CALL transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L99] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L240] RET transmit1() [L210] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L185] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L188] COND TRUE m_st == 0 [L189] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L201] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] tmp = exists_runnable_thread() [L215] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND TRUE \read(tmp_ndt_1) [L225] m_st = 1 [L226] CALL master() [L44] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L55] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L61] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L341] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L124] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L134] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L136] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L325] CALL, EXPR is_transmit1_triggered() [L140] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L143] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L144] COND TRUE E_1 == 1 [L145] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L155] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND TRUE \read(tmp___0) [L328] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L341] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L61] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L226] RET master() [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE \read(tmp_ndt_2) [L239] t1_st = 1 [L240] CALL transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L91] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L107] token += 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 116 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 22.9s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6771 SdHoareTripleChecker+Valid, 9.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6588 mSDsluCounter, 8332 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6095 mSDsCounter, 1227 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7757 IncrementalHoareTripleChecker+Invalid, 8984 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1227 mSolverCounterUnsat, 2237 mSDtfsCounter, 7757 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 493 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3838occurred in iteration=14, InterpolantAutomatonStates: 214, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 4230 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1279 NumberOfCodeBlocks, 1279 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1160 ConstructedInterpolants, 0 QuantifiedInterpolants, 2539 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 121/121 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-13 13:12:59,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_262cfdef-b130-40d4-b837-bdd2f2b5c544/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)