./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f885e0ab-9783-4a4d-b379-34e6ad0a6b0a/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f885e0ab-9783-4a4d-b379-34e6ad0a6b0a/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f885e0ab-9783-4a4d-b379-34e6ad0a6b0a/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f885e0ab-9783-4a4d-b379-34e6ad0a6b0a/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f885e0ab-9783-4a4d-b379-34e6ad0a6b0a/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f885e0ab-9783-4a4d-b379-34e6ad0a6b0a/bin/uautomizer-verify-aQ6SnzHsRB --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 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:13:04,332 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:13:04,403 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f885e0ab-9783-4a4d-b379-34e6ad0a6b0a/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-28 03:13:04,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:13:04,409 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:13:04,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:13:04,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:13:04,434 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:13:04,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:13:04,434 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:13:04,434 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:13:04,434 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:13:04,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:13:04,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:13:04,435 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:13:04,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:13:04,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:13:04,435 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:13:04,435 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:13:04,435 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:13:04,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:13:04,436 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:13:04,436 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:13:04,436 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:13:04,436 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-28 03:13:04,436 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:13:04,436 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:13:04,436 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:13:04,436 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:13:04,437 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:13:04,437 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:13:04,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:13:04,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:13:04,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:13:04,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:13:04,437 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:13:04,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:13:04,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:13:04,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:13:04,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:13:04,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:13:04,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:13:04,438 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:13:04,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:13:04,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:13:04,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:13:04,438 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:13:04,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:13:04,439 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:13:04,439 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:13:04,439 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_f885e0ab-9783-4a4d-b379-34e6ad0a6b0a/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f [2024-11-28 03:13:04,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:13:04,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:13:04,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:13:04,752 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:13:04,752 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:13:04,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f885e0ab-9783-4a4d-b379-34e6ad0a6b0a/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2024-11-28 03:13:07,803 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f885e0ab-9783-4a4d-b379-34e6ad0a6b0a/bin/uautomizer-verify-aQ6SnzHsRB/data/33b90966a/344f9eeec6ae43278a94b4c284c7ee1d/FLAGf27e3fd43 [2024-11-28 03:13:08,138 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:13:08,139 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f885e0ab-9783-4a4d-b379-34e6ad0a6b0a/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2024-11-28 03:13:08,153 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f885e0ab-9783-4a4d-b379-34e6ad0a6b0a/bin/uautomizer-verify-aQ6SnzHsRB/data/33b90966a/344f9eeec6ae43278a94b4c284c7ee1d/FLAGf27e3fd43 [2024-11-28 03:13:08,374 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f885e0ab-9783-4a4d-b379-34e6ad0a6b0a/bin/uautomizer-verify-aQ6SnzHsRB/data/33b90966a/344f9eeec6ae43278a94b4c284c7ee1d [2024-11-28 03:13:08,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:13:08,378 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:13:08,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:13:08,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:13:08,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:13:08,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:13:08" (1/1) ... [2024-11-28 03:13:08,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@653ff401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:08, skipping insertion in model container [2024-11-28 03:13:08,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:13:08" (1/1) ... [2024-11-28 03:13:08,426 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:13:08,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:13:08,714 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:13:08,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:13:08,791 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:13:08,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:08 WrapperNode [2024-11-28 03:13:08,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:13:08,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:13:08,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:13:08,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:13:08,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:08" (1/1) ... [2024-11-28 03:13:08,809 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:08" (1/1) ... [2024-11-28 03:13:08,833 INFO L138 Inliner]: procedures = 30, calls = 36, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 230 [2024-11-28 03:13:08,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:13:08,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:13:08,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:13:08,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:13:08,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:08" (1/1) ... [2024-11-28 03:13:08,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:08" (1/1) ... [2024-11-28 03:13:08,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:08" (1/1) ... [2024-11-28 03:13:08,858 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-28 03:13:08,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:08" (1/1) ... [2024-11-28 03:13:08,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:08" (1/1) ... [2024-11-28 03:13:08,863 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:08" (1/1) ... [2024-11-28 03:13:08,868 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:08" (1/1) ... [2024-11-28 03:13:08,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:08" (1/1) ... [2024-11-28 03:13:08,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:08" (1/1) ... [2024-11-28 03:13:08,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:08" (1/1) ... [2024-11-28 03:13:08,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:13:08,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:13:08,880 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:13:08,880 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:13:08,882 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:08" (1/1) ... [2024-11-28 03:13:08,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:13:08,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f885e0ab-9783-4a4d-b379-34e6ad0a6b0a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:13:08,927 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f885e0ab-9783-4a4d-b379-34e6ad0a6b0a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:13:08,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f885e0ab-9783-4a4d-b379-34e6ad0a6b0a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:13:08,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:13:08,956 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-28 03:13:08,956 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-28 03:13:08,956 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-28 03:13:08,956 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-28 03:13:08,956 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-28 03:13:08,957 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-28 03:13:08,957 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-28 03:13:08,957 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-28 03:13:08,957 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-28 03:13:08,957 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-28 03:13:08,957 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-28 03:13:08,957 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-28 03:13:08,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:13:08,957 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-28 03:13:08,957 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-28 03:13:08,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:13:08,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:13:09,044 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:13:09,046 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:13:09,426 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-28 03:13:09,427 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:13:09,450 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:13:09,452 INFO L312 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-28 03:13:09,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:13:09 BoogieIcfgContainer [2024-11-28 03:13:09,453 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:13:09,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:13:09,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:13:09,463 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:13:09,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:13:08" (1/3) ... [2024-11-28 03:13:09,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ecc3ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:13:09, skipping insertion in model container [2024-11-28 03:13:09,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:08" (2/3) ... [2024-11-28 03:13:09,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ecc3ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:13:09, skipping insertion in model container [2024-11-28 03:13:09,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:13:09" (3/3) ... [2024-11-28 03:13:09,469 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2024-11-28 03:13:09,488 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:13:09,492 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.01.cil-2.c that has 8 procedures, 120 locations, 1 initial locations, 4 loop locations, and 4 error locations. [2024-11-28 03:13:09,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:13:09,602 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;@5654b73b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:13:09,602 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-28 03:13:09,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 92 states have (on average 1.5543478260869565) internal successors, (143), 98 states have internal predecessors, (143), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-28 03:13:09,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-28 03:13:09,618 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:09,619 INFO L218 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] [2024-11-28 03:13:09,620 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-28 03:13:09,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:09,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2135238899, now seen corresponding path program 1 times [2024-11-28 03:13:09,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:09,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838351327] [2024-11-28 03:13:09,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:09,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:10,128 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-28 03:13:10,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:10,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838351327] [2024-11-28 03:13:10,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838351327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:10,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:10,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:13:10,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106642120] [2024-11-28 03:13:10,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:10,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:13:10,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:10,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:13:10,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:13:10,167 INFO L87 Difference]: Start difference. First operand has 120 states, 92 states have (on average 1.5543478260869565) internal successors, (143), 98 states have internal predecessors, (143), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 2 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-28 03:13:10,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:13:10,657 INFO L93 Difference]: Finished difference Result 340 states and 511 transitions. [2024-11-28 03:13:10,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:13:10,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 2 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 53 [2024-11-28 03:13:10,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:13:10,674 INFO L225 Difference]: With dead ends: 340 [2024-11-28 03:13:10,675 INFO L226 Difference]: Without dead ends: 215 [2024-11-28 03:13:10,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:13:10,687 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 237 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:13:10,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 454 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:13:10,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-28 03:13:10,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 206. [2024-11-28 03:13:10,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 164 states have (on average 1.4878048780487805) internal successors, (244), 169 states have internal predecessors, (244), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2024-11-28 03:13:10,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 295 transitions. [2024-11-28 03:13:10,785 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 295 transitions. Word has length 53 [2024-11-28 03:13:10,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:13:10,786 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 295 transitions. [2024-11-28 03:13:10,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 2 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-28 03:13:10,786 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 295 transitions. [2024-11-28 03:13:10,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-28 03:13:10,788 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:10,789 INFO L218 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] [2024-11-28 03:13:10,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:13:10,789 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-28 03:13:10,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:10,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1565736943, now seen corresponding path program 1 times [2024-11-28 03:13:10,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:10,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039613746] [2024-11-28 03:13:10,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:10,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:11,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:13:11,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:11,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039613746] [2024-11-28 03:13:11,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039613746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:11,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:11,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:13:11,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742812702] [2024-11-28 03:13:11,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:11,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:13:11,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:11,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:13:11,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:13:11,018 INFO L87 Difference]: Start difference. First operand 206 states and 295 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 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-28 03:13:11,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:13:11,584 INFO L93 Difference]: Finished difference Result 519 states and 743 transitions. [2024-11-28 03:13:11,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:13:11,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 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 53 [2024-11-28 03:13:11,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:13:11,590 INFO L225 Difference]: With dead ends: 519 [2024-11-28 03:13:11,590 INFO L226 Difference]: Without dead ends: 322 [2024-11-28 03:13:11,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:13:11,598 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 217 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:13:11,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 761 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:13:11,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-28 03:13:11,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 297. [2024-11-28 03:13:11,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 238 states have (on average 1.4789915966386555) internal successors, (352), 244 states have internal predecessors, (352), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (39), 36 states have call predecessors, (39), 35 states have call successors, (39) [2024-11-28 03:13:11,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 426 transitions. [2024-11-28 03:13:11,653 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 426 transitions. Word has length 53 [2024-11-28 03:13:11,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:13:11,653 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 426 transitions. [2024-11-28 03:13:11,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 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-28 03:13:11,654 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 426 transitions. [2024-11-28 03:13:11,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-28 03:13:11,655 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:11,655 INFO L218 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] [2024-11-28 03:13:11,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:13:11,657 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-28 03:13:11,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:11,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1989383665, now seen corresponding path program 1 times [2024-11-28 03:13:11,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:11,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254339519] [2024-11-28 03:13:11,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:11,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:11,873 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-28 03:13:11,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:11,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254339519] [2024-11-28 03:13:11,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254339519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:11,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:11,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:13:11,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670379220] [2024-11-28 03:13:11,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:11,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:13:11,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:11,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:13:11,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:13:11,876 INFO L87 Difference]: Start difference. First operand 297 states and 426 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 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-28 03:13:12,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:13:12,370 INFO L93 Difference]: Finished difference Result 820 states and 1176 transitions. [2024-11-28 03:13:12,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:13:12,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 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 53 [2024-11-28 03:13:12,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:13:12,377 INFO L225 Difference]: With dead ends: 820 [2024-11-28 03:13:12,377 INFO L226 Difference]: Without dead ends: 532 [2024-11-28 03:13:12,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:13:12,380 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 256 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:13:12,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 732 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:13:12,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-28 03:13:12,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 476. [2024-11-28 03:13:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 383 states have (on average 1.4647519582245432) internal successors, (561), 393 states have internal predecessors, (561), 53 states have call successors, (53), 30 states have call predecessors, (53), 36 states have return successors, (69), 56 states have call predecessors, (69), 53 states have call successors, (69) [2024-11-28 03:13:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 683 transitions. [2024-11-28 03:13:12,443 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 683 transitions. Word has length 53 [2024-11-28 03:13:12,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:13:12,443 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 683 transitions. [2024-11-28 03:13:12,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 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-28 03:13:12,443 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 683 transitions. [2024-11-28 03:13:12,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-28 03:13:12,446 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:12,447 INFO L218 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] [2024-11-28 03:13:12,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:13:12,447 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-28 03:13:12,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:12,451 INFO L85 PathProgramCache]: Analyzing trace with hash 617576367, now seen corresponding path program 1 times [2024-11-28 03:13:12,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:12,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254599342] [2024-11-28 03:13:12,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:12,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:12,563 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-28 03:13:12,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:12,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254599342] [2024-11-28 03:13:12,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254599342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:12,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:12,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:13:12,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381190330] [2024-11-28 03:13:12,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:12,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:13:12,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:12,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:13:12,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:13:12,566 INFO L87 Difference]: Start difference. First operand 476 states and 683 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 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-28 03:13:13,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:13:13,109 INFO L93 Difference]: Finished difference Result 1347 states and 1943 transitions. [2024-11-28 03:13:13,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:13:13,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 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 53 [2024-11-28 03:13:13,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:13:13,120 INFO L225 Difference]: With dead ends: 1347 [2024-11-28 03:13:13,121 INFO L226 Difference]: Without dead ends: 880 [2024-11-28 03:13:13,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:13:13,124 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 209 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:13:13,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 716 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:13:13,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-11-28 03:13:13,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 789. [2024-11-28 03:13:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 628 states have (on average 1.4347133757961783) internal successors, (901), 652 states have internal predecessors, (901), 85 states have call successors, (85), 52 states have call predecessors, (85), 72 states have return successors, (149), 92 states have call predecessors, (149), 85 states have call successors, (149) [2024-11-28 03:13:13,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1135 transitions. [2024-11-28 03:13:13,245 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1135 transitions. Word has length 53 [2024-11-28 03:13:13,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:13:13,247 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1135 transitions. [2024-11-28 03:13:13,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 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-28 03:13:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1135 transitions. [2024-11-28 03:13:13,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-28 03:13:13,254 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:13,254 INFO L218 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] [2024-11-28 03:13:13,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:13:13,255 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-28 03:13:13,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:13,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1227790799, now seen corresponding path program 1 times [2024-11-28 03:13:13,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:13,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330455223] [2024-11-28 03:13:13,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:13,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:13,323 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-28 03:13:13,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:13,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330455223] [2024-11-28 03:13:13,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330455223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:13,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:13,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:13:13,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344320992] [2024-11-28 03:13:13,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:13,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:13:13,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:13,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:13:13,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:13:13,326 INFO L87 Difference]: Start difference. First operand 789 states and 1135 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 1 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-28 03:13:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:13:13,557 INFO L93 Difference]: Finished difference Result 1990 states and 2887 transitions. [2024-11-28 03:13:13,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:13:13,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 1 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 53 [2024-11-28 03:13:13,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:13:13,565 INFO L225 Difference]: With dead ends: 1990 [2024-11-28 03:13:13,565 INFO L226 Difference]: Without dead ends: 1211 [2024-11-28 03:13:13,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:13:13,569 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 248 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:13:13,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 477 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:13:13,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2024-11-28 03:13:13,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1186. [2024-11-28 03:13:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 940 states have (on average 1.4) internal successors, (1316), 975 states have internal predecessors, (1316), 134 states have call successors, (134), 82 states have call predecessors, (134), 108 states have return successors, (211), 136 states have call predecessors, (211), 134 states have call successors, (211) [2024-11-28 03:13:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1661 transitions. [2024-11-28 03:13:13,715 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1661 transitions. Word has length 53 [2024-11-28 03:13:13,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:13:13,715 INFO L471 AbstractCegarLoop]: Abstraction has 1186 states and 1661 transitions. [2024-11-28 03:13:13,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 1 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-28 03:13:13,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1661 transitions. [2024-11-28 03:13:13,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-28 03:13:13,717 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:13,718 INFO L218 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] [2024-11-28 03:13:13,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:13:13,718 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-28 03:13:13,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:13,719 INFO L85 PathProgramCache]: Analyzing trace with hash -371506657, now seen corresponding path program 1 times [2024-11-28 03:13:13,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:13,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048329340] [2024-11-28 03:13:13,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:13,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:13,783 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-28 03:13:13,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:13,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048329340] [2024-11-28 03:13:13,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048329340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:13,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:13,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:13:13,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585358365] [2024-11-28 03:13:13,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:13,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:13:13,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:13,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:13:13,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:13:13,785 INFO L87 Difference]: Start difference. First operand 1186 states and 1661 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 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-28 03:13:13,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:13:13,930 INFO L93 Difference]: Finished difference Result 2377 states and 3374 transitions. [2024-11-28 03:13:13,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:13:13,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 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 54 [2024-11-28 03:13:13,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:13:13,941 INFO L225 Difference]: With dead ends: 2377 [2024-11-28 03:13:13,942 INFO L226 Difference]: Without dead ends: 1201 [2024-11-28 03:13:13,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:13:13,947 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:13:13,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 602 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:13:13,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2024-11-28 03:13:14,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1201. [2024-11-28 03:13:14,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 955 states have (on average 1.3842931937172775) internal successors, (1322), 990 states have internal predecessors, (1322), 134 states have call successors, (134), 82 states have call predecessors, (134), 108 states have return successors, (211), 136 states have call predecessors, (211), 134 states have call successors, (211) [2024-11-28 03:13:14,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1667 transitions. [2024-11-28 03:13:14,083 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1667 transitions. Word has length 54 [2024-11-28 03:13:14,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:13:14,084 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 1667 transitions. [2024-11-28 03:13:14,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 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-28 03:13:14,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1667 transitions. [2024-11-28 03:13:14,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-28 03:13:14,086 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:14,086 INFO L218 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] [2024-11-28 03:13:14,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:13:14,086 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-28 03:13:14,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:14,088 INFO L85 PathProgramCache]: Analyzing trace with hash 330093217, now seen corresponding path program 1 times [2024-11-28 03:13:14,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:14,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032068966] [2024-11-28 03:13:14,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:14,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:14,192 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-28 03:13:14,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:14,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032068966] [2024-11-28 03:13:14,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032068966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:14,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:14,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:13:14,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106890380] [2024-11-28 03:13:14,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:14,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:13:14,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:14,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:13:14,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:13:14,195 INFO L87 Difference]: Start difference. First operand 1201 states and 1667 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 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-28 03:13:14,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:13:14,303 INFO L93 Difference]: Finished difference Result 2434 states and 3422 transitions. [2024-11-28 03:13:14,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:13:14,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 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 54 [2024-11-28 03:13:14,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:13:14,313 INFO L225 Difference]: With dead ends: 2434 [2024-11-28 03:13:14,313 INFO L226 Difference]: Without dead ends: 1243 [2024-11-28 03:13:14,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:13:14,318 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:13:14,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 602 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:13:14,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2024-11-28 03:13:14,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1243. [2024-11-28 03:13:14,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 997 states have (on average 1.3681043129388164) internal successors, (1364), 1032 states have internal predecessors, (1364), 134 states have call successors, (134), 82 states have call predecessors, (134), 108 states have return successors, (211), 136 states have call predecessors, (211), 134 states have call successors, (211) [2024-11-28 03:13:14,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1709 transitions. [2024-11-28 03:13:14,443 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1709 transitions. Word has length 54 [2024-11-28 03:13:14,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:13:14,443 INFO L471 AbstractCegarLoop]: Abstraction has 1243 states and 1709 transitions. [2024-11-28 03:13:14,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 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-28 03:13:14,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1709 transitions. [2024-11-28 03:13:14,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-28 03:13:14,446 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:14,446 INFO L218 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] [2024-11-28 03:13:14,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:13:14,447 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-28 03:13:14,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:14,448 INFO L85 PathProgramCache]: Analyzing trace with hash 470641827, now seen corresponding path program 1 times [2024-11-28 03:13:14,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:14,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753435434] [2024-11-28 03:13:14,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:14,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:14,618 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-28 03:13:14,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:14,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753435434] [2024-11-28 03:13:14,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753435434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:14,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:14,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:13:14,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315363661] [2024-11-28 03:13:14,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:14,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:13:14,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:14,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:13:14,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:13:14,622 INFO L87 Difference]: Start difference. First operand 1243 states and 1709 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 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-28 03:13:15,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:13:15,058 INFO L93 Difference]: Finished difference Result 1689 states and 2319 transitions. [2024-11-28 03:13:15,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:13:15,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 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 54 [2024-11-28 03:13:15,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:13:15,065 INFO L225 Difference]: With dead ends: 1689 [2024-11-28 03:13:15,065 INFO L226 Difference]: Without dead ends: 949 [2024-11-28 03:13:15,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:13:15,068 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 214 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:13:15,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 506 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:13:15,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2024-11-28 03:13:15,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 883. [2024-11-28 03:13:15,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 712 states have (on average 1.3623595505617978) internal successors, (970), 728 states have internal predecessors, (970), 100 states have call successors, (100), 59 states have call predecessors, (100), 67 states have return successors, (119), 99 states have call predecessors, (119), 100 states have call successors, (119) [2024-11-28 03:13:15,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1189 transitions. [2024-11-28 03:13:15,142 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1189 transitions. Word has length 54 [2024-11-28 03:13:15,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:13:15,142 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1189 transitions. [2024-11-28 03:13:15,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 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-28 03:13:15,143 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1189 transitions. [2024-11-28 03:13:15,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-28 03:13:15,145 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:15,145 INFO L218 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] [2024-11-28 03:13:15,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:13:15,146 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-28 03:13:15,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:15,149 INFO L85 PathProgramCache]: Analyzing trace with hash -347006623, now seen corresponding path program 1 times [2024-11-28 03:13:15,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:15,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364945635] [2024-11-28 03:13:15,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:15,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:15,298 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-28 03:13:15,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:15,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364945635] [2024-11-28 03:13:15,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364945635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:15,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:15,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:13:15,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377398620] [2024-11-28 03:13:15,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:15,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:13:15,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:15,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:13:15,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:13:15,300 INFO L87 Difference]: Start difference. First operand 883 states and 1189 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 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-28 03:13:15,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:13:15,763 INFO L93 Difference]: Finished difference Result 1589 states and 2142 transitions. [2024-11-28 03:13:15,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:13:15,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 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 54 [2024-11-28 03:13:15,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:13:15,770 INFO L225 Difference]: With dead ends: 1589 [2024-11-28 03:13:15,771 INFO L226 Difference]: Without dead ends: 950 [2024-11-28 03:13:15,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:13:15,773 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 215 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:13:15,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 493 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:13:15,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2024-11-28 03:13:15,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 872. [2024-11-28 03:13:15,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 705 states have (on average 1.3574468085106384) internal successors, (957), 717 states have internal predecessors, (957), 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-28 03:13:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1164 transitions. [2024-11-28 03:13:15,865 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1164 transitions. Word has length 54 [2024-11-28 03:13:15,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:13:15,866 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1164 transitions. [2024-11-28 03:13:15,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 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-28 03:13:15,866 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1164 transitions. [2024-11-28 03:13:15,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-28 03:13:15,867 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:15,867 INFO L218 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] [2024-11-28 03:13:15,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:13:15,867 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-28 03:13:15,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:15,868 INFO L85 PathProgramCache]: Analyzing trace with hash -2035950365, now seen corresponding path program 1 times [2024-11-28 03:13:15,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:15,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016007976] [2024-11-28 03:13:15,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:15,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:15,987 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-28 03:13:15,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:15,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016007976] [2024-11-28 03:13:15,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016007976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:15,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:15,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:13:15,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725754965] [2024-11-28 03:13:15,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:15,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:13:15,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:15,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:13:15,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:13:15,990 INFO L87 Difference]: Start difference. First operand 872 states and 1164 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 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-28 03:13:16,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:13:16,431 INFO L93 Difference]: Finished difference Result 1532 states and 2037 transitions. [2024-11-28 03:13:16,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:13:16,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 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 54 [2024-11-28 03:13:16,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:13:16,437 INFO L225 Difference]: With dead ends: 1532 [2024-11-28 03:13:16,438 INFO L226 Difference]: Without dead ends: 814 [2024-11-28 03:13:16,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:13:16,440 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 180 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:13:16,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 520 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:13:16,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2024-11-28 03:13:16,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 764. [2024-11-28 03:13:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 622 states have (on average 1.3536977491961415) internal successors, (842), 632 states have internal predecessors, (842), 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-28 03:13:16,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1014 transitions. [2024-11-28 03:13:16,493 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1014 transitions. Word has length 54 [2024-11-28 03:13:16,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:13:16,494 INFO L471 AbstractCegarLoop]: Abstraction has 764 states and 1014 transitions. [2024-11-28 03:13:16,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 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-28 03:13:16,494 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1014 transitions. [2024-11-28 03:13:16,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-28 03:13:16,495 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:16,495 INFO L218 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] [2024-11-28 03:13:16,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:13:16,495 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-28 03:13:16,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:16,496 INFO L85 PathProgramCache]: Analyzing trace with hash 264872225, now seen corresponding path program 1 times [2024-11-28 03:13:16,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:16,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479677366] [2024-11-28 03:13:16,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:16,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:16,549 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-28 03:13:16,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:16,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479677366] [2024-11-28 03:13:16,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479677366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:16,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:16,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:13:16,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752833839] [2024-11-28 03:13:16,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:16,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:13:16,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:16,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:13:16,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:13:16,552 INFO L87 Difference]: Start difference. First operand 764 states and 1014 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 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-28 03:13:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:13:16,846 INFO L93 Difference]: Finished difference Result 2200 states and 2960 transitions. [2024-11-28 03:13:16,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:13:16,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 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 54 [2024-11-28 03:13:16,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:13:16,855 INFO L225 Difference]: With dead ends: 2200 [2024-11-28 03:13:16,855 INFO L226 Difference]: Without dead ends: 1447 [2024-11-28 03:13:16,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:13:16,858 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 182 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:13:16,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 343 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:13:16,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2024-11-28 03:13:16,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1439. [2024-11-28 03:13:16,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1169 states have (on average 1.3327630453378956) internal successors, (1558), 1186 states have internal predecessors, (1558), 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-28 03:13:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 1917 transitions. [2024-11-28 03:13:16,957 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 1917 transitions. Word has length 54 [2024-11-28 03:13:16,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:13:16,957 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 1917 transitions. [2024-11-28 03:13:16,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 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-28 03:13:16,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1917 transitions. [2024-11-28 03:13:16,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 03:13:16,958 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:16,958 INFO L218 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-28 03:13:16,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:13:16,959 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-28 03:13:16,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:16,959 INFO L85 PathProgramCache]: Analyzing trace with hash -372475642, now seen corresponding path program 1 times [2024-11-28 03:13:16,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:16,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802504372] [2024-11-28 03:13:16,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:16,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:16,983 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-28 03:13:16,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:16,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802504372] [2024-11-28 03:13:16,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802504372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:16,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:16,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:13:16,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498757376] [2024-11-28 03:13:16,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:16,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:13:16,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:16,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:13:16,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:13:16,985 INFO L87 Difference]: Start difference. First operand 1439 states and 1917 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 1 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-28 03:13:17,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:13:17,079 INFO L93 Difference]: Finished difference Result 2602 states and 3444 transitions. [2024-11-28 03:13:17,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:13:17,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 1 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 55 [2024-11-28 03:13:17,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:13:17,086 INFO L225 Difference]: With dead ends: 2602 [2024-11-28 03:13:17,087 INFO L226 Difference]: Without dead ends: 1174 [2024-11-28 03:13:17,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:13:17,090 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 149 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:13:17,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 153 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:13:17,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2024-11-28 03:13:17,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1174. [2024-11-28 03:13:17,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 960 states have (on average 1.321875) internal successors, (1269), 975 states have internal predecessors, (1269), 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-28 03:13:17,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1543 transitions. [2024-11-28 03:13:17,176 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1543 transitions. Word has length 55 [2024-11-28 03:13:17,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:13:17,177 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1543 transitions. [2024-11-28 03:13:17,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 1 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-28 03:13:17,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1543 transitions. [2024-11-28 03:13:17,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-28 03:13:17,180 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:17,180 INFO L218 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-28 03:13:17,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:13:17,181 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-28 03:13:17,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:17,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1311337292, now seen corresponding path program 1 times [2024-11-28 03:13:17,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:17,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553628428] [2024-11-28 03:13:17,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:17,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:17,215 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-28 03:13:17,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:17,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553628428] [2024-11-28 03:13:17,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553628428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:17,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:17,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:13:17,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60808881] [2024-11-28 03:13:17,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:17,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:13:17,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:17,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:13:17,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:13:17,217 INFO L87 Difference]: Start difference. First operand 1174 states and 1543 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 1 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-28 03:13:17,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:13:17,353 INFO L93 Difference]: Finished difference Result 3106 states and 4099 transitions. [2024-11-28 03:13:17,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:13:17,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 1 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 56 [2024-11-28 03:13:17,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:13:17,364 INFO L225 Difference]: With dead ends: 3106 [2024-11-28 03:13:17,365 INFO L226 Difference]: Without dead ends: 1942 [2024-11-28 03:13:17,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:13:17,369 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 118 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:13:17,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 322 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:13:17,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2024-11-28 03:13:17,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1924. [2024-11-28 03:13:17,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1924 states, 1572 states have (on average 1.3021628498727735) internal successors, (2047), 1596 states have internal predecessors, (2047), 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-28 03:13:17,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2496 transitions. [2024-11-28 03:13:17,526 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2496 transitions. Word has length 56 [2024-11-28 03:13:17,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:13:17,526 INFO L471 AbstractCegarLoop]: Abstraction has 1924 states and 2496 transitions. [2024-11-28 03:13:17,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 1 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-28 03:13:17,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2496 transitions. [2024-11-28 03:13:17,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 03:13:17,528 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:17,528 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-28 03:13:17,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:13:17,528 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-28 03:13:17,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:17,529 INFO L85 PathProgramCache]: Analyzing trace with hash -824982412, now seen corresponding path program 1 times [2024-11-28 03:13:17,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:17,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788326883] [2024-11-28 03:13:17,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:17,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 03:13:17,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:17,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788326883] [2024-11-28 03:13:17,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788326883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:17,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:17,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:13:17,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597794775] [2024-11-28 03:13:17,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:17,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:13:17,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:17,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:13:17,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:13:17,632 INFO L87 Difference]: Start difference. First operand 1924 states and 2496 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 03:13:18,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:13:18,490 INFO L93 Difference]: Finished difference Result 5707 states and 7470 transitions. [2024-11-28 03:13:18,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 03:13:18,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 73 [2024-11-28 03:13:18,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:13:18,513 INFO L225 Difference]: With dead ends: 5707 [2024-11-28 03:13:18,514 INFO L226 Difference]: Without dead ends: 3794 [2024-11-28 03:13:18,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:13:18,520 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 551 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:13:18,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 682 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:13:18,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3794 states. [2024-11-28 03:13:18,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3794 to 3696. [2024-11-28 03:13:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3696 states, 3018 states have (on average 1.2842942345924453) internal successors, (3876), 3063 states have internal predecessors, (3876), 384 states have call successors, (384), 258 states have call predecessors, (384), 290 states have return successors, (555), 376 states have call predecessors, (555), 384 states have call successors, (555) [2024-11-28 03:13:18,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 4815 transitions. [2024-11-28 03:13:18,824 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 4815 transitions. Word has length 73 [2024-11-28 03:13:18,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:13:18,825 INFO L471 AbstractCegarLoop]: Abstraction has 3696 states and 4815 transitions. [2024-11-28 03:13:18,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 03:13:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 4815 transitions. [2024-11-28 03:13:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-28 03:13:18,827 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:18,827 INFO L218 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] [2024-11-28 03:13:18,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:13:18,828 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-28 03:13:18,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:18,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1893221054, now seen corresponding path program 1 times [2024-11-28 03:13:18,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:18,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976799475] [2024-11-28 03:13:18,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:18,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-28 03:13:18,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:18,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976799475] [2024-11-28 03:13:18,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976799475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:18,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:18,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:13:18,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074739374] [2024-11-28 03:13:18,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:18,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:13:18,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:18,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:13:18,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:13:18,970 INFO L87 Difference]: Start difference. First operand 3696 states and 4815 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-28 03:13:19,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:13:19,454 INFO L93 Difference]: Finished difference Result 6721 states and 8706 transitions. [2024-11-28 03:13:19,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:13:19,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 87 [2024-11-28 03:13:19,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:13:19,483 INFO L225 Difference]: With dead ends: 6721 [2024-11-28 03:13:19,484 INFO L226 Difference]: Without dead ends: 3790 [2024-11-28 03:13:19,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:13:19,493 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 169 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:13:19,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 339 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:13:19,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3790 states. [2024-11-28 03:13:19,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3790 to 3752. [2024-11-28 03:13:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3752 states, 3046 states have (on average 1.2724885095206828) internal successors, (3876), 3111 states have internal predecessors, (3876), 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-28 03:13:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3752 states to 3752 states and 4791 transitions. [2024-11-28 03:13:19,948 INFO L78 Accepts]: Start accepts. Automaton has 3752 states and 4791 transitions. Word has length 87 [2024-11-28 03:13:19,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:13:19,948 INFO L471 AbstractCegarLoop]: Abstraction has 3752 states and 4791 transitions. [2024-11-28 03:13:19,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-28 03:13:19,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3752 states and 4791 transitions. [2024-11-28 03:13:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-28 03:13:19,950 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:19,950 INFO L218 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] [2024-11-28 03:13:19,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:13:19,951 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-28 03:13:19,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:19,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2133460800, now seen corresponding path program 1 times [2024-11-28 03:13:19,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:19,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88064321] [2024-11-28 03:13:19,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:19,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:19,990 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-28 03:13:19,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:19,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88064321] [2024-11-28 03:13:19,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88064321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:19,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:19,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:13:19,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782244239] [2024-11-28 03:13:19,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:19,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:13:19,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:19,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:13:19,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:13:19,992 INFO L87 Difference]: Start difference. First operand 3752 states and 4791 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (7), 1 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-28 03:13:20,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:13:20,175 INFO L93 Difference]: Finished difference Result 3754 states and 4791 transitions. [2024-11-28 03:13:20,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:13:20,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (7), 1 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 87 [2024-11-28 03:13:20,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:13:20,193 INFO L225 Difference]: With dead ends: 3754 [2024-11-28 03:13:20,193 INFO L226 Difference]: Without dead ends: 3025 [2024-11-28 03:13:20,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:13:20,198 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 147 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:13:20,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 152 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:13:20,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3025 states. [2024-11-28 03:13:20,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3025 to 3025. [2024-11-28 03:13:20,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3025 states, 2460 states have (on average 1.278048780487805) internal successors, (3144), 2515 states have internal predecessors, (3144), 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-28 03:13:20,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 3878 transitions. [2024-11-28 03:13:20,491 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 3878 transitions. Word has length 87 [2024-11-28 03:13:20,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:13:20,492 INFO L471 AbstractCegarLoop]: Abstraction has 3025 states and 3878 transitions. [2024-11-28 03:13:20,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (7), 1 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-28 03:13:20,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 3878 transitions. [2024-11-28 03:13:20,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-28 03:13:20,494 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:20,495 INFO L218 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] [2024-11-28 03:13:20,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:13:20,495 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-28 03:13:20,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:20,497 INFO L85 PathProgramCache]: Analyzing trace with hash -344937820, now seen corresponding path program 1 times [2024-11-28 03:13:20,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:20,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358502658] [2024-11-28 03:13:20,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:20,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:20,620 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-28 03:13:20,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:20,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358502658] [2024-11-28 03:13:20,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358502658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:20,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:20,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 03:13:20,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391292064] [2024-11-28 03:13:20,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:20,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:13:20,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:20,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:13:20,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:13:20,623 INFO L87 Difference]: Start difference. First operand 3025 states and 3878 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-28 03:13:21,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:13:21,551 INFO L93 Difference]: Finished difference Result 5077 states and 6577 transitions. [2024-11-28 03:13:21,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:13:21,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2024-11-28 03:13:21,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:13:21,571 INFO L225 Difference]: With dead ends: 5077 [2024-11-28 03:13:21,572 INFO L226 Difference]: Without dead ends: 3107 [2024-11-28 03:13:21,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2024-11-28 03:13:21,578 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 884 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:13:21,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 766 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 03:13:21,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2024-11-28 03:13:21,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 3025. [2024-11-28 03:13:21,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3025 states, 2460 states have (on average 1.2691056910569105) internal successors, (3122), 2515 states have internal predecessors, (3122), 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-28 03:13:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 3823 transitions. [2024-11-28 03:13:21,858 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 3823 transitions. Word has length 89 [2024-11-28 03:13:21,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:13:21,858 INFO L471 AbstractCegarLoop]: Abstraction has 3025 states and 3823 transitions. [2024-11-28 03:13:21,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-28 03:13:21,859 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 3823 transitions. [2024-11-28 03:13:21,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-28 03:13:21,861 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:21,861 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:13:21,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 03:13:21,862 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-28 03:13:21,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:21,862 INFO L85 PathProgramCache]: Analyzing trace with hash 293950538, now seen corresponding path program 1 times [2024-11-28 03:13:21,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:21,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957254635] [2024-11-28 03:13:21,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:21,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:21,930 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-28 03:13:21,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:21,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957254635] [2024-11-28 03:13:21,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957254635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:21,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:21,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:13:21,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366879096] [2024-11-28 03:13:21,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:21,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:13:21,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:21,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:13:21,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:13:21,932 INFO L87 Difference]: Start difference. First operand 3025 states and 3823 transitions. Second operand has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-28 03:13:22,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:13:22,329 INFO L93 Difference]: Finished difference Result 3025 states and 3823 transitions. [2024-11-28 03:13:22,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:13:22,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 95 [2024-11-28 03:13:22,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:13:22,355 INFO L225 Difference]: With dead ends: 3025 [2024-11-28 03:13:22,355 INFO L226 Difference]: Without dead ends: 3024 [2024-11-28 03:13:22,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:13:22,358 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 141 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:13:22,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 148 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:13:22,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3024 states. [2024-11-28 03:13:22,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3024 to 3024. [2024-11-28 03:13:22,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3024 states, 2460 states have (on average 1.2654471544715447) internal successors, (3113), 2514 states have internal predecessors, (3113), 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-28 03:13:22,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 3024 states and 3814 transitions. [2024-11-28 03:13:22,758 INFO L78 Accepts]: Start accepts. Automaton has 3024 states and 3814 transitions. Word has length 95 [2024-11-28 03:13:22,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:13:22,759 INFO L471 AbstractCegarLoop]: Abstraction has 3024 states and 3814 transitions. [2024-11-28 03:13:22,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-28 03:13:22,760 INFO L276 IsEmpty]: Start isEmpty. Operand 3024 states and 3814 transitions. [2024-11-28 03:13:22,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 03:13:22,762 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:22,762 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:13:22,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 03:13:22,762 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-28 03:13:22,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:22,763 INFO L85 PathProgramCache]: Analyzing trace with hash 522532389, now seen corresponding path program 1 times [2024-11-28 03:13:22,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:22,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565516252] [2024-11-28 03:13:22,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:22,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:13:22,781 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:13:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:13:22,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:13:22,837 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:13:22,839 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-28 03:13:22,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-28 03:13:22,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-28 03:13:22,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-28 03:13:22,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 03:13:22,845 INFO L422 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-28 03:13:22,956 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:13:22,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:13:22 BoogieIcfgContainer [2024-11-28 03:13:22,960 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:13:22,962 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:13:22,962 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:13:22,962 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:13:22,963 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:13:09" (3/4) ... [2024-11-28 03:13:22,964 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-28 03:13:23,090 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 69. [2024-11-28 03:13:23,222 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f885e0ab-9783-4a4d-b379-34e6ad0a6b0a/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 03:13:23,222 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f885e0ab-9783-4a4d-b379-34e6ad0a6b0a/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 03:13:23,222 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:13:23,223 INFO L158 Benchmark]: Toolchain (without parser) took 14844.90ms. Allocated memory was 117.4MB in the beginning and 637.5MB in the end (delta: 520.1MB). Free memory was 92.6MB in the beginning and 593.9MB in the end (delta: -501.3MB). Peak memory consumption was 379.3MB. Max. memory is 16.1GB. [2024-11-28 03:13:23,223 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 73.0MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:13:23,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.16ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 79.5MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:13:23,224 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.01ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 77.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:13:23,224 INFO L158 Benchmark]: Boogie Preprocessor took 45.83ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 76.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:13:23,225 INFO L158 Benchmark]: RCFGBuilder took 573.17ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 56.9MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 03:13:23,225 INFO L158 Benchmark]: TraceAbstraction took 13504.17ms. Allocated memory was 117.4MB in the beginning and 637.5MB in the end (delta: 520.1MB). Free memory was 56.4MB in the beginning and 245.9MB in the end (delta: -189.5MB). Peak memory consumption was 337.3MB. Max. memory is 16.1GB. [2024-11-28 03:13:23,225 INFO L158 Benchmark]: Witness Printer took 260.74ms. Allocated memory is still 637.5MB. Free memory was 245.9MB in the beginning and 593.9MB in the end (delta: -348.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 03:13:23,231 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.67ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 73.0MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.16ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 79.5MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.01ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 77.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.83ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 76.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 573.17ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 56.9MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13504.17ms. Allocated memory was 117.4MB in the beginning and 637.5MB in the end (delta: 520.1MB). Free memory was 56.4MB in the beginning and 245.9MB in the end (delta: -189.5MB). Peak memory consumption was 337.3MB. Max. memory is 16.1GB. * Witness Printer took 260.74ms. Allocated memory is still 637.5MB. Free memory was 245.9MB in the beginning and 593.9MB in the end (delta: -348.0MB). 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: 119]: 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] [L485] int __retres1 ; [L489] CALL init_model() [L400] m_i = 1 [L401] 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] [L489] RET init_model() [L490] CALL start_simulation() [L426] int kernel_st ; [L427] int tmp ; [L428] int tmp___0 ; [L432] 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] [L433] 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] [L434] CALL init_threads() [L182] COND TRUE m_i == 1 [L183] 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] [L187] COND TRUE t1_i == 1 [L188] 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] [L434] RET init_threads() [L435] 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] [L271] 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] [L276] 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] [L281] 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] [L286] 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] [L435] 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] [L436] 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] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] 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] [L136] 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] [L146] __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] [L148] 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] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] 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] [L337] CALL, EXPR is_transmit1_triggered() [L152] 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] [L155] 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] [L165] __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] [L167] 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] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] 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] [L436] 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] [L437] 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] [L299] 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] [L304] 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] [L309] 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] [L314] 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] [L437] 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] [L443] kernel_st = 1 [L444] CALL eval() [L218] 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] [L225] 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] [L197] 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] [L200] COND TRUE m_st == 0 [L201] __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] [L213] 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] [L225] 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] [L225] tmp = exists_runnable_thread() [L227] 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] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] 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] [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] 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] [L113] t1_pc = 1 [L114] 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] [L252] RET transmit1() [L225] 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] [L197] 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] [L200] COND TRUE m_st == 0 [L201] __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] [L213] 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] [L225] 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] [L225] tmp = exists_runnable_thread() [L227] 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] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND TRUE \read(tmp_ndt_1) [L237] m_st = 1 [L238] CALL master() [L42] int tmp_var = __VERIFIER_nondet_int(); [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, tmp_var=0, 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, tmp_var=0, 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] [L353] 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] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] 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] [L136] 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] [L146] __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] [L148] 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] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] 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] [L337] CALL, EXPR is_transmit1_triggered() [L152] 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] [L155] 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] [L156] COND TRUE E_1 == 1 [L157] __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] [L167] 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] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND TRUE \read(tmp___0) [L340] 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] [L353] 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, tmp_var=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, tmp_var=0, token=2147483647] [L238] RET master() [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] 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] [L103] 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] [L119] 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: 119]: 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 8 procedures, 120 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4212 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4117 mSDsluCounter, 8768 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5841 mSDsCounter, 593 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3444 IncrementalHoareTripleChecker+Invalid, 4037 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 593 mSolverCounterUnsat, 2927 mSDtfsCounter, 3444 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3752occurred in iteration=15, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 644 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1227 NumberOfCodeBlocks, 1227 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1113 ConstructedInterpolants, 0 QuantifiedInterpolants, 1940 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 116/116 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-28 03:13:23,254 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f885e0ab-9783-4a4d-b379-34e6ad0a6b0a/bin/uautomizer-verify-aQ6SnzHsRB/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)