./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bc8487f898950b83c481f83a71342af68752fb6e7598d76df123761c32c89f72 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:14:25,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:14:25,205 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Overflow-32bit-Taipan_Default.epf [2024-11-14 04:14:25,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:14:25,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:14:25,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:14:25,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:14:25,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:14:25,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:14:25,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:14:25,252 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:14:25,252 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:14:25,252 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:14:25,252 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:14:25,253 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:14:25,253 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:14:25,253 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:14:25,253 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:14:25,253 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:14:25,253 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:14:25,254 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:14:25,254 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:14:25,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:14:25,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:14:25,254 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:14:25,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:14:25,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:14:25,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:14:25,255 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:14:25,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:14:25,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:14:25,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:14:25,255 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-14 04:14:25,255 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 04:14:25,255 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:14:25,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:14:25,255 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:14:25,255 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:14:25,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:14:25,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:14:25,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:14:25,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:14:25,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:14:25,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:14:25,256 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:14:25,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:14:25,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:14:25,256 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:14:25,256 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:14:25,256 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E 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 -> Taipan 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 -> bc8487f898950b83c481f83a71342af68752fb6e7598d76df123761c32c89f72 [2024-11-14 04:14:25,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:14:25,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:14:25,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:14:25,539 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:14:25,539 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:14:25,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c Unable to find full path for "g++" [2024-11-14 04:14:27,459 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:14:27,768 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:14:27,768 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2024-11-14 04:14:27,783 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/data/de732b5ae/4ed1c84b84d54c88b4f71636abf834f8/FLAGefc0675d2 [2024-11-14 04:14:27,802 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/data/de732b5ae/4ed1c84b84d54c88b4f71636abf834f8 [2024-11-14 04:14:27,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:14:27,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:14:27,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:14:27,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:14:27,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:14:27,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:14:27" (1/1) ... [2024-11-14 04:14:27,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c648b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:27, skipping insertion in model container [2024-11-14 04:14:27,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:14:27" (1/1) ... [2024-11-14 04:14:27,858 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:14:28,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:14:28,133 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:14:28,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:14:28,228 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:14:28,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:28 WrapperNode [2024-11-14 04:14:28,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:14:28,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:14:28,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:14:28,230 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:14:28,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:28" (1/1) ... [2024-11-14 04:14:28,242 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:28" (1/1) ... [2024-11-14 04:14:28,265 INFO L138 Inliner]: procedures = 32, calls = 39, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 291 [2024-11-14 04:14:28,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:14:28,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:14:28,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:14:28,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:14:28,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:28" (1/1) ... [2024-11-14 04:14:28,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:28" (1/1) ... [2024-11-14 04:14:28,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:28" (1/1) ... [2024-11-14 04:14:28,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:28" (1/1) ... [2024-11-14 04:14:28,281 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:28" (1/1) ... [2024-11-14 04:14:28,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:28" (1/1) ... [2024-11-14 04:14:28,289 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:28" (1/1) ... [2024-11-14 04:14:28,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:28" (1/1) ... [2024-11-14 04:14:28,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:14:28,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:14:28,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:14:28,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:14:28,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:28" (1/1) ... [2024-11-14 04:14:28,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:14:28,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:14:28,338 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:14:28,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:14:28,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:14:28,363 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-14 04:14:28,363 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-14 04:14:28,363 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-14 04:14:28,363 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-14 04:14:28,363 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-14 04:14:28,363 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-14 04:14:28,363 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-14 04:14:28,363 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-14 04:14:28,363 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-14 04:14:28,363 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-14 04:14:28,363 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-14 04:14:28,363 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-14 04:14:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:14:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-14 04:14:28,364 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-14 04:14:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:14:28,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:14:28,459 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:14:28,461 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:14:28,988 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-14 04:14:28,989 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:14:29,256 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:14:29,256 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-14 04:14:29,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:14:29 BoogieIcfgContainer [2024-11-14 04:14:29,257 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:14:29,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:14:29,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:14:29,268 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:14:29,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:14:27" (1/3) ... [2024-11-14 04:14:29,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f8f71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:14:29, skipping insertion in model container [2024-11-14 04:14:29,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:28" (2/3) ... [2024-11-14 04:14:29,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f8f71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:14:29, skipping insertion in model container [2024-11-14 04:14:29,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:14:29" (3/3) ... [2024-11-14 04:14:29,273 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2024-11-14 04:14:29,289 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:14:29,290 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.02.cil-2.c that has 8 procedures, 98 locations, 1 initial locations, 5 loop locations, and 6 error locations. [2024-11-14 04:14:29,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:14:29,354 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=FINITE_AUTOMATA, 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;@2a95d59e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:14:29,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-14 04:14:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 66 states have (on average 1.5151515151515151) internal successors, (100), 75 states have internal predecessors, (100), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-14 04:14:29,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 04:14:29,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:14:29,366 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:14:29,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 04:14:29,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:14:29,371 INFO L85 PathProgramCache]: Analyzing trace with hash 126810825, now seen corresponding path program 1 times [2024-11-14 04:14:29,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:14:29,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919887495] [2024-11-14 04:14:29,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:14:29,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:14:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:14:29,798 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-14 04:14:29,798 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:14:29,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919887495] [2024-11-14 04:14:29,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919887495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:14:29,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:14:29,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:14:29,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071818601] [2024-11-14 04:14:29,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:14:29,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:14:29,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:14:29,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:14:29,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:14:29,828 INFO L87 Difference]: Start difference. First operand has 98 states, 66 states have (on average 1.5151515151515151) internal successors, (100), 75 states have internal predecessors, (100), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-14 04:14:30,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:14:30,217 INFO L93 Difference]: Finished difference Result 267 states and 381 transitions. [2024-11-14 04:14:30,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:14:30,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 35 [2024-11-14 04:14:30,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:14:30,234 INFO L225 Difference]: With dead ends: 267 [2024-11-14 04:14:30,234 INFO L226 Difference]: Without dead ends: 167 [2024-11-14 04:14:30,238 INFO L431 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-14 04:14:30,244 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 211 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:14:30,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 320 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 04:14:30,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-14 04:14:30,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 162. [2024-11-14 04:14:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 116 states have (on average 1.3879310344827587) internal successors, (161), 123 states have internal predecessors, (161), 28 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-14 04:14:30,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 217 transitions. [2024-11-14 04:14:30,326 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 217 transitions. Word has length 35 [2024-11-14 04:14:30,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:14:30,327 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 217 transitions. [2024-11-14 04:14:30,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-14 04:14:30,328 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 217 transitions. [2024-11-14 04:14:30,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 04:14:30,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:14:30,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:14:30,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 04:14:30,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 04:14:30,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:14:30,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1711610397, now seen corresponding path program 1 times [2024-11-14 04:14:30,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:14:30,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144489798] [2024-11-14 04:14:30,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:14:30,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:14:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:14:30,570 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-14 04:14:30,570 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:14:30,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144489798] [2024-11-14 04:14:30,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144489798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:14:30,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:14:30,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:14:30,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586527981] [2024-11-14 04:14:30,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:14:30,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:14:30,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:14:30,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:14:30,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:14:30,574 INFO L87 Difference]: Start difference. First operand 162 states and 217 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-14 04:14:31,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:14:31,166 INFO L93 Difference]: Finished difference Result 532 states and 711 transitions. [2024-11-14 04:14:31,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:14:31,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 36 [2024-11-14 04:14:31,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:14:31,172 INFO L225 Difference]: With dead ends: 532 [2024-11-14 04:14:31,173 INFO L226 Difference]: Without dead ends: 358 [2024-11-14 04:14:31,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:14:31,178 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 354 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:14:31,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 490 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 04:14:31,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-14 04:14:31,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 344. [2024-11-14 04:14:31,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 256 states have (on average 1.3671875) internal successors, (350), 262 states have internal predecessors, (350), 54 states have call successors, (54), 26 states have call predecessors, (54), 28 states have return successors, (59), 56 states have call predecessors, (59), 54 states have call successors, (59) [2024-11-14 04:14:31,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 463 transitions. [2024-11-14 04:14:31,250 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 463 transitions. Word has length 36 [2024-11-14 04:14:31,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:14:31,251 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 463 transitions. [2024-11-14 04:14:31,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-14 04:14:31,251 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 463 transitions. [2024-11-14 04:14:31,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 04:14:31,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:14:31,252 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:14:31,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 04:14:31,253 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 04:14:31,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:14:31,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1050276606, now seen corresponding path program 1 times [2024-11-14 04:14:31,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:14:31,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209730039] [2024-11-14 04:14:31,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:14:31,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:14:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:14:31,508 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-14 04:14:31,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:14:31,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209730039] [2024-11-14 04:14:31,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209730039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:14:31,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:14:31,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 04:14:31,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851864928] [2024-11-14 04:14:31,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:14:31,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:14:31,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:14:31,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:14:31,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:14:31,511 INFO L87 Difference]: Start difference. First operand 344 states and 463 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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-14 04:14:31,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:14:31,934 INFO L93 Difference]: Finished difference Result 918 states and 1232 transitions. [2024-11-14 04:14:31,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 04:14:31,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 36 [2024-11-14 04:14:31,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:14:31,940 INFO L225 Difference]: With dead ends: 918 [2024-11-14 04:14:31,940 INFO L226 Difference]: Without dead ends: 580 [2024-11-14 04:14:31,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-14 04:14:31,942 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 269 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:14:31,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 276 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 04:14:31,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-11-14 04:14:32,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 541. [2024-11-14 04:14:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 406 states have (on average 1.3497536945812807) internal successors, (548), 410 states have internal predecessors, (548), 81 states have call successors, (81), 44 states have call predecessors, (81), 48 states have return successors, (90), 87 states have call predecessors, (90), 81 states have call successors, (90) [2024-11-14 04:14:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 719 transitions. [2024-11-14 04:14:32,023 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 719 transitions. Word has length 36 [2024-11-14 04:14:32,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:14:32,023 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 719 transitions. [2024-11-14 04:14:32,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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-14 04:14:32,024 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 719 transitions. [2024-11-14 04:14:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-14 04:14:32,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:14:32,028 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:14:32,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 04:14:32,028 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 04:14:32,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:14:32,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1569113618, now seen corresponding path program 1 times [2024-11-14 04:14:32,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:14:32,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342264524] [2024-11-14 04:14:32,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:14:32,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:14:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:14:32,114 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-14 04:14:32,115 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:14:32,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342264524] [2024-11-14 04:14:32,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342264524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:14:32,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:14:32,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:14:32,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52690565] [2024-11-14 04:14:32,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:14:32,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:14:32,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:14:32,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:14:32,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:14:32,117 INFO L87 Difference]: Start difference. First operand 541 states and 719 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-14 04:14:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:14:32,320 INFO L93 Difference]: Finished difference Result 1558 states and 2082 transitions. [2024-11-14 04:14:32,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:14:32,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 38 [2024-11-14 04:14:32,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:14:32,328 INFO L225 Difference]: With dead ends: 1558 [2024-11-14 04:14:32,328 INFO L226 Difference]: Without dead ends: 1022 [2024-11-14 04:14:32,330 INFO L431 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-14 04:14:32,330 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 93 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:14:32,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 209 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:14:32,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2024-11-14 04:14:32,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1006. [2024-11-14 04:14:32,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 758 states have (on average 1.3139841688654355) internal successors, (996), 762 states have internal predecessors, (996), 150 states have call successors, (150), 86 states have call predecessors, (150), 92 states have return successors, (164), 158 states have call predecessors, (164), 150 states have call successors, (164) [2024-11-14 04:14:32,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1310 transitions. [2024-11-14 04:14:32,478 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1310 transitions. Word has length 38 [2024-11-14 04:14:32,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:14:32,479 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1310 transitions. [2024-11-14 04:14:32,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-14 04:14:32,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1310 transitions. [2024-11-14 04:14:32,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-14 04:14:32,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:14:32,481 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 04:14:32,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 04:14:32,482 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 04:14:32,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:14:32,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1183430774, now seen corresponding path program 1 times [2024-11-14 04:14:32,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:14:32,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319671934] [2024-11-14 04:14:32,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:14:32,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:14:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:14:32,659 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 04:14:32,659 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:14:32,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319671934] [2024-11-14 04:14:32,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319671934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:14:32,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:14:32,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 04:14:32,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991662559] [2024-11-14 04:14:32,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:14:32,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:14:32,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:14:32,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:14:32,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:14:32,661 INFO L87 Difference]: Start difference. First operand 1006 states and 1310 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-14 04:14:33,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:14:33,162 INFO L93 Difference]: Finished difference Result 2506 states and 3249 transitions. [2024-11-14 04:14:33,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 04:14:33,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 53 [2024-11-14 04:14:33,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:14:33,175 INFO L225 Difference]: With dead ends: 2506 [2024-11-14 04:14:33,175 INFO L226 Difference]: Without dead ends: 1506 [2024-11-14 04:14:33,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-14 04:14:33,183 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 266 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:14:33,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 328 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 04:14:33,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2024-11-14 04:14:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1456. [2024-11-14 04:14:33,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1101 states have (on average 1.2942779291553133) internal successors, (1425), 1107 states have internal predecessors, (1425), 215 states have call successors, (215), 128 states have call predecessors, (215), 134 states have return successors, (229), 221 states have call predecessors, (229), 215 states have call successors, (229) [2024-11-14 04:14:33,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 1869 transitions. [2024-11-14 04:14:33,401 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 1869 transitions. Word has length 53 [2024-11-14 04:14:33,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:14:33,402 INFO L471 AbstractCegarLoop]: Abstraction has 1456 states and 1869 transitions. [2024-11-14 04:14:33,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-14 04:14:33,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1869 transitions. [2024-11-14 04:14:33,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-14 04:14:33,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:14:33,405 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 04:14:33,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 04:14:33,405 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 04:14:33,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:14:33,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1577366969, now seen corresponding path program 1 times [2024-11-14 04:14:33,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:14:33,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571587977] [2024-11-14 04:14:33,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:14:33,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:14:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:14:33,624 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 04:14:33,624 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:14:33,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571587977] [2024-11-14 04:14:33,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571587977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:14:33,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:14:33,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 04:14:33,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187884450] [2024-11-14 04:14:33,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:14:33,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:14:33,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:14:33,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:14:33,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:14:33,626 INFO L87 Difference]: Start difference. First operand 1456 states and 1869 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-14 04:14:34,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:14:34,193 INFO L93 Difference]: Finished difference Result 3690 states and 4736 transitions. [2024-11-14 04:14:34,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 04:14:34,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 54 [2024-11-14 04:14:34,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:14:34,207 INFO L225 Difference]: With dead ends: 3690 [2024-11-14 04:14:34,207 INFO L226 Difference]: Without dead ends: 2240 [2024-11-14 04:14:34,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-14 04:14:34,211 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 273 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:14:34,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 337 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 04:14:34,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2024-11-14 04:14:34,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 2116. [2024-11-14 04:14:34,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2116 states, 1598 states have (on average 1.2728410513141426) internal successors, (2034), 1605 states have internal predecessors, (2034), 314 states have call successors, (314), 190 states have call predecessors, (314), 198 states have return successors, (333), 321 states have call predecessors, (333), 314 states have call successors, (333) [2024-11-14 04:14:34,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 2681 transitions. [2024-11-14 04:14:34,460 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 2681 transitions. Word has length 54 [2024-11-14 04:14:34,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:14:34,461 INFO L471 AbstractCegarLoop]: Abstraction has 2116 states and 2681 transitions. [2024-11-14 04:14:34,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-14 04:14:34,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2681 transitions. [2024-11-14 04:14:34,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-14 04:14:34,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:14:34,463 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 04:14:34,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 04:14:34,463 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 04:14:34,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:14:34,463 INFO L85 PathProgramCache]: Analyzing trace with hash 732980719, now seen corresponding path program 1 times [2024-11-14 04:14:34,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:14:34,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058686211] [2024-11-14 04:14:34,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:14:34,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:14:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:14:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 04:14:34,529 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:14:34,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058686211] [2024-11-14 04:14:34,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058686211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:14:34,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:14:34,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:14:34,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663349241] [2024-11-14 04:14:34,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:14:34,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:14:34,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:14:34,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:14:34,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:14:34,536 INFO L87 Difference]: Start difference. First operand 2116 states and 2681 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-14 04:14:34,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:14:34,877 INFO L93 Difference]: Finished difference Result 3972 states and 5080 transitions. [2024-11-14 04:14:34,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:14:34,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 55 [2024-11-14 04:14:34,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:14:34,896 INFO L225 Difference]: With dead ends: 3972 [2024-11-14 04:14:34,897 INFO L226 Difference]: Without dead ends: 2536 [2024-11-14 04:14:34,902 INFO L431 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-14 04:14:34,902 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 55 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:14:34,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 258 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:14:34,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2024-11-14 04:14:35,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2291. [2024-11-14 04:14:35,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2291 states, 1747 states have (on average 1.2770463651974815) internal successors, (2231), 1754 states have internal predecessors, (2231), 327 states have call successors, (327), 203 states have call predecessors, (327), 211 states have return successors, (346), 334 states have call predecessors, (346), 327 states have call successors, (346) [2024-11-14 04:14:35,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 2904 transitions. [2024-11-14 04:14:35,151 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 2904 transitions. Word has length 55 [2024-11-14 04:14:35,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:14:35,152 INFO L471 AbstractCegarLoop]: Abstraction has 2291 states and 2904 transitions. [2024-11-14 04:14:35,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-14 04:14:35,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 2904 transitions. [2024-11-14 04:14:35,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-14 04:14:35,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:14:35,153 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 04:14:35,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 04:14:35,154 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 04:14:35,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:14:35,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2036598328, now seen corresponding path program 1 times [2024-11-14 04:14:35,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:14:35,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349400815] [2024-11-14 04:14:35,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:14:35,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:14:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:14:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 04:14:35,260 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:14:35,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349400815] [2024-11-14 04:14:35,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349400815] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:14:35,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961998999] [2024-11-14 04:14:35,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:14:35,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:14:35,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:14:35,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:14:35,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 04:14:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:14:35,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 04:14:35,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:14:35,516 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 04:14:35,516 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:14:35,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961998999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:14:35,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:14:35,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2024-11-14 04:14:35,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389674868] [2024-11-14 04:14:35,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:14:35,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:14:35,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:14:35,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:14:35,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:14:35,519 INFO L87 Difference]: Start difference. First operand 2291 states and 2904 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-14 04:14:35,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:14:35,758 INFO L93 Difference]: Finished difference Result 2293 states and 2904 transitions. [2024-11-14 04:14:35,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:14:35,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 58 [2024-11-14 04:14:35,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:14:35,771 INFO L225 Difference]: With dead ends: 2293 [2024-11-14 04:14:35,772 INFO L226 Difference]: Without dead ends: 2291 [2024-11-14 04:14:35,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:14:35,773 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 51 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:14:35,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 211 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:14:35,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2024-11-14 04:14:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2291. [2024-11-14 04:14:35,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2291 states, 1747 states have (on average 1.2736119061247853) internal successors, (2225), 1754 states have internal predecessors, (2225), 327 states have call successors, (327), 203 states have call predecessors, (327), 211 states have return successors, (346), 334 states have call predecessors, (346), 327 states have call successors, (346) [2024-11-14 04:14:35,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 2898 transitions. [2024-11-14 04:14:35,982 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 2898 transitions. Word has length 58 [2024-11-14 04:14:35,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:14:35,982 INFO L471 AbstractCegarLoop]: Abstraction has 2291 states and 2898 transitions. [2024-11-14 04:14:35,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-14 04:14:35,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 2898 transitions. [2024-11-14 04:14:35,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-14 04:14:35,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:14:35,984 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 04:14:36,005 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 04:14:36,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:14:36,189 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 04:14:36,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:14:36,193 INFO L85 PathProgramCache]: Analyzing trace with hash 173562779, now seen corresponding path program 1 times [2024-11-14 04:14:36,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:14:36,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042984714] [2024-11-14 04:14:36,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:14:36,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:14:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:14:36,267 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-14 04:14:36,267 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:14:36,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042984714] [2024-11-14 04:14:36,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042984714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:14:36,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:14:36,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:14:36,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255094764] [2024-11-14 04:14:36,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:14:36,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:14:36,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:14:36,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:14:36,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:14:36,269 INFO L87 Difference]: Start difference. First operand 2291 states and 2898 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-14 04:14:36,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:14:36,536 INFO L93 Difference]: Finished difference Result 4008 states and 5093 transitions. [2024-11-14 04:14:36,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:14:36,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 60 [2024-11-14 04:14:36,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:14:36,553 INFO L225 Difference]: With dead ends: 4008 [2024-11-14 04:14:36,553 INFO L226 Difference]: Without dead ends: 2334 [2024-11-14 04:14:36,557 INFO L431 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-14 04:14:36,559 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 84 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:14:36,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 201 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:14:36,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states. [2024-11-14 04:14:36,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 1929. [2024-11-14 04:14:36,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1449 states have (on average 1.2650103519668736) internal successors, (1833), 1464 states have internal predecessors, (1833), 293 states have call successors, (293), 181 states have call predecessors, (293), 181 states have return successors, (293), 284 states have call predecessors, (293), 293 states have call successors, (293) [2024-11-14 04:14:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2419 transitions. [2024-11-14 04:14:36,838 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2419 transitions. Word has length 60 [2024-11-14 04:14:36,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:14:36,838 INFO L471 AbstractCegarLoop]: Abstraction has 1929 states and 2419 transitions. [2024-11-14 04:14:36,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-14 04:14:36,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2419 transitions. [2024-11-14 04:14:36,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-14 04:14:36,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:14:36,841 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 04:14:36,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 04:14:36,843 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 04:14:36,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:14:36,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1289960862, now seen corresponding path program 1 times [2024-11-14 04:14:36,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:14:36,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565909379] [2024-11-14 04:14:36,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:14:36,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:14:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:14:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 04:14:36,934 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:14:36,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565909379] [2024-11-14 04:14:36,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565909379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:14:36,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506016468] [2024-11-14 04:14:36,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:14:36,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:14:36,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:14:36,936 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:14:36,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 04:14:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:14:37,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 04:14:37,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:14:37,116 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 04:14:37,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:14:37,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506016468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:14:37,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:14:37,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2024-11-14 04:14:37,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483584482] [2024-11-14 04:14:37,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:14:37,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:14:37,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:14:37,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:14:37,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:14:37,118 INFO L87 Difference]: Start difference. First operand 1929 states and 2419 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-14 04:14:37,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:14:37,371 INFO L93 Difference]: Finished difference Result 2413 states and 3018 transitions. [2024-11-14 04:14:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:14:37,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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 59 [2024-11-14 04:14:37,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:14:37,384 INFO L225 Difference]: With dead ends: 2413 [2024-11-14 04:14:37,385 INFO L226 Difference]: Without dead ends: 2411 [2024-11-14 04:14:37,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:14:37,387 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 40 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:14:37,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 205 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:14:37,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2024-11-14 04:14:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2395. [2024-11-14 04:14:37,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2395 states, 1805 states have (on average 1.2609418282548477) internal successors, (2276), 1820 states have internal predecessors, (2276), 360 states have call successors, (360), 224 states have call predecessors, (360), 224 states have return successors, (360), 351 states have call predecessors, (360), 360 states have call successors, (360) [2024-11-14 04:14:37,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 2996 transitions. [2024-11-14 04:14:37,684 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 2996 transitions. Word has length 59 [2024-11-14 04:14:37,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:14:37,684 INFO L471 AbstractCegarLoop]: Abstraction has 2395 states and 2996 transitions. [2024-11-14 04:14:37,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-14 04:14:37,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 2996 transitions. [2024-11-14 04:14:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-14 04:14:37,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:14:37,689 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 04:14:37,710 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 04:14:37,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-14 04:14:37,890 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 04:14:37,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:14:37,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1838471169, now seen corresponding path program 1 times [2024-11-14 04:14:37,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:14:37,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841855246] [2024-11-14 04:14:37,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:14:37,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:14:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:14:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 04:14:37,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:14:37,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841855246] [2024-11-14 04:14:37,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841855246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:14:37,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:14:37,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:14:37,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884112044] [2024-11-14 04:14:37,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:14:37,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:14:37,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:14:37,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:14:37,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:14:37,979 INFO L87 Difference]: Start difference. First operand 2395 states and 2996 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-14 04:14:38,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:14:38,280 INFO L93 Difference]: Finished difference Result 3934 states and 4962 transitions. [2024-11-14 04:14:38,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:14:38,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 69 [2024-11-14 04:14:38,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:14:38,296 INFO L225 Difference]: With dead ends: 3934 [2024-11-14 04:14:38,296 INFO L226 Difference]: Without dead ends: 2719 [2024-11-14 04:14:38,300 INFO L431 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-14 04:14:38,300 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 43 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:14:38,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 250 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:14:38,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2024-11-14 04:14:38,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 2566. [2024-11-14 04:14:38,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 1952 states have (on average 1.2653688524590163) internal successors, (2470), 1967 states have internal predecessors, (2470), 372 states have call successors, (372), 236 states have call predecessors, (372), 236 states have return successors, (372), 363 states have call predecessors, (372), 372 states have call successors, (372) [2024-11-14 04:14:38,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3214 transitions. [2024-11-14 04:14:38,542 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3214 transitions. Word has length 69 [2024-11-14 04:14:38,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:14:38,543 INFO L471 AbstractCegarLoop]: Abstraction has 2566 states and 3214 transitions. [2024-11-14 04:14:38,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-14 04:14:38,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3214 transitions. [2024-11-14 04:14:38,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-14 04:14:38,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:14:38,549 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:14:38,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 04:14:38,549 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 04:14:38,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:14:38,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1036102520, now seen corresponding path program 1 times [2024-11-14 04:14:38,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:14:38,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668697051] [2024-11-14 04:14:38,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:14:38,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:14:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:14:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 04:14:38,632 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:14:38,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668697051] [2024-11-14 04:14:38,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668697051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:14:38,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:14:38,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:14:38,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658992656] [2024-11-14 04:14:38,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:14:38,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:14:38,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:14:38,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:14:38,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:14:38,634 INFO L87 Difference]: Start difference. First operand 2566 states and 3214 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-14 04:14:39,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:14:39,202 INFO L93 Difference]: Finished difference Result 4414 states and 5641 transitions. [2024-11-14 04:14:39,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:14:39,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2024-11-14 04:14:39,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:14:39,223 INFO L225 Difference]: With dead ends: 4414 [2024-11-14 04:14:39,223 INFO L226 Difference]: Without dead ends: 2578 [2024-11-14 04:14:39,231 INFO L431 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-14 04:14:39,231 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 196 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:14:39,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 314 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:14:39,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2024-11-14 04:14:39,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2560. [2024-11-14 04:14:39,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2560 states, 1946 states have (on average 1.2353545734840699) internal successors, (2404), 1961 states have internal predecessors, (2404), 372 states have call successors, (372), 236 states have call predecessors, (372), 236 states have return successors, (372), 363 states have call predecessors, (372), 372 states have call successors, (372) [2024-11-14 04:14:39,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3148 transitions. [2024-11-14 04:14:39,565 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3148 transitions. Word has length 74 [2024-11-14 04:14:39,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:14:39,566 INFO L471 AbstractCegarLoop]: Abstraction has 2560 states and 3148 transitions. [2024-11-14 04:14:39,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-14 04:14:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3148 transitions. [2024-11-14 04:14:39,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-14 04:14:39,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:14:39,572 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 04:14:39,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 04:14:39,572 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 04:14:39,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:14:39,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1143869255, now seen corresponding path program 1 times [2024-11-14 04:14:39,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:14:39,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668342737] [2024-11-14 04:14:39,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:14:39,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:14:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:14:39,641 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-14 04:14:39,642 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:14:39,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668342737] [2024-11-14 04:14:39,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668342737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:14:39,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:14:39,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:14:39,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125077841] [2024-11-14 04:14:39,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:14:39,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:14:39,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:14:39,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:14:39,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:14:39,644 INFO L87 Difference]: Start difference. First operand 2560 states and 3148 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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-14 04:14:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:14:39,933 INFO L93 Difference]: Finished difference Result 2560 states and 3148 transitions. [2024-11-14 04:14:39,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:14:39,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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 74 [2024-11-14 04:14:39,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:14:39,948 INFO L225 Difference]: With dead ends: 2560 [2024-11-14 04:14:39,948 INFO L226 Difference]: Without dead ends: 2558 [2024-11-14 04:14:39,950 INFO L431 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-14 04:14:39,952 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:14:39,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 98 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 04:14:39,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2024-11-14 04:14:40,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2558. [2024-11-14 04:14:40,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 1946 states have (on average 1.2291880781089415) internal successors, (2392), 1959 states have internal predecessors, (2392), 372 states have call successors, (372), 236 states have call predecessors, (372), 236 states have return successors, (372), 363 states have call predecessors, (372), 372 states have call successors, (372) [2024-11-14 04:14:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3136 transitions. [2024-11-14 04:14:40,281 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3136 transitions. Word has length 74 [2024-11-14 04:14:40,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:14:40,282 INFO L471 AbstractCegarLoop]: Abstraction has 2558 states and 3136 transitions. [2024-11-14 04:14:40,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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-14 04:14:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3136 transitions. [2024-11-14 04:14:40,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-14 04:14:40,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:14:40,285 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 04:14:40,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 04:14:40,285 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 04:14:40,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:14:40,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1100208902, now seen corresponding path program 1 times [2024-11-14 04:14:40,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:14:40,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498257117] [2024-11-14 04:14:40,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:14:40,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:14:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:14:40,304 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 04:14:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:14:40,371 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 04:14:40,374 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 04:14:40,375 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-14 04:14:40,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-14 04:14:40,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-14 04:14:40,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-14 04:14:40,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-14 04:14:40,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-14 04:14:40,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 04:14:40,385 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:14:40,489 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 04:14:40,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:14:40 BoogieIcfgContainer [2024-11-14 04:14:40,493 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 04:14:40,494 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 04:14:40,494 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 04:14:40,494 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 04:14:40,495 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:14:29" (3/4) ... [2024-11-14 04:14:40,496 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-14 04:14:40,607 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/witness.graphml [2024-11-14 04:14:40,607 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 04:14:40,610 INFO L158 Benchmark]: Toolchain (without parser) took 12801.01ms. Allocated memory was 117.4MB in the beginning and 528.5MB in the end (delta: 411.0MB). Free memory was 92.1MB in the beginning and 363.0MB in the end (delta: -270.9MB). Peak memory consumption was 135.5MB. Max. memory is 16.1GB. [2024-11-14 04:14:40,611 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 83.9MB. Free memory is still 40.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:14:40,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.25ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 78.1MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 04:14:40,611 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.45ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 76.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:14:40,612 INFO L158 Benchmark]: Boogie Preprocessor took 26.11ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 74.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:14:40,612 INFO L158 Benchmark]: RCFGBuilder took 963.45ms. Allocated memory is still 117.4MB. Free memory was 74.6MB in the beginning and 86.7MB in the end (delta: -12.1MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2024-11-14 04:14:40,613 INFO L158 Benchmark]: TraceAbstraction took 11230.87ms. Allocated memory was 117.4MB in the beginning and 528.5MB in the end (delta: 411.0MB). Free memory was 86.0MB in the beginning and 371.4MB in the end (delta: -285.4MB). Peak memory consumption was 122.9MB. Max. memory is 16.1GB. [2024-11-14 04:14:40,613 INFO L158 Benchmark]: Witness Printer took 113.71ms. Allocated memory is still 528.5MB. Free memory was 371.4MB in the beginning and 363.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 04:14:40,615 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.35ms. Allocated memory is still 83.9MB. Free memory is still 40.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.25ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 78.1MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.45ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 76.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.11ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 74.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 963.45ms. Allocated memory is still 117.4MB. Free memory was 74.6MB in the beginning and 86.7MB in the end (delta: -12.1MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11230.87ms. Allocated memory was 117.4MB in the beginning and 528.5MB in the end (delta: 411.0MB). Free memory was 86.0MB in the beginning and 371.4MB in the end (delta: -285.4MB). Peak memory consumption was 122.9MB. Max. memory is 16.1GB. * Witness Printer took 113.71ms. Allocated memory is still 528.5MB. Free memory was 371.4MB in the beginning and 363.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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: 125]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int t2_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int t2_st ; [L30] int m_i ; [L31] int t1_i ; [L32] int t2_i ; [L33] int M_E = 2; [L34] int T1_E = 2; [L35] int T2_E = 2; [L36] int E_M = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L43] int token ; [L45] int local ; [L610] int __retres1 ; [L614] CALL init_model() [L524] m_i = 1 [L525] t1_i = 1 [L526] t2_i = 1 [L614] RET init_model() [L615] CALL start_simulation() [L551] int kernel_st ; [L552] int tmp ; [L553] int tmp___0 ; [L557] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L558] FCALL update_channels() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L559] CALL init_threads() [L243] COND TRUE m_i == 1 [L244] m_st = 0 [L248] COND TRUE t1_i == 1 [L249] t1_st = 0 [L253] COND TRUE t2_i == 1 [L254] t2_st = 0 [L559] RET init_threads() [L560] CALL fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L356] COND FALSE !(M_E == 0) [L361] COND FALSE !(T1_E == 0) [L366] COND FALSE !(T2_E == 0) [L371] COND FALSE !(E_M == 0) [L376] COND FALSE !(E_1 == 0) [L381] COND FALSE !(E_2 == 0) [L560] RET fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L561] CALL activate_threads() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L178] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L188] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L190] return (__retres1); [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L197] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L207] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L209] return (__retres1); [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND FALSE !(\read(tmp___0)) [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L216] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L226] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L228] return (__retres1); [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) [L561] RET activate_threads() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L562] CALL reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L394] COND FALSE !(M_E == 1) [L399] COND FALSE !(T1_E == 1) [L404] COND FALSE !(T2_E == 1) [L409] COND FALSE !(E_M == 1) [L414] COND FALSE !(E_1 == 1) [L419] COND FALSE !(E_2 == 1) [L562] RET reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L565] COND TRUE 1 [L568] kernel_st = 1 [L569] CALL eval() [L289] int tmp ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L293] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L263] int __retres1 ; [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 [L284] return (__retres1); [L296] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp_ndt_2) [L322] t1_st = 1 [L323] CALL transmit1() [L106] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=0] [L117] COND TRUE 1 [L119] t1_pc = 1 [L120] t1_st = 2 [L323] RET transmit1() [L331] COND TRUE t2_st == 0 [L332] int tmp_ndt_3; [L333] tmp_ndt_3 = __VERIFIER_nondet_int() [L334] COND FALSE !(\read(tmp_ndt_3)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L293] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L263] int __retres1 ; [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 [L284] return (__retres1); [L296] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND TRUE \read(tmp_ndt_1) [L308] m_st = 1 [L309] CALL master() [L48] int tmp_var = __VERIFIER_nondet_int(); [L50] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=0] [L61] COND TRUE 1 [L64] token = __VERIFIER_nondet_int() [L65] local = token [L66] E_1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=2147483647] [L67] CALL immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L467] CALL activate_threads() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L178] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L188] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L190] return (__retres1); [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L197] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L198] COND TRUE E_1 == 1 [L199] __retres1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L209] return (__retres1); [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND TRUE \read(tmp___0) [L446] t1_st = 0 [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L216] COND FALSE !(t2_pc == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L226] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L228] return (__retres1); [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) [L467] RET activate_threads() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L67] RET immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=2147483647] [L68] E_1 = 2 [L69] m_pc = 1 [L70] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=2147483647] [L309] RET master() [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp_ndt_2) [L322] t1_st = 1 [L323] CALL transmit1() [L106] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L109] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L125] token += 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] - UnprovableResult [Line: 75]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 161]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 161]: 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, 98 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2072 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2043 mSDsluCounter, 3497 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1769 mSDsCounter, 385 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1221 IncrementalHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 385 mSolverCounterUnsat, 1728 mSDtfsCounter, 1221 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2566occurred in iteration=11, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 1085 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 893 NumberOfCodeBlocks, 893 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 803 ConstructedInterpolants, 0 QuantifiedInterpolants, 1538 SizeOfPredicates, 0 NumberOfNonLiveVariables, 479 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 163/165 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-14 04:14:40,652 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_788f263f-ddd0-402d-b79c-90198bc4e15e/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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)