./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.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_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/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_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/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_1bd6569d-41ce-41ef-80a5-4432367afea0/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 23ca06a4d1d66eab783b29fc3ce31114eee62eb7d17a2452b84e2d73b8d92cfa --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:09:08,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:09:08,494 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Overflow-32bit-Taipan_Default.epf [2024-11-14 03:09:08,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:09:08,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:09:08,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:09:08,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:09:08,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:09:08,530 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:09:08,530 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:09:08,531 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:09:08,531 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:09:08,532 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:09:08,532 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:09:08,532 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:09:08,532 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:09:08,533 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:09:08,533 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:09:08,533 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:09:08,533 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:09:08,533 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:09:08,533 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:09:08,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:09:08,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:09:08,534 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:09:08,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:09:08,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:09:08,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:09:08,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:09:08,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:09:08,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:09:08,535 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:09:08,535 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-14 03:09:08,535 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:09:08,535 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:09:08,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:09:08,536 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:09:08,536 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:09:08,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:09:08,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:09:08,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:09:08,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:09:08,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:09:08,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 03:09:08,536 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:09:08,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:09:08,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:09:08,536 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:09:08,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:09:08,537 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_1bd6569d-41ce-41ef-80a5-4432367afea0/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 -> 23ca06a4d1d66eab783b29fc3ce31114eee62eb7d17a2452b84e2d73b8d92cfa [2024-11-14 03:09:08,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:09:08,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:09:08,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:09:08,891 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:09:08,891 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:09:08,892 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c Unable to find full path for "g++" [2024-11-14 03:09:10,657 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:09:10,976 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:09:10,977 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c [2024-11-14 03:09:11,001 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/data/cf02790e3/58a666103bfc488db2e08f4dc82df8cc/FLAG2c2b67219 [2024-11-14 03:09:11,023 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/data/cf02790e3/58a666103bfc488db2e08f4dc82df8cc [2024-11-14 03:09:11,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:09:11,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:09:11,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:09:11,031 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:09:11,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:09:11,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:09:11" (1/1) ... [2024-11-14 03:09:11,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e4d9ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:11, skipping insertion in model container [2024-11-14 03:09:11,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:09:11" (1/1) ... [2024-11-14 03:09:11,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:09:11,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:09:11,298 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:09:11,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:09:11,356 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:09:11,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:11 WrapperNode [2024-11-14 03:09:11,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:09:11,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:09:11,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:09:11,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:09:11,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:11" (1/1) ... [2024-11-14 03:09:11,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:11" (1/1) ... [2024-11-14 03:09:11,414 INFO L138 Inliner]: procedures = 24, calls = 28, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 225 [2024-11-14 03:09:11,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:09:11,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:09:11,416 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:09:11,416 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:09:11,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:11" (1/1) ... [2024-11-14 03:09:11,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:11" (1/1) ... [2024-11-14 03:09:11,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:11" (1/1) ... [2024-11-14 03:09:11,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:11" (1/1) ... [2024-11-14 03:09:11,449 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:11" (1/1) ... [2024-11-14 03:09:11,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:11" (1/1) ... [2024-11-14 03:09:11,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:11" (1/1) ... [2024-11-14 03:09:11,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:11" (1/1) ... [2024-11-14 03:09:11,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:09:11,466 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:09:11,466 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:09:11,466 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:09:11,467 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:11" (1/1) ... [2024-11-14 03:09:11,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:09:11,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:09:11,502 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:09:11,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:09:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:09:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-14 03:09:11,528 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-14 03:09:11,529 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-14 03:09:11,529 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-14 03:09:11,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:09:11,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:09:11,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:09:11,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:09:11,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:09:11,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 03:09:11,530 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 03:09:11,640 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:09:11,642 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:09:12,157 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 03:09:12,158 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:09:12,597 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:09:12,597 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-14 03:09:12,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:09:12 BoogieIcfgContainer [2024-11-14 03:09:12,598 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:09:12,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:09:12,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:09:12,604 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:09:12,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:09:11" (1/3) ... [2024-11-14 03:09:12,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1081c0d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:09:12, skipping insertion in model container [2024-11-14 03:09:12,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:11" (2/3) ... [2024-11-14 03:09:12,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1081c0d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:09:12, skipping insertion in model container [2024-11-14 03:09:12,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:09:12" (3/3) ... [2024-11-14 03:09:12,607 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-symm.wvr.c [2024-11-14 03:09:12,623 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:09:12,625 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-symm.wvr.c that has 3 procedures, 65 locations, 1 initial locations, 4 loop locations, and 20 error locations. [2024-11-14 03:09:12,625 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 03:09:12,729 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-14 03:09:12,770 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 72 transitions, 158 flow [2024-11-14 03:09:12,926 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1136 states, 1052 states have (on average 2.832699619771863) internal successors, (2980), 1135 states have internal predecessors, (2980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:12,955 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:09:12,970 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;@38804f76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:09:12,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2024-11-14 03:09:12,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 1136 states, 1052 states have (on average 2.832699619771863) internal successors, (2980), 1135 states have internal predecessors, (2980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:12,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 03:09:12,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:12,982 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 03:09:12,982 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:09:12,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:12,988 INFO L85 PathProgramCache]: Analyzing trace with hash 730143, now seen corresponding path program 1 times [2024-11-14 03:09:12,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:09:12,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691015749] [2024-11-14 03:09:12,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:12,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:09:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:13,304 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 03:09:13,304 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:09:13,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691015749] [2024-11-14 03:09:13,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691015749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:09:13,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:09:13,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:09:13,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777376924] [2024-11-14 03:09:13,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:09:13,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:09:13,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:09:13,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:09:13,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:09:13,341 INFO L87 Difference]: Start difference. First operand has 1136 states, 1052 states have (on average 2.832699619771863) internal successors, (2980), 1135 states have internal predecessors, (2980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:13,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:09:13,575 INFO L93 Difference]: Finished difference Result 1146 states and 2992 transitions. [2024-11-14 03:09:13,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:09:13,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-14 03:09:13,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:09:13,598 INFO L225 Difference]: With dead ends: 1146 [2024-11-14 03:09:13,598 INFO L226 Difference]: Without dead ends: 1142 [2024-11-14 03:09:13,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:09:13,604 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:09:13,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 106 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:09:13,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2024-11-14 03:09:13,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1142. [2024-11-14 03:09:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 1058 states have (on average 2.824196597353497) internal successors, (2988), 1141 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 2988 transitions. [2024-11-14 03:09:13,750 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 2988 transitions. Word has length 3 [2024-11-14 03:09:13,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:09:13,750 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 2988 transitions. [2024-11-14 03:09:13,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:13,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 2988 transitions. [2024-11-14 03:09:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 03:09:13,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:13,751 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2024-11-14 03:09:13,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:09:13,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:09:13,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:13,752 INFO L85 PathProgramCache]: Analyzing trace with hash 277574166, now seen corresponding path program 1 times [2024-11-14 03:09:13,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:09:13,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611077329] [2024-11-14 03:09:13,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:13,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:09:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:09:13,942 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:09:13,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611077329] [2024-11-14 03:09:13,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611077329] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:09:13,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081289422] [2024-11-14 03:09:13,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:13,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:09:13,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:09:13,945 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:09:13,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:09:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:14,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:09:14,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:09:14,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:09:14,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:09:14,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081289422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:09:14,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:09:14,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-14 03:09:14,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144353978] [2024-11-14 03:09:14,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:09:14,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:09:14,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:09:14,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:09:14,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:09:14,103 INFO L87 Difference]: Start difference. First operand 1142 states and 2988 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:14,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:09:14,329 INFO L93 Difference]: Finished difference Result 1142 states and 2988 transitions. [2024-11-14 03:09:14,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:09:14,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-14 03:09:14,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:09:14,339 INFO L225 Difference]: With dead ends: 1142 [2024-11-14 03:09:14,339 INFO L226 Difference]: Without dead ends: 1140 [2024-11-14 03:09:14,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:09:14,343 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 15 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:09:14,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 160 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:09:14,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2024-11-14 03:09:14,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1140. [2024-11-14 03:09:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1058 states have (on average 2.8223062381852553) internal successors, (2986), 1139 states have internal predecessors, (2986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:14,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 2986 transitions. [2024-11-14 03:09:14,393 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 2986 transitions. Word has length 6 [2024-11-14 03:09:14,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:09:14,393 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 2986 transitions. [2024-11-14 03:09:14,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:14,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 2986 transitions. [2024-11-14 03:09:14,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 03:09:14,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:14,394 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2024-11-14 03:09:14,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 03:09:14,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:09:14,598 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:09:14,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:14,598 INFO L85 PathProgramCache]: Analyzing trace with hash 14865280, now seen corresponding path program 1 times [2024-11-14 03:09:14,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:09:14,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636013252] [2024-11-14 03:09:14,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:14,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:09:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:14,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:09:14,771 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:09:14,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636013252] [2024-11-14 03:09:14,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636013252] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:09:14,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090622998] [2024-11-14 03:09:14,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:14,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:09:14,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:09:14,774 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:09:14,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 03:09:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:14,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:09:14,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:09:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:09:14,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:09:14,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:09:14,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090622998] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:09:14,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1133095627] [2024-11-14 03:09:14,995 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:259) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:09:15,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:09:15,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-11-14 03:09:15,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154593212] [2024-11-14 03:09:15,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:09:15,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 03:09:15,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:09:15,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 03:09:15,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:09:15,004 INFO L87 Difference]: Start difference. First operand 1140 states and 2986 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:15,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:09:15,280 INFO L93 Difference]: Finished difference Result 1160 states and 3016 transitions. [2024-11-14 03:09:15,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 03:09:15,281 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-14 03:09:15,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:09:15,290 INFO L225 Difference]: With dead ends: 1160 [2024-11-14 03:09:15,291 INFO L226 Difference]: Without dead ends: 1158 [2024-11-14 03:09:15,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2024-11-14 03:09:15,294 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 26 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:09:15,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 236 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:09:15,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-14 03:09:15,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1158. [2024-11-14 03:09:15,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1076 states have (on average 2.7973977695167287) internal successors, (3010), 1157 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:15,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 3010 transitions. [2024-11-14 03:09:15,357 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 3010 transitions. Word has length 7 [2024-11-14 03:09:15,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:09:15,357 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 3010 transitions. [2024-11-14 03:09:15,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:15,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 3010 transitions. [2024-11-14 03:09:15,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 03:09:15,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:15,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:09:15,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-14 03:09:15,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:09:15,563 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:09:15,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:15,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1501726592, now seen corresponding path program 1 times [2024-11-14 03:09:15,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:09:15,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294971621] [2024-11-14 03:09:15,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:15,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:09:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:15,744 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 03:09:15,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:09:15,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294971621] [2024-11-14 03:09:15,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294971621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:09:15,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:09:15,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:09:15,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015152185] [2024-11-14 03:09:15,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:09:15,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:09:15,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:09:15,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:09:15,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:09:15,746 INFO L87 Difference]: Start difference. First operand 1158 states and 3010 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:15,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:09:15,934 INFO L93 Difference]: Finished difference Result 2618 states and 7029 transitions. [2024-11-14 03:09:15,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:09:15,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-14 03:09:15,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:09:15,946 INFO L225 Difference]: With dead ends: 2618 [2024-11-14 03:09:15,946 INFO L226 Difference]: Without dead ends: 1542 [2024-11-14 03:09:15,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:09:15,954 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 79 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:09:15,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 106 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:09:15,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2024-11-14 03:09:16,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1302. [2024-11-14 03:09:16,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1229 states have (on average 2.788445890968267) internal successors, (3427), 1301 states have internal predecessors, (3427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:16,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 3427 transitions. [2024-11-14 03:09:16,015 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 3427 transitions. Word has length 8 [2024-11-14 03:09:16,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:09:16,015 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 3427 transitions. [2024-11-14 03:09:16,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:16,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 3427 transitions. [2024-11-14 03:09:16,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 03:09:16,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:16,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:09:16,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:09:16,018 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:09:16,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:16,019 INFO L85 PathProgramCache]: Analyzing trace with hash -691115116, now seen corresponding path program 1 times [2024-11-14 03:09:16,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:09:16,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704757947] [2024-11-14 03:09:16,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:16,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:09:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:16,174 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 03:09:16,174 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:09:16,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704757947] [2024-11-14 03:09:16,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704757947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:09:16,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:09:16,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:09:16,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607348364] [2024-11-14 03:09:16,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:09:16,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:09:16,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:09:16,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:09:16,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:09:16,176 INFO L87 Difference]: Start difference. First operand 1302 states and 3427 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:16,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:09:16,287 INFO L93 Difference]: Finished difference Result 2587 states and 6832 transitions. [2024-11-14 03:09:16,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:09:16,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-14 03:09:16,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:09:16,299 INFO L225 Difference]: With dead ends: 2587 [2024-11-14 03:09:16,299 INFO L226 Difference]: Without dead ends: 1302 [2024-11-14 03:09:16,302 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 03:09:16,302 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:09:16,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 70 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:09:16,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2024-11-14 03:09:16,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2024-11-14 03:09:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1229 states have (on average 2.7868185516680226) internal successors, (3425), 1301 states have internal predecessors, (3425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 3425 transitions. [2024-11-14 03:09:16,358 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 3425 transitions. Word has length 9 [2024-11-14 03:09:16,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:09:16,360 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 3425 transitions. [2024-11-14 03:09:16,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:16,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 3425 transitions. [2024-11-14 03:09:16,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 03:09:16,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:16,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:09:16,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 03:09:16,363 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:09:16,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:16,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1908338256, now seen corresponding path program 1 times [2024-11-14 03:09:16,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:09:16,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376651660] [2024-11-14 03:09:16,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:16,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:09:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:09:16,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:09:16,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376651660] [2024-11-14 03:09:16,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376651660] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:09:16,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879306360] [2024-11-14 03:09:16,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:16,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:09:16,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:09:16,512 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:09:16,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 03:09:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:16,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 03:09:16,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:09:16,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:09:16,668 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:09:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:09:16,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879306360] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:09:16,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1865097058] [2024-11-14 03:09:16,736 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:09:16,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:09:16,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-11-14 03:09:16,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509944507] [2024-11-14 03:09:16,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:09:16,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:09:16,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:09:16,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:09:16,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:09:16,739 INFO L87 Difference]: Start difference. First operand 1302 states and 3425 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:16,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:09:16,935 INFO L93 Difference]: Finished difference Result 2587 states and 6829 transitions. [2024-11-14 03:09:16,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:09:16,936 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-14 03:09:16,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:09:16,946 INFO L225 Difference]: With dead ends: 2587 [2024-11-14 03:09:16,947 INFO L226 Difference]: Without dead ends: 1302 [2024-11-14 03:09:16,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-14 03:09:16,951 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 29 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:09:16,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 130 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:09:16,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2024-11-14 03:09:16,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2024-11-14 03:09:17,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1229 states have (on average 2.7835638730675347) internal successors, (3421), 1301 states have internal predecessors, (3421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 3421 transitions. [2024-11-14 03:09:17,013 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 3421 transitions. Word has length 15 [2024-11-14 03:09:17,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:09:17,013 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 3421 transitions. [2024-11-14 03:09:17,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:17,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 3421 transitions. [2024-11-14 03:09:17,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 03:09:17,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:17,014 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1] [2024-11-14 03:09:17,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 03:09:17,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-14 03:09:17,215 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:09:17,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:17,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1396388183, now seen corresponding path program 2 times [2024-11-14 03:09:17,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:09:17,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255416459] [2024-11-14 03:09:17,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:17,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:09:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:17,475 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:09:17,475 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:09:17,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255416459] [2024-11-14 03:09:17,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255416459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:09:17,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702477838] [2024-11-14 03:09:17,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:09:17,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:09:17,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:09:17,477 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:09:17,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 03:09:17,564 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-14 03:09:17,564 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:09:17,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:09:17,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:09:17,614 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:09:17,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:09:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:09:17,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702477838] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:09:17,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [430857233] [2024-11-14 03:09:17,671 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:259) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:09:17,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:09:17,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 2, 2] total 13 [2024-11-14 03:09:17,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272959472] [2024-11-14 03:09:17,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:09:17,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 03:09:17,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:09:17,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 03:09:17,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-14 03:09:17,674 INFO L87 Difference]: Start difference. First operand 1302 states and 3421 transitions. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:18,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:09:18,022 INFO L93 Difference]: Finished difference Result 1304 states and 3425 transitions. [2024-11-14 03:09:18,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 03:09:18,022 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-14 03:09:18,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:09:18,033 INFO L225 Difference]: With dead ends: 1304 [2024-11-14 03:09:18,033 INFO L226 Difference]: Without dead ends: 1302 [2024-11-14 03:09:18,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2024-11-14 03:09:18,034 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 64 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:09:18,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 248 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:09:18,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2024-11-14 03:09:18,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1290. [2024-11-14 03:09:18,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 1219 states have (on average 2.7949138638228055) internal successors, (3407), 1289 states have internal predecessors, (3407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:18,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 3407 transitions. [2024-11-14 03:09:18,099 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 3407 transitions. Word has length 16 [2024-11-14 03:09:18,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:09:18,099 INFO L471 AbstractCegarLoop]: Abstraction has 1290 states and 3407 transitions. [2024-11-14 03:09:18,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:18,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 3407 transitions. [2024-11-14 03:09:18,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 03:09:18,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:18,100 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:09:18,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-14 03:09:18,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:09:18,301 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:09:18,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:18,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1112521840, now seen corresponding path program 2 times [2024-11-14 03:09:18,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:09:18,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666815605] [2024-11-14 03:09:18,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:18,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:09:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:18,527 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 03:09:18,527 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:09:18,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666815605] [2024-11-14 03:09:18,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666815605] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:09:18,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162918267] [2024-11-14 03:09:18,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:09:18,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:09:18,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:09:18,530 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:09:18,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 03:09:18,644 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-14 03:09:18,644 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:09:18,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 03:09:18,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:09:18,814 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 03:09:18,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:09:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 03:09:18,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162918267] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:09:18,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [892654834] [2024-11-14 03:09:18,895 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:09:18,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:09:18,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-11-14 03:09:18,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680775846] [2024-11-14 03:09:18,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:09:18,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-14 03:09:18,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:09:18,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-14 03:09:18,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-11-14 03:09:18,896 INFO L87 Difference]: Start difference. First operand 1290 states and 3407 transitions. Second operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:19,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:09:19,176 INFO L93 Difference]: Finished difference Result 2581 states and 6818 transitions. [2024-11-14 03:09:19,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:09:19,178 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-14 03:09:19,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:09:19,188 INFO L225 Difference]: With dead ends: 2581 [2024-11-14 03:09:19,188 INFO L226 Difference]: Without dead ends: 1302 [2024-11-14 03:09:19,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2024-11-14 03:09:19,191 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 47 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:09:19,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 221 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:09:19,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2024-11-14 03:09:19,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2024-11-14 03:09:19,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1231 states have (on average 2.777416734362307) internal successors, (3419), 1301 states have internal predecessors, (3419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:19,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 3419 transitions. [2024-11-14 03:09:19,236 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 3419 transitions. Word has length 27 [2024-11-14 03:09:19,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:09:19,236 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 3419 transitions. [2024-11-14 03:09:19,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:19,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 3419 transitions. [2024-11-14 03:09:19,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 03:09:19,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:19,237 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:09:19,257 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 03:09:19,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-14 03:09:19,438 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:09:19,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:19,438 INFO L85 PathProgramCache]: Analyzing trace with hash -915970256, now seen corresponding path program 3 times [2024-11-14 03:09:19,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:09:19,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319714836] [2024-11-14 03:09:19,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:19,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:09:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:21,034 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:09:21,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:09:21,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319714836] [2024-11-14 03:09:21,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319714836] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:09:21,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326714067] [2024-11-14 03:09:21,034 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:09:21,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:09:21,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:09:21,036 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:09:21,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 03:09:21,174 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:09:21,174 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:09:21,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-14 03:09:21,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:09:21,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:09:21,319 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:09:21,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 11 [2024-11-14 03:09:21,415 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:09:21,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 11 [2024-11-14 03:09:21,502 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:09:21,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 11 [2024-11-14 03:09:21,606 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:09:21,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 11 [2024-11-14 03:09:21,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 03:09:21,722 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:09:21,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:09:24,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2024-11-14 03:09:24,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-11-14 03:09:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-14 03:09:24,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326714067] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:09:24,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [694463590] [2024-11-14 03:09:24,862 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:09:24,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:09:24,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 9] total 34 [2024-11-14 03:09:24,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919710736] [2024-11-14 03:09:24,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:09:24,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-14 03:09:24,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:09:24,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-14 03:09:24,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1032, Unknown=1, NotChecked=0, Total=1190 [2024-11-14 03:09:24,866 INFO L87 Difference]: Start difference. First operand 1302 states and 3419 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:26,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:09:26,112 INFO L93 Difference]: Finished difference Result 3050 states and 7984 transitions. [2024-11-14 03:09:26,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 03:09:26,113 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-14 03:09:26,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:09:26,132 INFO L225 Difference]: With dead ends: 3050 [2024-11-14 03:09:26,132 INFO L226 Difference]: Without dead ends: 3002 [2024-11-14 03:09:26,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=388, Invalid=1773, Unknown=1, NotChecked=0, Total=2162 [2024-11-14 03:09:26,135 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 292 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:09:26,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 756 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 03:09:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3002 states. [2024-11-14 03:09:26,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3002 to 1494. [2024-11-14 03:09:26,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1423 states have (on average 2.814476458186929) internal successors, (4005), 1493 states have internal predecessors, (4005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:26,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 4005 transitions. [2024-11-14 03:09:26,236 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 4005 transitions. Word has length 39 [2024-11-14 03:09:26,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:09:26,237 INFO L471 AbstractCegarLoop]: Abstraction has 1494 states and 4005 transitions. [2024-11-14 03:09:26,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 4005 transitions. [2024-11-14 03:09:26,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-14 03:09:26,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:26,243 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:09:26,263 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 03:09:26,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-14 03:09:26,448 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:09:26,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:26,449 INFO L85 PathProgramCache]: Analyzing trace with hash 974003539, now seen corresponding path program 1 times [2024-11-14 03:09:26,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:09:26,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34363401] [2024-11-14 03:09:26,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:26,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:09:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-14 03:09:26,554 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:09:26,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34363401] [2024-11-14 03:09:26,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34363401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:09:26,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:09:26,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:09:26,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013820452] [2024-11-14 03:09:26,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:09:26,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:09:26,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:09:26,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:09:26,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:09:26,556 INFO L87 Difference]: Start difference. First operand 1494 states and 4005 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:26,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:09:26,734 INFO L93 Difference]: Finished difference Result 3321 states and 9222 transitions. [2024-11-14 03:09:26,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:09:26,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-14 03:09:26,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:09:26,749 INFO L225 Difference]: With dead ends: 3321 [2024-11-14 03:09:26,749 INFO L226 Difference]: Without dead ends: 1982 [2024-11-14 03:09:26,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:09:26,752 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 64 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:09:26,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 119 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:09:26,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2024-11-14 03:09:26,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1677. [2024-11-14 03:09:26,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1677 states, 1614 states have (on average 2.8203221809169765) internal successors, (4552), 1676 states have internal predecessors, (4552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 4552 transitions. [2024-11-14 03:09:26,825 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 4552 transitions. Word has length 40 [2024-11-14 03:09:26,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:09:26,826 INFO L471 AbstractCegarLoop]: Abstraction has 1677 states and 4552 transitions. [2024-11-14 03:09:26,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:26,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 4552 transitions. [2024-11-14 03:09:26,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-14 03:09:26,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:26,827 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:09:26,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 03:09:26,828 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:09:26,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:26,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1669662152, now seen corresponding path program 1 times [2024-11-14 03:09:26,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:09:26,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986866015] [2024-11-14 03:09:26,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:26,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:09:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:28,076 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:09:28,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:09:28,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986866015] [2024-11-14 03:09:28,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986866015] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:09:28,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083384682] [2024-11-14 03:09:28,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:28,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:09:28,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:09:28,079 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:09:28,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 03:09:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:28,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-14 03:09:28,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:09:28,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:09:28,346 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:09:28,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:09:28,445 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:09:28,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:09:28,540 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:09:28,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:09:28,641 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:09:28,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:09:28,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-14 03:09:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:09:28,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:09:29,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-14 03:09:29,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2024-11-14 03:09:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-14 03:09:29,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083384682] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:09:29,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1162484314] [2024-11-14 03:09:29,823 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:09:29,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:09:29,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 9] total 34 [2024-11-14 03:09:29,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539705620] [2024-11-14 03:09:29,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:09:29,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-14 03:09:29,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:09:29,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-14 03:09:29,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1033, Unknown=0, NotChecked=0, Total=1190 [2024-11-14 03:09:29,829 INFO L87 Difference]: Start difference. First operand 1677 states and 4552 transitions. Second operand has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 35 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:31,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:09:31,161 INFO L93 Difference]: Finished difference Result 3050 states and 8156 transitions. [2024-11-14 03:09:31,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 03:09:31,162 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 35 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-14 03:09:31,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:09:31,184 INFO L225 Difference]: With dead ends: 3050 [2024-11-14 03:09:31,184 INFO L226 Difference]: Without dead ends: 2996 [2024-11-14 03:09:31,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=388, Invalid=1774, Unknown=0, NotChecked=0, Total=2162 [2024-11-14 03:09:31,187 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 357 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:09:31,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 852 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 03:09:31,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2024-11-14 03:09:31,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 1839. [2024-11-14 03:09:31,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1776 states have (on average 2.829954954954955) internal successors, (5026), 1838 states have internal predecessors, (5026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:31,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 5026 transitions. [2024-11-14 03:09:31,285 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 5026 transitions. Word has length 40 [2024-11-14 03:09:31,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:09:31,285 INFO L471 AbstractCegarLoop]: Abstraction has 1839 states and 5026 transitions. [2024-11-14 03:09:31,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 35 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 5026 transitions. [2024-11-14 03:09:31,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-14 03:09:31,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:31,287 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:09:31,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-14 03:09:31,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-14 03:09:31,488 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:09:31,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:31,488 INFO L85 PathProgramCache]: Analyzing trace with hash 129339450, now seen corresponding path program 1 times [2024-11-14 03:09:31,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:09:31,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961135494] [2024-11-14 03:09:31,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:31,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:09:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 4 proven. 42 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 03:09:32,711 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:09:32,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961135494] [2024-11-14 03:09:32,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961135494] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:09:32,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512766133] [2024-11-14 03:09:32,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:32,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:09:32,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:09:32,713 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:09:32,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 03:09:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:32,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-14 03:09:32,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:09:32,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:09:32,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:09:32,980 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:09:32,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 11 [2024-11-14 03:09:33,070 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:09:33,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 11 [2024-11-14 03:09:33,160 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:09:33,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 11 [2024-11-14 03:09:33,285 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:09:33,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 11 [2024-11-14 03:09:33,338 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:09:33,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:09:33,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:09:33,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:09:33,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:09:33,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:09:33,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:09:33,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 03:09:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:09:33,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:09:33,659 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_305) c_~o_0~0.base) c_~o_0~0.offset) 9223372039002259456)) is different from false [2024-11-14 03:09:33,709 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_174| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_174|) 0)) (< (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_174| v_ArrVal_305) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2024-11-14 03:10:10,856 INFO L349 Elim1Store]: treesize reduction 244, result has 20.0 percent of original size [2024-11-14 03:10:10,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 71 [2024-11-14 03:10:10,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:10:10,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2024-11-14 03:10:10,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 03:10:10,967 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 7 refuted. 2 times theorem prover too weak. 22 trivial. 26 not checked. [2024-11-14 03:10:10,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512766133] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:10:10,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1657193116] [2024-11-14 03:10:10,968 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:10:10,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:10:10,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 40 [2024-11-14 03:10:10,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027629208] [2024-11-14 03:10:10,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:10:10,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-14 03:10:10,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:10:10,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-14 03:10:10,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1352, Unknown=16, NotChecked=154, Total=1722 [2024-11-14 03:10:10,977 INFO L87 Difference]: Start difference. First operand 1839 states and 5026 transitions. Second operand has 42 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 41 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:10:13,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:10:13,621 INFO L93 Difference]: Finished difference Result 4248 states and 11595 transitions. [2024-11-14 03:10:13,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 03:10:13,622 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 41 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-14 03:10:13,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:10:13,654 INFO L225 Difference]: With dead ends: 4248 [2024-11-14 03:10:13,654 INFO L226 Difference]: Without dead ends: 4181 [2024-11-14 03:10:13,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 38.4s TimeCoverageRelationStatistics Valid=695, Invalid=3203, Unknown=16, NotChecked=246, Total=4160 [2024-11-14 03:10:13,658 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 303 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 1918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 426 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:10:13,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1063 Invalid, 1918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1455 Invalid, 0 Unknown, 426 Unchecked, 1.5s Time] [2024-11-14 03:10:13,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4181 states. [2024-11-14 03:10:13,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4181 to 2107. [2024-11-14 03:10:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2107 states, 2044 states have (on average 2.8732876712328768) internal successors, (5873), 2106 states have internal predecessors, (5873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:10:13,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 5873 transitions. [2024-11-14 03:10:13,773 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 5873 transitions. Word has length 41 [2024-11-14 03:10:13,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:10:13,774 INFO L471 AbstractCegarLoop]: Abstraction has 2107 states and 5873 transitions. [2024-11-14 03:10:13,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 41 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:10:13,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 5873 transitions. [2024-11-14 03:10:13,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-14 03:10:13,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:10:13,775 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:10:13,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 03:10:13,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-14 03:10:13,980 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:10:13,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:10:13,980 INFO L85 PathProgramCache]: Analyzing trace with hash 219918930, now seen corresponding path program 1 times [2024-11-14 03:10:13,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:10:13,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480190376] [2024-11-14 03:10:13,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:10:13,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:10:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:10:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 4 proven. 42 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 03:10:15,269 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:10:15,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480190376] [2024-11-14 03:10:15,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480190376] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:10:15,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066998551] [2024-11-14 03:10:15,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:10:15,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:10:15,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:10:15,271 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:10:15,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 03:10:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:10:15,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-14 03:10:15,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:10:15,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:10:15,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:10:15,549 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:10:15,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:10:15,646 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:10:15,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:10:15,753 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:10:15,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:10:15,855 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:10:15,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:10:15,905 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:10:15,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:10:15,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:10:15,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:10:15,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:10:15,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:10:16,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:10:16,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-14 03:10:16,206 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:10:16,206 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:10:16,418 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_176| Int) (v_ArrVal_368 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_176|) 0)) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_176| v_ArrVal_368) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2024-11-14 03:10:58,803 INFO L349 Elim1Store]: treesize reduction 244, result has 20.0 percent of original size [2024-11-14 03:10:58,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 73 [2024-11-14 03:10:58,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:10:58,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-11-14 03:10:58,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-14 03:10:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 20 refuted. 2 times theorem prover too weak. 22 trivial. 13 not checked. [2024-11-14 03:10:58,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066998551] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:10:58,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [16144784] [2024-11-14 03:10:58,920 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:10:58,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:10:58,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 41 [2024-11-14 03:10:58,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23507658] [2024-11-14 03:10:58,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:10:58,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 03:10:58,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:10:58,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 03:10:58,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1483, Unknown=25, NotChecked=80, Total=1806 [2024-11-14 03:10:58,923 INFO L87 Difference]: Start difference. First operand 2107 states and 5873 transitions. Second operand has 43 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:11:01,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:11:01,947 INFO L93 Difference]: Finished difference Result 3622 states and 9866 transitions. [2024-11-14 03:11:01,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-14 03:11:01,948 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-14 03:11:01,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:11:01,966 INFO L225 Difference]: With dead ends: 3622 [2024-11-14 03:11:01,966 INFO L226 Difference]: Without dead ends: 3498 [2024-11-14 03:11:01,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 43.8s TimeCoverageRelationStatistics Valid=701, Invalid=3567, Unknown=26, NotChecked=128, Total=4422 [2024-11-14 03:11:01,970 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 463 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 1762 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 2138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 326 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:11:01,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1289 Invalid, 2138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1762 Invalid, 0 Unknown, 326 Unchecked, 1.8s Time] [2024-11-14 03:11:01,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3498 states. [2024-11-14 03:11:02,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3498 to 2293. [2024-11-14 03:11:02,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2293 states, 2230 states have (on average 2.8542600896860986) internal successors, (6365), 2292 states have internal predecessors, (6365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:11:02,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 6365 transitions. [2024-11-14 03:11:02,091 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 6365 transitions. Word has length 41 [2024-11-14 03:11:02,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:11:02,092 INFO L471 AbstractCegarLoop]: Abstraction has 2293 states and 6365 transitions. [2024-11-14 03:11:02,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:11:02,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 6365 transitions. [2024-11-14 03:11:02,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-14 03:11:02,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:11:02,093 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:11:02,125 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 03:11:02,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:11:02,298 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:11:02,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:11:02,298 INFO L85 PathProgramCache]: Analyzing trace with hash -285475305, now seen corresponding path program 1 times [2024-11-14 03:11:02,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:11:02,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109526473] [2024-11-14 03:11:02,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:11:02,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:11:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:11:03,414 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:11:03,414 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:11:03,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109526473] [2024-11-14 03:11:03,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109526473] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:11:03,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678850513] [2024-11-14 03:11:03,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:11:03,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:11:03,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:11:03,417 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:11:03,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 03:11:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:11:03,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-14 03:11:03,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:11:03,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:11:03,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:11:03,718 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:11:03,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:11:03,842 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:11:03,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:11:03,966 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:11:03,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:11:04,095 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:11:04,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:11:04,162 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:11:04,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:11:04,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:11:04,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:11:04,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:11:04,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:11:04,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:11:04,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-14 03:11:04,374 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:11:04,374 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:11:04,571 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_430 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_430) c_~o_0~0.base) c_~o_0~0.offset) 4294967296))) is different from false [2024-11-14 03:11:55,976 INFO L349 Elim1Store]: treesize reduction 244, result has 20.0 percent of original size [2024-11-14 03:11:55,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 73 [2024-11-14 03:11:55,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:11:55,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-11-14 03:11:55,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-14 03:11:56,091 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 20 refuted. 2 times theorem prover too weak. 22 trivial. 13 not checked. [2024-11-14 03:11:56,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678850513] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:11:56,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [249213677] [2024-11-14 03:11:56,092 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:11:56,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:11:56,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2024-11-14 03:11:56,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180112588] [2024-11-14 03:11:56,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:11:56,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-14 03:11:56,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:11:56,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-14 03:11:56,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1398, Unknown=24, NotChecked=78, Total=1722 [2024-11-14 03:11:56,095 INFO L87 Difference]: Start difference. First operand 2293 states and 6365 transitions. Second operand has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 41 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:11:58,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:11:58,487 INFO L93 Difference]: Finished difference Result 4115 states and 11282 transitions. [2024-11-14 03:11:58,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 03:11:58,487 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 41 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-14 03:11:58,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:11:58,507 INFO L225 Difference]: With dead ends: 4115 [2024-11-14 03:11:58,507 INFO L226 Difference]: Without dead ends: 4042 [2024-11-14 03:11:58,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 52.7s TimeCoverageRelationStatistics Valid=734, Invalid=3406, Unknown=24, NotChecked=126, Total=4290 [2024-11-14 03:11:58,510 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 356 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 200 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:11:58,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1004 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1370 Invalid, 0 Unknown, 200 Unchecked, 1.3s Time] [2024-11-14 03:11:58,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4042 states. [2024-11-14 03:11:58,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4042 to 2512. [2024-11-14 03:11:58,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2512 states, 2449 states have (on average 2.8664761126990608) internal successors, (7020), 2511 states have internal predecessors, (7020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:11:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2512 states to 2512 states and 7020 transitions. [2024-11-14 03:11:58,645 INFO L78 Accepts]: Start accepts. Automaton has 2512 states and 7020 transitions. Word has length 42 [2024-11-14 03:11:58,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:11:58,645 INFO L471 AbstractCegarLoop]: Abstraction has 2512 states and 7020 transitions. [2024-11-14 03:11:58,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 41 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:11:58,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 7020 transitions. [2024-11-14 03:11:58,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-14 03:11:58,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:11:58,647 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:11:58,670 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 03:11:58,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:11:58,848 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:11:58,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:11:58,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1772446965, now seen corresponding path program 1 times [2024-11-14 03:11:58,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:11:58,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242883036] [2024-11-14 03:11:58,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:11:58,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:11:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:12:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:12:00,244 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:12:00,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242883036] [2024-11-14 03:12:00,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242883036] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:12:00,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210860700] [2024-11-14 03:12:00,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:12:00,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:12:00,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:12:00,247 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:12:00,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 03:12:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:12:00,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-14 03:12:00,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:12:00,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:12:00,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:12:00,551 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:12:00,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 11 [2024-11-14 03:12:00,662 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:12:00,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 11 [2024-11-14 03:12:00,793 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:12:00,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 11 [2024-11-14 03:12:00,914 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:12:00,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 11 [2024-11-14 03:12:00,978 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:12:00,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:12:01,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:12:01,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:12:01,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:12:01,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:12:01,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:12:01,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 03:12:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:12:01,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:12:53,322 INFO L349 Elim1Store]: treesize reduction 244, result has 20.0 percent of original size [2024-11-14 03:12:53,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 71 [2024-11-14 03:12:53,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:12:53,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2024-11-14 03:12:53,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 03:12:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 33 refuted. 2 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:12:53,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210860700] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:12:53,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [507291431] [2024-11-14 03:12:53,460 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:12:53,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:12:53,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 44 [2024-11-14 03:12:53,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032197654] [2024-11-14 03:12:53,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:12:53,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-14 03:12:53,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:12:53,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-14 03:12:53,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1777, Unknown=28, NotChecked=0, Total=2070 [2024-11-14 03:12:53,463 INFO L87 Difference]: Start difference. First operand 2512 states and 7020 transitions. Second operand has 46 states, 45 states have (on average 1.9555555555555555) internal successors, (88), 45 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:12:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:12:56,061 INFO L93 Difference]: Finished difference Result 3902 states and 10840 transitions. [2024-11-14 03:12:56,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-14 03:12:56,061 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.9555555555555555) internal successors, (88), 45 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-14 03:12:56,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:12:56,078 INFO L225 Difference]: With dead ends: 3902 [2024-11-14 03:12:56,078 INFO L226 Difference]: Without dead ends: 3834 [2024-11-14 03:12:56,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 53.4s TimeCoverageRelationStatistics Valid=772, Invalid=4030, Unknown=28, NotChecked=0, Total=4830 [2024-11-14 03:12:56,082 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 567 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:12:56,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1328 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-14 03:12:56,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3834 states. [2024-11-14 03:12:56,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3834 to 2988. [2024-11-14 03:12:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2988 states, 2925 states have (on average 2.8796581196581195) internal successors, (8423), 2987 states have internal predecessors, (8423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:12:56,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 8423 transitions. [2024-11-14 03:12:56,217 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 8423 transitions. Word has length 42 [2024-11-14 03:12:56,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:12:56,217 INFO L471 AbstractCegarLoop]: Abstraction has 2988 states and 8423 transitions. [2024-11-14 03:12:56,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.9555555555555555) internal successors, (88), 45 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:12:56,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 8423 transitions. [2024-11-14 03:12:56,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-14 03:12:56,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:12:56,218 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:12:56,242 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 03:12:56,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-14 03:12:56,419 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:12:56,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:12:56,420 INFO L85 PathProgramCache]: Analyzing trace with hash -259800068, now seen corresponding path program 1 times [2024-11-14 03:12:56,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:12:56,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261371095] [2024-11-14 03:12:56,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:12:56,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:12:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:12:57,531 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:12:57,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:12:57,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261371095] [2024-11-14 03:12:57,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261371095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:12:57,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056397804] [2024-11-14 03:12:57,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:12:57,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:12:57,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:12:57,534 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:12:57,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-14 03:12:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:12:57,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-14 03:12:57,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:12:57,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:12:57,840 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:12:57,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:12:57,932 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:12:57,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:12:58,010 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:12:58,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:12:58,095 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:12:58,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:12:58,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-14 03:12:58,324 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:12:58,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:12:58,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-14 03:12:58,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2024-11-14 03:12:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-14 03:12:58,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056397804] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:12:58,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [397438900] [2024-11-14 03:12:58,843 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:12:58,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:12:58,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 10] total 32 [2024-11-14 03:12:58,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365128425] [2024-11-14 03:12:58,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:12:58,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-14 03:12:58,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:12:58,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-14 03:12:58,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2024-11-14 03:12:58,847 INFO L87 Difference]: Start difference. First operand 2988 states and 8423 transitions. Second operand has 33 states, 32 states have (on average 1.96875) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:00,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:00,561 INFO L93 Difference]: Finished difference Result 5073 states and 14009 transitions. [2024-11-14 03:13:00,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 03:13:00,562 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-14 03:13:00,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:00,582 INFO L225 Difference]: With dead ends: 5073 [2024-11-14 03:13:00,582 INFO L226 Difference]: Without dead ends: 4899 [2024-11-14 03:13:00,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 72 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=389, Invalid=1963, Unknown=0, NotChecked=0, Total=2352 [2024-11-14 03:13:00,584 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 393 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:00,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 933 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 03:13:00,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4899 states. [2024-11-14 03:13:00,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4899 to 3249. [2024-11-14 03:13:00,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3249 states, 3186 states have (on average 2.8631512868801003) internal successors, (9122), 3248 states have internal predecessors, (9122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:00,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3249 states to 3249 states and 9122 transitions. [2024-11-14 03:13:00,731 INFO L78 Accepts]: Start accepts. Automaton has 3249 states and 9122 transitions. Word has length 43 [2024-11-14 03:13:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:00,731 INFO L471 AbstractCegarLoop]: Abstraction has 3249 states and 9122 transitions. [2024-11-14 03:13:00,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:00,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3249 states and 9122 transitions. [2024-11-14 03:13:00,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-14 03:13:00,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:00,734 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:13:00,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-14 03:13:00,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-14 03:13:00,934 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:13:00,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:00,935 INFO L85 PathProgramCache]: Analyzing trace with hash 888719732, now seen corresponding path program 1 times [2024-11-14 03:13:00,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:00,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731352227] [2024-11-14 03:13:00,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:00,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:01,013 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-14 03:13:01,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:01,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731352227] [2024-11-14 03:13:01,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731352227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:13:01,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:13:01,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:13:01,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522717520] [2024-11-14 03:13:01,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:13:01,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:13:01,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:01,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:13:01,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:13:01,016 INFO L87 Difference]: Start difference. First operand 3249 states and 9122 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:01,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:01,286 INFO L93 Difference]: Finished difference Result 3948 states and 10808 transitions. [2024-11-14 03:13:01,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:13:01,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-14 03:13:01,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:01,307 INFO L225 Difference]: With dead ends: 3948 [2024-11-14 03:13:01,308 INFO L226 Difference]: Without dead ends: 3800 [2024-11-14 03:13:01,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:13:01,310 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 66 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:01,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 137 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:13:01,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3800 states. [2024-11-14 03:13:01,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3800 to 3471. [2024-11-14 03:13:01,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3471 states, 3408 states have (on average 2.8491784037558685) internal successors, (9710), 3470 states have internal predecessors, (9710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 9710 transitions. [2024-11-14 03:13:01,514 INFO L78 Accepts]: Start accepts. Automaton has 3471 states and 9710 transitions. Word has length 43 [2024-11-14 03:13:01,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:01,514 INFO L471 AbstractCegarLoop]: Abstraction has 3471 states and 9710 transitions. [2024-11-14 03:13:01,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3471 states and 9710 transitions. [2024-11-14 03:13:01,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-14 03:13:01,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:01,517 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:13:01,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 03:13:01,517 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:13:01,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:01,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1836036824, now seen corresponding path program 1 times [2024-11-14 03:13:01,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:01,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332090409] [2024-11-14 03:13:01,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:01,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:01,589 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-14 03:13:01,590 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:01,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332090409] [2024-11-14 03:13:01,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332090409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:13:01,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:13:01,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:13:01,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766617611] [2024-11-14 03:13:01,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:13:01,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:13:01,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:01,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:13:01,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:13:01,591 INFO L87 Difference]: Start difference. First operand 3471 states and 9710 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:01,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:01,846 INFO L93 Difference]: Finished difference Result 3767 states and 10420 transitions. [2024-11-14 03:13:01,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:13:01,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-14 03:13:01,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:01,860 INFO L225 Difference]: With dead ends: 3767 [2024-11-14 03:13:01,860 INFO L226 Difference]: Without dead ends: 3689 [2024-11-14 03:13:01,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:13:01,862 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 65 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:01,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 94 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:13:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2024-11-14 03:13:01,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3393. [2024-11-14 03:13:01,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3393 states, 3331 states have (on average 2.829180426298409) internal successors, (9424), 3392 states have internal predecessors, (9424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:01,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3393 states to 3393 states and 9424 transitions. [2024-11-14 03:13:02,003 INFO L78 Accepts]: Start accepts. Automaton has 3393 states and 9424 transitions. Word has length 43 [2024-11-14 03:13:02,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:02,004 INFO L471 AbstractCegarLoop]: Abstraction has 3393 states and 9424 transitions. [2024-11-14 03:13:02,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:02,004 INFO L276 IsEmpty]: Start isEmpty. Operand 3393 states and 9424 transitions. [2024-11-14 03:13:02,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-14 03:13:02,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:02,005 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:13:02,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-14 03:13:02,006 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:13:02,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:02,006 INFO L85 PathProgramCache]: Analyzing trace with hash 536133306, now seen corresponding path program 1 times [2024-11-14 03:13:02,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:02,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769846477] [2024-11-14 03:13:02,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:02,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:02,945 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:13:02,945 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:02,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769846477] [2024-11-14 03:13:02,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769846477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:13:02,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107556] [2024-11-14 03:13:02,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:02,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:13:02,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:13:02,948 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:13:02,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-14 03:13:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:03,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-14 03:13:03,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:13:03,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:13:03,216 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:13:03,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 11 [2024-11-14 03:13:03,298 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:13:03,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 11 [2024-11-14 03:13:03,367 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:13:03,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 11 [2024-11-14 03:13:03,443 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 03:13:03,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 11 [2024-11-14 03:13:03,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 03:13:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:13:03,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:13:04,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-14 03:13:04,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-14 03:13:04,055 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-14 03:13:04,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107556] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:13:04,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2010429863] [2024-11-14 03:13:04,057 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:13:04,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:13:04,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 11] total 33 [2024-11-14 03:13:04,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542471440] [2024-11-14 03:13:04,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:13:04,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-14 03:13:04,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:04,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-14 03:13:04,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2024-11-14 03:13:04,058 INFO L87 Difference]: Start difference. First operand 3393 states and 9424 transitions. Second operand has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:05,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:05,660 INFO L93 Difference]: Finished difference Result 5206 states and 14412 transitions. [2024-11-14 03:13:05,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 03:13:05,660 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-14 03:13:05,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:05,674 INFO L225 Difference]: With dead ends: 5206 [2024-11-14 03:13:05,674 INFO L226 Difference]: Without dead ends: 5115 [2024-11-14 03:13:05,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 73 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=411, Invalid=2139, Unknown=0, NotChecked=0, Total=2550 [2024-11-14 03:13:05,677 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 508 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:05,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 1289 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 03:13:05,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5115 states. [2024-11-14 03:13:05,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5115 to 4030. [2024-11-14 03:13:05,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4030 states, 3968 states have (on average 2.8460181451612905) internal successors, (11293), 4029 states have internal predecessors, (11293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4030 states to 4030 states and 11293 transitions. [2024-11-14 03:13:05,922 INFO L78 Accepts]: Start accepts. Automaton has 4030 states and 11293 transitions. Word has length 44 [2024-11-14 03:13:05,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:05,923 INFO L471 AbstractCegarLoop]: Abstraction has 4030 states and 11293 transitions. [2024-11-14 03:13:05,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:05,923 INFO L276 IsEmpty]: Start isEmpty. Operand 4030 states and 11293 transitions. [2024-11-14 03:13:05,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-14 03:13:05,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:05,925 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:13:05,945 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-14 03:13:06,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:13:06,129 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:13:06,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:06,129 INFO L85 PathProgramCache]: Analyzing trace with hash -559735874, now seen corresponding path program 1 times [2024-11-14 03:13:06,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:06,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403008906] [2024-11-14 03:13:06,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:06,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-14 03:13:06,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:06,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403008906] [2024-11-14 03:13:06,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403008906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:13:06,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:13:06,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:13:06,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701253983] [2024-11-14 03:13:06,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:13:06,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:13:06,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:06,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:13:06,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:13:06,223 INFO L87 Difference]: Start difference. First operand 4030 states and 11293 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:06,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:06,487 INFO L93 Difference]: Finished difference Result 4842 states and 13266 transitions. [2024-11-14 03:13:06,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:13:06,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-14 03:13:06,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:06,502 INFO L225 Difference]: With dead ends: 4842 [2024-11-14 03:13:06,502 INFO L226 Difference]: Without dead ends: 4660 [2024-11-14 03:13:06,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:13:06,504 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 61 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:06,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 131 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:13:06,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4660 states. [2024-11-14 03:13:06,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4660 to 4303. [2024-11-14 03:13:06,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4303 states, 4241 states have (on average 2.833294034425843) internal successors, (12016), 4302 states have internal predecessors, (12016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:06,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4303 states to 4303 states and 12016 transitions. [2024-11-14 03:13:06,663 INFO L78 Accepts]: Start accepts. Automaton has 4303 states and 12016 transitions. Word has length 45 [2024-11-14 03:13:06,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:06,664 INFO L471 AbstractCegarLoop]: Abstraction has 4303 states and 12016 transitions. [2024-11-14 03:13:06,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:06,664 INFO L276 IsEmpty]: Start isEmpty. Operand 4303 states and 12016 transitions. [2024-11-14 03:13:06,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-14 03:13:06,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:06,665 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:13:06,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-14 03:13:06,665 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:13:06,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:06,666 INFO L85 PathProgramCache]: Analyzing trace with hash 387581218, now seen corresponding path program 1 times [2024-11-14 03:13:06,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:06,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325926464] [2024-11-14 03:13:06,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:06,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:06,733 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-14 03:13:06,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:06,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325926464] [2024-11-14 03:13:06,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325926464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:13:06,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:13:06,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:13:06,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013683658] [2024-11-14 03:13:06,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:13:06,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:13:06,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:06,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:13:06,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:13:06,735 INFO L87 Difference]: Start difference. First operand 4303 states and 12016 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:07,028 INFO L93 Difference]: Finished difference Result 4667 states and 12889 transitions. [2024-11-14 03:13:07,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:13:07,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-14 03:13:07,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:07,044 INFO L225 Difference]: With dead ends: 4667 [2024-11-14 03:13:07,044 INFO L226 Difference]: Without dead ends: 4562 [2024-11-14 03:13:07,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:13:07,049 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 61 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:07,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 89 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:13:07,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4562 states. [2024-11-14 03:13:07,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4562 to 4198. [2024-11-14 03:13:07,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4198 states, 4138 states have (on average 2.8117448042532622) internal successors, (11635), 4197 states have internal predecessors, (11635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:07,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4198 states to 4198 states and 11635 transitions. [2024-11-14 03:13:07,221 INFO L78 Accepts]: Start accepts. Automaton has 4198 states and 11635 transitions. Word has length 45 [2024-11-14 03:13:07,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:07,221 INFO L471 AbstractCegarLoop]: Abstraction has 4198 states and 11635 transitions. [2024-11-14 03:13:07,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:07,222 INFO L276 IsEmpty]: Start isEmpty. Operand 4198 states and 11635 transitions. [2024-11-14 03:13:07,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-14 03:13:07,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:07,226 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:13:07,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-14 03:13:07,226 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:13:07,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:07,226 INFO L85 PathProgramCache]: Analyzing trace with hash 395577396, now seen corresponding path program 1 times [2024-11-14 03:13:07,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:07,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683164736] [2024-11-14 03:13:07,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:07,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:08,422 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-14 03:13:08,422 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:08,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683164736] [2024-11-14 03:13:08,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683164736] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:13:08,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709646917] [2024-11-14 03:13:08,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:08,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:13:08,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:13:08,424 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:13:08,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-14 03:13:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:08,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-14 03:13:08,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:13:08,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:13:08,758 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:13:08,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:13:08,857 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:13:08,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:13:08,939 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:13:08,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:13:09,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-14 03:13:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:13:09,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:13:09,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-14 03:13:09,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2024-11-14 03:13:10,002 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-14 03:13:10,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709646917] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:13:10,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [978500545] [2024-11-14 03:13:10,003 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:13:10,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:13:10,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 13] total 43 [2024-11-14 03:13:10,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090051710] [2024-11-14 03:13:10,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:13:10,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-14 03:13:10,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:10,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-14 03:13:10,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1728, Unknown=0, NotChecked=0, Total=1892 [2024-11-14 03:13:10,006 INFO L87 Difference]: Start difference. First operand 4198 states and 11635 transitions. Second operand has 44 states, 43 states have (on average 2.186046511627907) internal successors, (94), 44 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:13,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:13,283 INFO L93 Difference]: Finished difference Result 8018 states and 21674 transitions. [2024-11-14 03:13:13,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 03:13:13,284 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.186046511627907) internal successors, (94), 44 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-14 03:13:13,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:13,300 INFO L225 Difference]: With dead ends: 8018 [2024-11-14 03:13:13,300 INFO L226 Difference]: Without dead ends: 7926 [2024-11-14 03:13:13,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=388, Invalid=3152, Unknown=0, NotChecked=0, Total=3540 [2024-11-14 03:13:13,306 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 541 mSDsluCounter, 2708 mSDsCounter, 0 mSdLazyCounter, 3490 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 2823 SdHoareTripleChecker+Invalid, 3553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:13,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 2823 Invalid, 3553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3490 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-14 03:13:13,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7926 states. [2024-11-14 03:13:13,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7926 to 4566. [2024-11-14 03:13:13,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4566 states, 4506 states have (on average 2.8373280071016422) internal successors, (12785), 4565 states have internal predecessors, (12785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:13,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4566 states to 4566 states and 12785 transitions. [2024-11-14 03:13:13,647 INFO L78 Accepts]: Start accepts. Automaton has 4566 states and 12785 transitions. Word has length 48 [2024-11-14 03:13:13,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:13,651 INFO L471 AbstractCegarLoop]: Abstraction has 4566 states and 12785 transitions. [2024-11-14 03:13:13,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.186046511627907) internal successors, (94), 44 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:13,651 INFO L276 IsEmpty]: Start isEmpty. Operand 4566 states and 12785 transitions. [2024-11-14 03:13:13,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-14 03:13:13,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:13,653 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:13:13,698 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-14 03:13:13,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-14 03:13:13,858 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:13:13,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:13,858 INFO L85 PathProgramCache]: Analyzing trace with hash -622033596, now seen corresponding path program 1 times [2024-11-14 03:13:13,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:13,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079350885] [2024-11-14 03:13:13,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:13,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-14 03:13:15,062 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:15,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079350885] [2024-11-14 03:13:15,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079350885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:13:15,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133502094] [2024-11-14 03:13:15,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:15,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:13:15,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:13:15,064 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:13:15,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-14 03:13:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:15,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-14 03:13:15,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:13:15,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:13:15,362 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:13:15,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-11-14 03:13:15,458 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:13:15,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-11-14 03:13:15,553 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:13:15,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-11-14 03:13:15,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-14 03:13:15,781 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:13:15,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:13:33,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2024-11-14 03:13:33,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 966 treesize of output 950 [2024-11-14 03:13:33,741 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 5 proven. 32 refuted. 2 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:13:33,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133502094] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:13:33,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1830268037] [2024-11-14 03:13:33,742 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:13:33,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:13:33,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 16] total 46 [2024-11-14 03:13:33,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856945755] [2024-11-14 03:13:33,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:13:33,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-14 03:13:33,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:33,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-14 03:13:33,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1966, Unknown=11, NotChecked=0, Total=2162 [2024-11-14 03:13:33,745 INFO L87 Difference]: Start difference. First operand 4566 states and 12785 transitions. Second operand has 47 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 47 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:37,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:37,447 INFO L93 Difference]: Finished difference Result 7466 states and 20216 transitions. [2024-11-14 03:13:37,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-14 03:13:37,448 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 47 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-14 03:13:37,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:37,462 INFO L225 Difference]: With dead ends: 7466 [2024-11-14 03:13:37,462 INFO L226 Difference]: Without dead ends: 7374 [2024-11-14 03:13:37,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=410, Invalid=3361, Unknown=11, NotChecked=0, Total=3782 [2024-11-14 03:13:37,465 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 367 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 3344 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 2625 SdHoareTripleChecker+Invalid, 3413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:37,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 2625 Invalid, 3413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3344 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-14 03:13:37,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7374 states. [2024-11-14 03:13:37,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7374 to 4842. [2024-11-14 03:13:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4842 states, 4782 states have (on average 2.8452530322040985) internal successors, (13606), 4841 states have internal predecessors, (13606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:37,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4842 states to 4842 states and 13606 transitions. [2024-11-14 03:13:37,712 INFO L78 Accepts]: Start accepts. Automaton has 4842 states and 13606 transitions. Word has length 49 [2024-11-14 03:13:37,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:37,712 INFO L471 AbstractCegarLoop]: Abstraction has 4842 states and 13606 transitions. [2024-11-14 03:13:37,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 47 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:37,713 INFO L276 IsEmpty]: Start isEmpty. Operand 4842 states and 13606 transitions. [2024-11-14 03:13:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-14 03:13:37,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:37,714 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:13:37,729 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-14 03:13:37,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:13:37,915 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:13:37,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:37,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1430232579, now seen corresponding path program 1 times [2024-11-14 03:13:37,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:37,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184911541] [2024-11-14 03:13:37,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:37,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:39,136 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 03:13:39,136 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:39,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184911541] [2024-11-14 03:13:39,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184911541] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:13:39,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199870451] [2024-11-14 03:13:39,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:39,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:13:39,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:13:39,140 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:13:39,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-14 03:13:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:39,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-14 03:13:39,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:13:39,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:13:39,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:13:39,552 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:13:39,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:13:39,669 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:13:39,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:13:39,758 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:13:39,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:13:39,802 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:13:39,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:13:39,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:13:39,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:13:39,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:13:39,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:13:39,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:13:39,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-14 03:13:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 9 proven. 41 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:13:39,976 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:13:40,151 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_868 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_868) c_~o_0~0.base) (+ c_~o_0~0.offset 4)) 9223372039002259456)) is different from false [2024-11-14 03:14:22,196 INFO L349 Elim1Store]: treesize reduction 139, result has 26.1 percent of original size [2024-11-14 03:14:22,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 61 [2024-11-14 03:14:22,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:14:22,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2024-11-14 03:14:22,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:14:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 30 refuted. 1 times theorem prover too weak. 22 trivial. 13 not checked. [2024-11-14 03:14:22,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199870451] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:14:22,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1122028034] [2024-11-14 03:14:22,529 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:14:22,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:14:22,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 42 [2024-11-14 03:14:22,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373752484] [2024-11-14 03:14:22,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:14:22,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-14 03:14:22,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:14:22,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-14 03:14:22,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1585, Unknown=21, NotChecked=82, Total=1892 [2024-11-14 03:14:22,538 INFO L87 Difference]: Start difference. First operand 4842 states and 13606 transitions. Second operand has 44 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 43 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:14:26,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:14:26,299 INFO L93 Difference]: Finished difference Result 9105 states and 25044 transitions. [2024-11-14 03:14:26,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-14 03:14:26,299 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 43 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-14 03:14:26,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:14:26,323 INFO L225 Difference]: With dead ends: 9105 [2024-11-14 03:14:26,323 INFO L226 Difference]: Without dead ends: 9000 [2024-11-14 03:14:26,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 43.6s TimeCoverageRelationStatistics Valid=527, Invalid=3488, Unknown=21, NotChecked=124, Total=4160 [2024-11-14 03:14:26,326 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 495 mSDsluCounter, 2105 mSDsCounter, 0 mSdLazyCounter, 2645 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 3015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 327 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:14:26,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 2220 Invalid, 3015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2645 Invalid, 0 Unknown, 327 Unchecked, 2.5s Time] [2024-11-14 03:14:26,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9000 states. [2024-11-14 03:14:26,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9000 to 5262. [2024-11-14 03:14:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5262 states, 5202 states have (on average 2.8713956170703576) internal successors, (14937), 5261 states have internal predecessors, (14937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:14:26,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5262 states to 5262 states and 14937 transitions. [2024-11-14 03:14:26,663 INFO L78 Accepts]: Start accepts. Automaton has 5262 states and 14937 transitions. Word has length 50 [2024-11-14 03:14:26,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:14:26,664 INFO L471 AbstractCegarLoop]: Abstraction has 5262 states and 14937 transitions. [2024-11-14 03:14:26,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 43 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:14:26,664 INFO L276 IsEmpty]: Start isEmpty. Operand 5262 states and 14937 transitions. [2024-11-14 03:14:26,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-14 03:14:26,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:14:26,666 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:14:26,692 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-14 03:14:26,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:14:26,866 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:14:26,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:14:26,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2103172522, now seen corresponding path program 1 times [2024-11-14 03:14:26,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:14:26,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433278572] [2024-11-14 03:14:26,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:14:26,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:14:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:14:28,235 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 3 proven. 49 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 03:14:28,235 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:14:28,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433278572] [2024-11-14 03:14:28,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433278572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:14:28,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794469081] [2024-11-14 03:14:28,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:14:28,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:14:28,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:14:28,238 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:14:28,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-14 03:14:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:14:28,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-14 03:14:28,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:14:28,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:14:28,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:14:28,644 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:14:28,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-11-14 03:14:28,760 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:14:28,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-11-14 03:14:28,871 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:14:28,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-11-14 03:14:28,935 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:14:28,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:14:28,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:14:28,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:14:28,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:14:29,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:14:29,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:14:29,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-14 03:14:29,266 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 45 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:14:29,267 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:15:05,281 INFO L349 Elim1Store]: treesize reduction 139, result has 26.1 percent of original size [2024-11-14 03:15:05,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 63 [2024-11-14 03:15:05,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:15:05,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2024-11-14 03:15:05,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:15:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 7 proven. 47 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:15:05,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794469081] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:15:05,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1828510243] [2024-11-14 03:15:05,531 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:15:05,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:15:05,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 42 [2024-11-14 03:15:05,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033465394] [2024-11-14 03:15:05,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:15:05,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-14 03:15:05,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:15:05,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-14 03:15:05,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1662, Unknown=28, NotChecked=0, Total=1892 [2024-11-14 03:15:05,535 INFO L87 Difference]: Start difference. First operand 5262 states and 14937 transitions. Second operand has 44 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:15:10,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:15:10,117 INFO L93 Difference]: Finished difference Result 8018 states and 22034 transitions. [2024-11-14 03:15:10,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-14 03:15:10,118 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-14 03:15:10,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:15:10,136 INFO L225 Difference]: With dead ends: 8018 [2024-11-14 03:15:10,137 INFO L226 Difference]: Without dead ends: 7918 [2024-11-14 03:15:10,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1247 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=562, Invalid=4100, Unknown=30, NotChecked=0, Total=4692 [2024-11-14 03:15:10,139 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 572 mSDsluCounter, 2654 mSDsCounter, 0 mSdLazyCounter, 3448 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 2781 SdHoareTripleChecker+Invalid, 3484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:15:10,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 2781 Invalid, 3484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3448 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-14 03:15:10,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7918 states. [2024-11-14 03:15:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7918 to 5562. [2024-11-14 03:15:10,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5562 states, 5502 states have (on average 2.86041439476554) internal successors, (15738), 5561 states have internal predecessors, (15738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:15:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5562 states to 5562 states and 15738 transitions. [2024-11-14 03:15:10,355 INFO L78 Accepts]: Start accepts. Automaton has 5562 states and 15738 transitions. Word has length 50 [2024-11-14 03:15:10,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:15:10,356 INFO L471 AbstractCegarLoop]: Abstraction has 5562 states and 15738 transitions. [2024-11-14 03:15:10,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:15:10,356 INFO L276 IsEmpty]: Start isEmpty. Operand 5562 states and 15738 transitions. [2024-11-14 03:15:10,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-14 03:15:10,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:15:10,359 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:15:10,380 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-14 03:15:10,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:15:10,559 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:15:10,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:15:10,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1387506030, now seen corresponding path program 1 times [2024-11-14 03:15:10,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:15:10,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538141743] [2024-11-14 03:15:10,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:15:10,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:15:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:15:11,626 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 3 proven. 47 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 03:15:11,627 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:15:11,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538141743] [2024-11-14 03:15:11,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538141743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:15:11,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580575516] [2024-11-14 03:15:11,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:15:11,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:15:11,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:15:11,629 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:15:11,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-14 03:15:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:15:11,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-14 03:15:11,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:15:11,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:15:11,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:15:11,936 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:15:11,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-11-14 03:15:12,027 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:15:12,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-11-14 03:15:12,161 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:15:12,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-11-14 03:15:12,186 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:15:12,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:15:12,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:15:12,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:15:12,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:15:12,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:15:12,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:15:12,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-14 03:15:12,402 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 9 proven. 43 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:15:12,402 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:15:12,700 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_194| Int)) (or (< 0 (+ 4294967296 (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_194| v_ArrVal_989) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_194|) 0)))) is different from false [2024-11-14 03:15:35,929 INFO L349 Elim1Store]: treesize reduction 139, result has 26.1 percent of original size [2024-11-14 03:15:35,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 63 [2024-11-14 03:15:35,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:15:35,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2024-11-14 03:15:35,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:15:36,160 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 22 trivial. 13 not checked. [2024-11-14 03:15:36,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580575516] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:15:36,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1915431663] [2024-11-14 03:15:36,161 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:15:36,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:15:36,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 35 [2024-11-14 03:15:36,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226875396] [2024-11-14 03:15:36,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:15:36,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-14 03:15:36,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:15:36,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-14 03:15:36,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1114, Unknown=11, NotChecked=68, Total=1332 [2024-11-14 03:15:36,163 INFO L87 Difference]: Start difference. First operand 5562 states and 15738 transitions. Second operand has 37 states, 36 states have (on average 2.5) internal successors, (90), 36 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:15:38,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:15:38,937 INFO L93 Difference]: Finished difference Result 8961 states and 24606 transitions. [2024-11-14 03:15:38,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-14 03:15:38,938 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.5) internal successors, (90), 36 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-14 03:15:38,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:15:38,962 INFO L225 Difference]: With dead ends: 8961 [2024-11-14 03:15:38,963 INFO L226 Difference]: Without dead ends: 8850 [2024-11-14 03:15:38,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=408, Invalid=2665, Unknown=11, NotChecked=108, Total=3192 [2024-11-14 03:15:38,967 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 373 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 2018 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 293 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:15:38,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1574 Invalid, 2349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2018 Invalid, 0 Unknown, 293 Unchecked, 1.7s Time] [2024-11-14 03:15:38,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8850 states. [2024-11-14 03:15:39,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8850 to 5895. [2024-11-14 03:15:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5895 states, 5835 states have (on average 2.8688946015424164) internal successors, (16740), 5894 states have internal predecessors, (16740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:15:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5895 states to 5895 states and 16740 transitions. [2024-11-14 03:15:39,286 INFO L78 Accepts]: Start accepts. Automaton has 5895 states and 16740 transitions. Word has length 51 [2024-11-14 03:15:39,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:15:39,286 INFO L471 AbstractCegarLoop]: Abstraction has 5895 states and 16740 transitions. [2024-11-14 03:15:39,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.5) internal successors, (90), 36 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:15:39,287 INFO L276 IsEmpty]: Start isEmpty. Operand 5895 states and 16740 transitions. [2024-11-14 03:15:39,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-14 03:15:39,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:15:39,289 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:15:39,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-14 03:15:39,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:15:39,489 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:15:39,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:15:39,490 INFO L85 PathProgramCache]: Analyzing trace with hash -773837945, now seen corresponding path program 1 times [2024-11-14 03:15:39,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:15:39,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559451179] [2024-11-14 03:15:39,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:15:39,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:15:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:15:40,681 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 7 proven. 48 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:15:40,682 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:15:40,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559451179] [2024-11-14 03:15:40,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559451179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:15:40,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994745801] [2024-11-14 03:15:40,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:15:40,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:15:40,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:15:40,684 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:15:40,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-14 03:15:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:15:40,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-14 03:15:40,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:15:40,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:15:40,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:15:40,916 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:15:40,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:15:40,960 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:15:40,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:15:41,024 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:15:41,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:15:41,045 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:15:41,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:15:41,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:15:41,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:15:41,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:15:41,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:15:41,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:15:41,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-14 03:15:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:15:41,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:15:41,463 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1049) c_~o_0~0.base) (+ c_~o_0~0.offset 4)) 2147483648)) is different from false [2024-11-14 03:16:10,870 INFO L349 Elim1Store]: treesize reduction 139, result has 26.1 percent of original size [2024-11-14 03:16:10,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 61 [2024-11-14 03:16:10,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:16:10,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2024-11-14 03:16:10,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:16:11,113 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 22 trivial. 13 not checked. [2024-11-14 03:16:11,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994745801] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:16:11,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [771725321] [2024-11-14 03:16:11,114 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:16:11,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:16:11,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 37 [2024-11-14 03:16:11,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141213873] [2024-11-14 03:16:11,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:16:11,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-14 03:16:11,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:16:11,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-14 03:16:11,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1250, Unknown=14, NotChecked=72, Total=1482 [2024-11-14 03:16:11,116 INFO L87 Difference]: Start difference. First operand 5895 states and 16740 transitions. Second operand has 39 states, 38 states have (on average 2.263157894736842) internal successors, (86), 38 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:15,255 INFO L93 Difference]: Finished difference Result 8077 states and 22204 transitions. [2024-11-14 03:16:15,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-14 03:16:15,256 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.263157894736842) internal successors, (86), 38 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-14 03:16:15,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:15,278 INFO L225 Difference]: With dead ends: 8077 [2024-11-14 03:16:15,278 INFO L226 Difference]: Without dead ends: 7971 [2024-11-14 03:16:15,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=482, Invalid=3540, Unknown=14, NotChecked=124, Total=4160 [2024-11-14 03:16:15,282 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 697 mSDsluCounter, 2222 mSDsCounter, 0 mSdLazyCounter, 2861 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 2363 SdHoareTripleChecker+Invalid, 3360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 452 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:15,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 2363 Invalid, 3360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2861 Invalid, 0 Unknown, 452 Unchecked, 2.6s Time] [2024-11-14 03:16:15,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7971 states. [2024-11-14 03:16:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7971 to 6107. [2024-11-14 03:16:15,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6107 states, 6047 states have (on average 2.878782867537622) internal successors, (17408), 6106 states have internal predecessors, (17408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:15,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6107 states to 6107 states and 17408 transitions. [2024-11-14 03:16:15,615 INFO L78 Accepts]: Start accepts. Automaton has 6107 states and 17408 transitions. Word has length 51 [2024-11-14 03:16:15,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:15,615 INFO L471 AbstractCegarLoop]: Abstraction has 6107 states and 17408 transitions. [2024-11-14 03:16:15,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.263157894736842) internal successors, (86), 38 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:15,615 INFO L276 IsEmpty]: Start isEmpty. Operand 6107 states and 17408 transitions. [2024-11-14 03:16:15,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-14 03:16:15,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:15,618 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:16:15,644 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-14 03:16:15,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-14 03:16:15,819 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:16:15,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:15,819 INFO L85 PathProgramCache]: Analyzing trace with hash 63013765, now seen corresponding path program 1 times [2024-11-14 03:16:15,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:15,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186796990] [2024-11-14 03:16:15,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:15,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:17,365 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-14 03:16:17,365 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:17,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186796990] [2024-11-14 03:16:17,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186796990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:16:17,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018482544] [2024-11-14 03:16:17,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:17,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:16:17,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:16:17,368 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:16:17,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-14 03:16:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:17,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-14 03:16:17,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:16:17,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:16:17,761 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:16:17,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-11-14 03:16:17,874 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:16:17,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-11-14 03:16:17,986 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:16:17,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-11-14 03:16:18,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-14 03:16:18,447 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:16:18,447 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:16:19,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-14 03:16:19,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-14 03:16:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-14 03:16:19,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018482544] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:16:19,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1666274282] [2024-11-14 03:16:19,150 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:16:19,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:16:19,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 14] total 41 [2024-11-14 03:16:19,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245683909] [2024-11-14 03:16:19,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:16:19,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-14 03:16:19,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:16:19,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-14 03:16:19,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1582, Unknown=0, NotChecked=0, Total=1722 [2024-11-14 03:16:19,151 INFO L87 Difference]: Start difference. First operand 6107 states and 17408 transitions. Second operand has 42 states, 41 states have (on average 2.317073170731707) internal successors, (95), 42 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:23,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:23,039 INFO L93 Difference]: Finished difference Result 9170 states and 25392 transitions. [2024-11-14 03:16:23,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 03:16:23,040 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.317073170731707) internal successors, (95), 42 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-14 03:16:23,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:23,063 INFO L225 Difference]: With dead ends: 9170 [2024-11-14 03:16:23,064 INFO L226 Difference]: Without dead ends: 9055 [2024-11-14 03:16:23,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 87 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=396, Invalid=3386, Unknown=0, NotChecked=0, Total=3782 [2024-11-14 03:16:23,067 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 738 mSDsluCounter, 2024 mSDsCounter, 0 mSdLazyCounter, 2647 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 2151 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:23,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 2151 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2647 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-14 03:16:23,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9055 states. [2024-11-14 03:16:23,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9055 to 6452. [2024-11-14 03:16:23,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6452 states, 6392 states have (on average 2.86842928660826) internal successors, (18335), 6451 states have internal predecessors, (18335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:23,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6452 states to 6452 states and 18335 transitions. [2024-11-14 03:16:23,369 INFO L78 Accepts]: Start accepts. Automaton has 6452 states and 18335 transitions. Word has length 52 [2024-11-14 03:16:23,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:23,369 INFO L471 AbstractCegarLoop]: Abstraction has 6452 states and 18335 transitions. [2024-11-14 03:16:23,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.317073170731707) internal successors, (95), 42 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:23,370 INFO L276 IsEmpty]: Start isEmpty. Operand 6452 states and 18335 transitions. [2024-11-14 03:16:23,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-14 03:16:23,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:23,372 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:16:23,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-14 03:16:23,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-14 03:16:23,573 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:16:23,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:23,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1780828280, now seen corresponding path program 1 times [2024-11-14 03:16:23,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:23,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810213916] [2024-11-14 03:16:23,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:23,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:23,681 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-14 03:16:23,681 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:23,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810213916] [2024-11-14 03:16:23,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810213916] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:16:23,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715478764] [2024-11-14 03:16:23,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:23,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:16:23,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:16:23,685 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:16:23,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-14 03:16:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:23,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:16:23,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:16:24,009 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-14 03:16:24,009 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:16:24,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715478764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:16:24,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:16:24,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-14 03:16:24,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690779649] [2024-11-14 03:16:24,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:16:24,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:16:24,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:16:24,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:16:24,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:16:24,010 INFO L87 Difference]: Start difference. First operand 6452 states and 18335 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:24,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:24,763 INFO L93 Difference]: Finished difference Result 6822 states and 19068 transitions. [2024-11-14 03:16:24,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:16:24,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-14 03:16:24,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:24,781 INFO L225 Difference]: With dead ends: 6822 [2024-11-14 03:16:24,782 INFO L226 Difference]: Without dead ends: 6710 [2024-11-14 03:16:24,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:16:24,785 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 132 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:24,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 233 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:16:24,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6710 states. [2024-11-14 03:16:25,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6710 to 6340. [2024-11-14 03:16:25,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6340 states, 6288 states have (on average 2.868320610687023) internal successors, (18036), 6339 states have internal predecessors, (18036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:25,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6340 states to 6340 states and 18036 transitions. [2024-11-14 03:16:25,065 INFO L78 Accepts]: Start accepts. Automaton has 6340 states and 18036 transitions. Word has length 52 [2024-11-14 03:16:25,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:25,065 INFO L471 AbstractCegarLoop]: Abstraction has 6340 states and 18036 transitions. [2024-11-14 03:16:25,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:25,065 INFO L276 IsEmpty]: Start isEmpty. Operand 6340 states and 18036 transitions. [2024-11-14 03:16:25,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-14 03:16:25,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:25,069 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:16:25,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-14 03:16:25,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-14 03:16:25,270 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:16:25,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:25,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1953427537, now seen corresponding path program 1 times [2024-11-14 03:16:25,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:25,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519529263] [2024-11-14 03:16:25,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:25,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:26,711 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-14 03:16:26,712 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:26,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519529263] [2024-11-14 03:16:26,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519529263] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:16:26,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230608437] [2024-11-14 03:16:26,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:26,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:16:26,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:16:26,714 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:16:26,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-14 03:16:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:26,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-14 03:16:26,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:16:26,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:16:27,088 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:16:27,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:16:27,198 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:16:27,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:16:27,300 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:16:27,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:16:27,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-14 03:16:27,657 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:16:27,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:16:28,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-14 03:16:28,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-14 03:16:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-14 03:16:28,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230608437] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:16:28,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [350537842] [2024-11-14 03:16:28,194 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:16:28,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:16:28,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 15] total 41 [2024-11-14 03:16:28,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553586911] [2024-11-14 03:16:28,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:16:28,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-14 03:16:28,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:16:28,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-14 03:16:28,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1581, Unknown=0, NotChecked=0, Total=1722 [2024-11-14 03:16:28,196 INFO L87 Difference]: Start difference. First operand 6340 states and 18036 transitions. Second operand has 42 states, 41 states have (on average 2.317073170731707) internal successors, (95), 42 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:31,483 INFO L93 Difference]: Finished difference Result 8558 states and 23648 transitions. [2024-11-14 03:16:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-14 03:16:31,483 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.317073170731707) internal successors, (95), 42 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-14 03:16:31,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:31,500 INFO L225 Difference]: With dead ends: 8558 [2024-11-14 03:16:31,500 INFO L226 Difference]: Without dead ends: 8445 [2024-11-14 03:16:31,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 89 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=409, Invalid=3497, Unknown=0, NotChecked=0, Total=3906 [2024-11-14 03:16:31,502 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 670 mSDsluCounter, 2473 mSDsCounter, 0 mSdLazyCounter, 3143 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 3219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 3143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:31,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 2605 Invalid, 3219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 3143 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-14 03:16:31,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8445 states. [2024-11-14 03:16:31,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8445 to 6566. [2024-11-14 03:16:31,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6566 states, 6514 states have (on average 2.8784157199877187) internal successors, (18750), 6565 states have internal predecessors, (18750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6566 states to 6566 states and 18750 transitions. [2024-11-14 03:16:31,737 INFO L78 Accepts]: Start accepts. Automaton has 6566 states and 18750 transitions. Word has length 53 [2024-11-14 03:16:31,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:31,737 INFO L471 AbstractCegarLoop]: Abstraction has 6566 states and 18750 transitions. [2024-11-14 03:16:31,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.317073170731707) internal successors, (95), 42 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:31,737 INFO L276 IsEmpty]: Start isEmpty. Operand 6566 states and 18750 transitions. [2024-11-14 03:16:31,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-14 03:16:31,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:31,739 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:16:31,752 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-14 03:16:31,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:16:31,939 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:16:31,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:31,940 INFO L85 PathProgramCache]: Analyzing trace with hash -628897367, now seen corresponding path program 1 times [2024-11-14 03:16:31,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:31,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194811959] [2024-11-14 03:16:31,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:31,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:31,979 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-14 03:16:31,979 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:31,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194811959] [2024-11-14 03:16:31,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194811959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:16:31,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:16:31,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:16:31,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591427225] [2024-11-14 03:16:31,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:16:31,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:16:31,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:16:31,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:16:31,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:16:31,980 INFO L87 Difference]: Start difference. First operand 6566 states and 18750 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:32,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:32,319 INFO L93 Difference]: Finished difference Result 6730 states and 19043 transitions. [2024-11-14 03:16:32,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:16:32,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-14 03:16:32,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:32,337 INFO L225 Difference]: With dead ends: 6730 [2024-11-14 03:16:32,338 INFO L226 Difference]: Without dead ends: 6614 [2024-11-14 03:16:32,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:16:32,341 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 66 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:32,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 112 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:16:32,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6614 states. [2024-11-14 03:16:32,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6614 to 6450. [2024-11-14 03:16:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6450 states, 6406 states have (on average 2.878395254448954) internal successors, (18439), 6449 states have internal predecessors, (18439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:32,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6450 states to 6450 states and 18439 transitions. [2024-11-14 03:16:32,691 INFO L78 Accepts]: Start accepts. Automaton has 6450 states and 18439 transitions. Word has length 53 [2024-11-14 03:16:32,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:32,691 INFO L471 AbstractCegarLoop]: Abstraction has 6450 states and 18439 transitions. [2024-11-14 03:16:32,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:32,691 INFO L276 IsEmpty]: Start isEmpty. Operand 6450 states and 18439 transitions. [2024-11-14 03:16:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-14 03:16:32,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:32,693 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:16:32,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-14 03:16:32,694 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:16:32,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:32,694 INFO L85 PathProgramCache]: Analyzing trace with hash 426712327, now seen corresponding path program 1 times [2024-11-14 03:16:32,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:32,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603986267] [2024-11-14 03:16:32,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:32,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:32,788 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-14 03:16:32,789 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:32,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603986267] [2024-11-14 03:16:32,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603986267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:16:32,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975557465] [2024-11-14 03:16:32,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:32,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:16:32,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:16:32,791 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:16:32,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-14 03:16:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:32,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:16:32,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:16:33,055 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-14 03:16:33,055 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:16:33,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975557465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:16:33,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:16:33,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-14 03:16:33,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673407335] [2024-11-14 03:16:33,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:16:33,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:16:33,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:16:33,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:16:33,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:16:33,057 INFO L87 Difference]: Start difference. First operand 6450 states and 18439 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:33,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:33,560 INFO L93 Difference]: Finished difference Result 6762 states and 19053 transitions. [2024-11-14 03:16:33,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:16:33,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-14 03:16:33,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:33,578 INFO L225 Difference]: With dead ends: 6762 [2024-11-14 03:16:33,578 INFO L226 Difference]: Without dead ends: 6651 [2024-11-14 03:16:33,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:16:33,582 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 122 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:33,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 249 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:16:33,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6651 states. [2024-11-14 03:16:33,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6651 to 6339. [2024-11-14 03:16:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6339 states, 6301 states have (on average 2.8789081098238376) internal successors, (18140), 6338 states have internal predecessors, (18140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:33,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6339 states to 6339 states and 18140 transitions. [2024-11-14 03:16:33,994 INFO L78 Accepts]: Start accepts. Automaton has 6339 states and 18140 transitions. Word has length 54 [2024-11-14 03:16:33,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:33,994 INFO L471 AbstractCegarLoop]: Abstraction has 6339 states and 18140 transitions. [2024-11-14 03:16:33,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:33,994 INFO L276 IsEmpty]: Start isEmpty. Operand 6339 states and 18140 transitions. [2024-11-14 03:16:33,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-14 03:16:33,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:33,997 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:16:34,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-14 03:16:34,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:16:34,198 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:16:34,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:34,198 INFO L85 PathProgramCache]: Analyzing trace with hash 343181075, now seen corresponding path program 1 times [2024-11-14 03:16:34,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:34,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35145353] [2024-11-14 03:16:34,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:34,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-14 03:16:34,276 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:34,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35145353] [2024-11-14 03:16:34,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35145353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:16:34,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:16:34,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:16:34,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551695916] [2024-11-14 03:16:34,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:16:34,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:16:34,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:16:34,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:16:34,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:16:34,277 INFO L87 Difference]: Start difference. First operand 6339 states and 18140 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:34,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:34,627 INFO L93 Difference]: Finished difference Result 6443 states and 18310 transitions. [2024-11-14 03:16:34,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:16:34,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-14 03:16:34,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:34,643 INFO L225 Difference]: With dead ends: 6443 [2024-11-14 03:16:34,643 INFO L226 Difference]: Without dead ends: 6332 [2024-11-14 03:16:34,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:16:34,646 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 59 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:34,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 100 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:16:34,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6332 states. [2024-11-14 03:16:34,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6332 to 6228. [2024-11-14 03:16:34,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6228 states, 6196 states have (on average 2.879438347320852) internal successors, (17841), 6227 states have internal predecessors, (17841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:34,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 17841 transitions. [2024-11-14 03:16:34,874 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 17841 transitions. Word has length 55 [2024-11-14 03:16:34,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:34,875 INFO L471 AbstractCegarLoop]: Abstraction has 6228 states and 17841 transitions. [2024-11-14 03:16:34,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 17841 transitions. [2024-11-14 03:16:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-14 03:16:34,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:34,878 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:16:34,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-14 03:16:34,878 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:16:34,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:34,879 INFO L85 PathProgramCache]: Analyzing trace with hash -63812688, now seen corresponding path program 2 times [2024-11-14 03:16:34,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:34,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468475069] [2024-11-14 03:16:34,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:34,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:36,206 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 03:16:36,206 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:36,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468475069] [2024-11-14 03:16:36,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468475069] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:16:36,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832556888] [2024-11-14 03:16:36,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:16:36,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:16:36,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:16:36,208 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:16:36,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-14 03:16:36,421 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-14 03:16:36,422 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:16:36,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-14 03:16:36,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:16:37,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:16:37,108 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2024-11-14 03:16:37,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2024-11-14 03:16:37,263 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2024-11-14 03:16:37,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 19 [2024-11-14 03:16:37,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 03:16:37,752 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:16:37,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:16:39,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-11-14 03:16:39,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2024-11-14 03:16:39,453 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:16:39,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832556888] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:16:39,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1041103184] [2024-11-14 03:16:39,454 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:16:39,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:16:39,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27, 18] total 62 [2024-11-14 03:16:39,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173566392] [2024-11-14 03:16:39,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:16:39,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-11-14 03:16:39,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:16:39,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-11-14 03:16:39,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=3596, Unknown=0, NotChecked=0, Total=3906 [2024-11-14 03:16:39,456 INFO L87 Difference]: Start difference. First operand 6228 states and 17841 transitions. Second operand has 63 states, 62 states have (on average 2.193548387096774) internal successors, (136), 63 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:44,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:44,904 INFO L93 Difference]: Finished difference Result 12042 states and 33118 transitions. [2024-11-14 03:16:44,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 03:16:44,905 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.193548387096774) internal successors, (136), 63 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-14 03:16:44,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:44,935 INFO L225 Difference]: With dead ends: 12042 [2024-11-14 03:16:44,935 INFO L226 Difference]: Without dead ends: 11930 [2024-11-14 03:16:44,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1911 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=631, Invalid=6011, Unknown=0, NotChecked=0, Total=6642 [2024-11-14 03:16:44,941 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 668 mSDsluCounter, 3448 mSDsCounter, 0 mSdLazyCounter, 5046 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 3604 SdHoareTripleChecker+Invalid, 5098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 5046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:44,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 3604 Invalid, 5098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 5046 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-14 03:16:44,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11930 states. [2024-11-14 03:16:45,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11930 to 7012. [2024-11-14 03:16:45,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7012 states, 6980 states have (on average 2.8891117478510027) internal successors, (20166), 7011 states have internal predecessors, (20166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7012 states to 7012 states and 20166 transitions. [2024-11-14 03:16:45,326 INFO L78 Accepts]: Start accepts. Automaton has 7012 states and 20166 transitions. Word has length 57 [2024-11-14 03:16:45,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:45,326 INFO L471 AbstractCegarLoop]: Abstraction has 7012 states and 20166 transitions. [2024-11-14 03:16:45,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 2.193548387096774) internal successors, (136), 63 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:45,327 INFO L276 IsEmpty]: Start isEmpty. Operand 7012 states and 20166 transitions. [2024-11-14 03:16:45,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-14 03:16:45,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:45,329 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:16:45,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-14 03:16:45,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:16:45,529 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:16:45,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:45,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1978224312, now seen corresponding path program 2 times [2024-11-14 03:16:45,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:45,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742914753] [2024-11-14 03:16:45,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:45,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:46,987 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 03:16:46,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:46,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742914753] [2024-11-14 03:16:46,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742914753] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:16:46,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796412138] [2024-11-14 03:16:46,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:16:46,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:16:46,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:16:46,991 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:16:46,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-14 03:16:47,236 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-14 03:16:47,236 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:16:47,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-14 03:16:47,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:16:47,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:16:47,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:16:47,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-14 03:16:47,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:16:47,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-14 03:16:48,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-14 03:16:48,060 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 3 proven. 49 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:16:48,060 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:16:52,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2024-11-14 03:16:52,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2024-11-14 03:16:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-14 03:16:52,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796412138] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:16:52,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [473844459] [2024-11-14 03:16:52,654 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:16:52,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:16:52,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18, 17] total 52 [2024-11-14 03:16:52,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119804954] [2024-11-14 03:16:52,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:16:52,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-14 03:16:52,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:16:52,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-14 03:16:52,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2533, Unknown=4, NotChecked=0, Total=2756 [2024-11-14 03:16:52,656 INFO L87 Difference]: Start difference. First operand 7012 states and 20166 transitions. Second operand has 53 states, 52 states have (on average 2.4423076923076925) internal successors, (127), 53 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:57,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:57,160 INFO L93 Difference]: Finished difference Result 11034 states and 30409 transitions. [2024-11-14 03:16:57,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-14 03:16:57,161 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.4423076923076925) internal successors, (127), 53 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-14 03:16:57,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:57,193 INFO L225 Difference]: With dead ends: 11034 [2024-11-14 03:16:57,193 INFO L226 Difference]: Without dead ends: 10922 [2024-11-14 03:16:57,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1269 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=405, Invalid=4147, Unknown=4, NotChecked=0, Total=4556 [2024-11-14 03:16:57,198 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 670 mSDsluCounter, 2947 mSDsCounter, 0 mSdLazyCounter, 4354 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 3076 SdHoareTripleChecker+Invalid, 4413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 4354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:57,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 3076 Invalid, 4413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 4354 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-14 03:16:57,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10922 states. [2024-11-14 03:16:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10922 to 7348. [2024-11-14 03:16:57,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7348 states, 7316 states have (on average 2.8951612903225805) internal successors, (21181), 7347 states have internal predecessors, (21181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:57,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7348 states to 7348 states and 21181 transitions. [2024-11-14 03:16:57,690 INFO L78 Accepts]: Start accepts. Automaton has 7348 states and 21181 transitions. Word has length 58 [2024-11-14 03:16:57,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:57,691 INFO L471 AbstractCegarLoop]: Abstraction has 7348 states and 21181 transitions. [2024-11-14 03:16:57,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.4423076923076925) internal successors, (127), 53 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:57,691 INFO L276 IsEmpty]: Start isEmpty. Operand 7348 states and 21181 transitions. [2024-11-14 03:16:57,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-14 03:16:57,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:57,694 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:16:57,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-14 03:16:57,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:16:57,894 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:16:57,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:57,895 INFO L85 PathProgramCache]: Analyzing trace with hash 727581274, now seen corresponding path program 2 times [2024-11-14 03:16:57,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:57,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973714631] [2024-11-14 03:16:57,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:57,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:59,079 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 59 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:16:59,080 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:59,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973714631] [2024-11-14 03:16:59,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973714631] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:16:59,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451328582] [2024-11-14 03:16:59,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:16:59,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:16:59,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:16:59,083 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:16:59,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-14 03:16:59,345 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-14 03:16:59,345 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:16:59,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-14 03:16:59,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:16:59,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:16:59,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:16:59,791 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2024-11-14 03:16:59,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2024-11-14 03:16:59,961 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2024-11-14 03:16:59,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 19 [2024-11-14 03:17:00,120 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:17:00,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:17:00,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:17:00,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:17:00,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:17:00,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:17:00,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:17:00,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 03:17:00,843 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:17:00,843 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:17:01,259 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1462 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1462) c_~o_0~0.base) (+ c_~o_0~0.offset 8)) 9223372039002259456)) is different from false [2024-11-14 03:17:06,081 INFO L349 Elim1Store]: treesize reduction 52, result has 49.5 percent of original size [2024-11-14 03:17:06,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 63 [2024-11-14 03:17:06,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:17:06,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 66 [2024-11-14 03:17:06,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:17:06,928 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 22 trivial. 13 not checked. [2024-11-14 03:17:06,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451328582] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:17:06,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [380124153] [2024-11-14 03:17:06,928 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:17:06,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:17:06,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 18] total 54 [2024-11-14 03:17:06,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786346835] [2024-11-14 03:17:06,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:17:06,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-14 03:17:06,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:17:06,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-14 03:17:06,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=2734, Unknown=1, NotChecked=106, Total=3080 [2024-11-14 03:17:06,931 INFO L87 Difference]: Start difference. First operand 7348 states and 21181 transitions. Second operand has 56 states, 55 states have (on average 2.672727272727273) internal successors, (147), 55 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:17:13,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:17:13,305 INFO L93 Difference]: Finished difference Result 13966 states and 38809 transitions. [2024-11-14 03:17:13,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-14 03:17:13,305 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.672727272727273) internal successors, (147), 55 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-14 03:17:13,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:17:13,343 INFO L225 Difference]: With dead ends: 13966 [2024-11-14 03:17:13,343 INFO L226 Difference]: Without dead ends: 13835 [2024-11-14 03:17:13,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=581, Invalid=5274, Unknown=1, NotChecked=150, Total=6006 [2024-11-14 03:17:13,349 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 632 mSDsluCounter, 3360 mSDsCounter, 0 mSdLazyCounter, 4399 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 3516 SdHoareTripleChecker+Invalid, 4872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 4399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 420 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:17:13,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 3516 Invalid, 4872 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [53 Valid, 4399 Invalid, 0 Unknown, 420 Unchecked, 4.2s Time] [2024-11-14 03:17:13,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13835 states. [2024-11-14 03:17:13,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13835 to 8265. [2024-11-14 03:17:13,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8265 states, 8233 states have (on average 2.9055022470545366) internal successors, (23921), 8264 states have internal predecessors, (23921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:17:13,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8265 states to 8265 states and 23921 transitions. [2024-11-14 03:17:13,985 INFO L78 Accepts]: Start accepts. Automaton has 8265 states and 23921 transitions. Word has length 59 [2024-11-14 03:17:13,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:17:13,985 INFO L471 AbstractCegarLoop]: Abstraction has 8265 states and 23921 transitions. [2024-11-14 03:17:13,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.672727272727273) internal successors, (147), 55 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:17:13,985 INFO L276 IsEmpty]: Start isEmpty. Operand 8265 states and 23921 transitions. [2024-11-14 03:17:13,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-14 03:17:13,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:17:13,989 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-14 03:17:14,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-11-14 03:17:14,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-14 03:17:14,189 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:17:14,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:17:14,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1195411758, now seen corresponding path program 2 times [2024-11-14 03:17:14,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:17:14,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183904340] [2024-11-14 03:17:14,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:17:14,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:17:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:17:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 1 proven. 66 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 03:17:15,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:17:15,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183904340] [2024-11-14 03:17:15,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183904340] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:17:15,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122850582] [2024-11-14 03:17:15,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:17:15,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:17:15,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:17:15,384 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:17:15,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-14 03:17:15,665 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-14 03:17:15,665 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:17:15,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-14 03:17:15,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:17:15,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:17:15,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:17:16,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:17:16,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-14 03:17:16,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:17:16,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-14 03:17:16,317 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:17:16,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:17:16,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:17:16,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:17:16,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:17:16,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:17:16,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:17:16,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-14 03:17:17,143 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 3 proven. 66 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:17:17,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:17:17,608 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_208| Int) (v_ArrVal_1520 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_208|) 0)) (< 0 (+ (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_208| v_ArrVal_1520) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483649)))) is different from false [2024-11-14 03:17:17,636 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_208| Int) (v_ArrVal_1520 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_903| Int)) (or (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_903|)) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_208| v_ArrVal_1520) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_208|) 0)))) is different from false [2024-11-14 03:17:24,141 INFO L349 Elim1Store]: treesize reduction 66, result has 35.9 percent of original size [2024-11-14 03:17:24,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 51 [2024-11-14 03:17:24,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:17:24,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2024-11-14 03:17:24,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:17:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 2 proven. 50 refuted. 0 times theorem prover too weak. 22 trivial. 17 not checked. [2024-11-14 03:17:24,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122850582] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:17:24,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [315674295] [2024-11-14 03:17:24,681 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:17:24,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:17:24,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 50 [2024-11-14 03:17:24,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634075842] [2024-11-14 03:17:24,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:17:24,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-14 03:17:24,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:17:24,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-14 03:17:24,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2261, Unknown=13, NotChecked=194, Total=2652 [2024-11-14 03:17:24,683 INFO L87 Difference]: Start difference. First operand 8265 states and 23921 transitions. Second operand has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 51 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:17:32,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:17:32,759 INFO L93 Difference]: Finished difference Result 12168 states and 33800 transitions. [2024-11-14 03:17:32,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-14 03:17:32,760 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 51 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-14 03:17:32,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:17:32,784 INFO L225 Difference]: With dead ends: 12168 [2024-11-14 03:17:32,784 INFO L226 Difference]: Without dead ends: 12042 [2024-11-14 03:17:32,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 85 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1639 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=520, Invalid=5481, Unknown=13, NotChecked=306, Total=6320 [2024-11-14 03:17:32,786 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 725 mSDsluCounter, 3863 mSDsCounter, 0 mSdLazyCounter, 5493 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 4028 SdHoareTripleChecker+Invalid, 6616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 5493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1075 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:17:32,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 4028 Invalid, 6616 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 5493 Invalid, 0 Unknown, 1075 Unchecked, 5.7s Time] [2024-11-14 03:17:32,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12042 states. [2024-11-14 03:17:33,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12042 to 8643. [2024-11-14 03:17:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8643 states, 8611 states have (on average 2.896411566600859) internal successors, (24941), 8642 states have internal predecessors, (24941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:17:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8643 states to 8643 states and 24941 transitions. [2024-11-14 03:17:33,200 INFO L78 Accepts]: Start accepts. Automaton has 8643 states and 24941 transitions. Word has length 59 [2024-11-14 03:17:33,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:17:33,200 INFO L471 AbstractCegarLoop]: Abstraction has 8643 states and 24941 transitions. [2024-11-14 03:17:33,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 51 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:17:33,200 INFO L276 IsEmpty]: Start isEmpty. Operand 8643 states and 24941 transitions. [2024-11-14 03:17:33,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-14 03:17:33,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:17:33,204 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:17:33,221 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-11-14 03:17:33,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-14 03:17:33,404 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:17:33,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:17:33,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1080152055, now seen corresponding path program 2 times [2024-11-14 03:17:33,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:17:33,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146834936] [2024-11-14 03:17:33,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:17:33,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:17:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:17:34,365 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 1 proven. 62 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 03:17:34,365 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:17:34,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146834936] [2024-11-14 03:17:34,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146834936] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:17:34,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551543639] [2024-11-14 03:17:34,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:17:34,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:17:34,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:17:34,367 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:17:34,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-14 03:17:34,627 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-14 03:17:34,627 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:17:34,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-14 03:17:34,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:17:34,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:17:34,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:17:34,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:17:34,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-14 03:17:35,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:17:35,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-14 03:17:35,166 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:17:35,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:17:35,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:17:35,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:17:35,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:17:35,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:17:35,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:17:35,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-14 03:17:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 3 proven. 62 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:17:36,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:17:46,785 INFO L349 Elim1Store]: treesize reduction 66, result has 35.9 percent of original size [2024-11-14 03:17:46,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 51 [2024-11-14 03:17:46,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:17:46,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2024-11-14 03:17:46,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:17:47,298 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 2 proven. 63 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:17:47,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551543639] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:17:47,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [76887834] [2024-11-14 03:17:47,299 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:17:47,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:17:47,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 20] total 56 [2024-11-14 03:17:47,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755799303] [2024-11-14 03:17:47,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:17:47,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-14 03:17:47,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:17:47,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-14 03:17:47,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=3035, Unknown=14, NotChecked=0, Total=3306 [2024-11-14 03:17:47,301 INFO L87 Difference]: Start difference. First operand 8643 states and 24941 transitions. Second operand has 58 states, 57 states have (on average 2.5964912280701755) internal successors, (148), 57 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:17:53,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:17:53,437 INFO L93 Difference]: Finished difference Result 13375 states and 37135 transitions. [2024-11-14 03:17:53,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-14 03:17:53,438 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 2.5964912280701755) internal successors, (148), 57 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-14 03:17:53,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:17:53,463 INFO L225 Difference]: With dead ends: 13375 [2024-11-14 03:17:53,463 INFO L226 Difference]: Without dead ends: 13238 [2024-11-14 03:17:53,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1683 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=620, Invalid=5846, Unknown=14, NotChecked=0, Total=6480 [2024-11-14 03:17:53,467 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 619 mSDsluCounter, 3577 mSDsCounter, 0 mSdLazyCounter, 4864 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 3706 SdHoareTripleChecker+Invalid, 4904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 4864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:17:53,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 3706 Invalid, 4904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 4864 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-14 03:17:53,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13238 states. [2024-11-14 03:17:53,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13238 to 9054. [2024-11-14 03:17:53,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9054 states, 9022 states have (on average 2.902682332077145) internal successors, (26188), 9053 states have internal predecessors, (26188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:17:53,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9054 states to 9054 states and 26188 transitions. [2024-11-14 03:17:53,898 INFO L78 Accepts]: Start accepts. Automaton has 9054 states and 26188 transitions. Word has length 60 [2024-11-14 03:17:53,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:17:53,898 INFO L471 AbstractCegarLoop]: Abstraction has 9054 states and 26188 transitions. [2024-11-14 03:17:53,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 2.5964912280701755) internal successors, (148), 57 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:17:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 9054 states and 26188 transitions. [2024-11-14 03:17:53,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-14 03:17:53,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:17:53,902 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-14 03:17:53,919 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-11-14 03:17:54,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-14 03:17:54,102 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:17:54,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:17:54,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1596941963, now seen corresponding path program 2 times [2024-11-14 03:17:54,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:17:54,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629424694] [2024-11-14 03:17:54,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:17:54,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:17:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:17:55,118 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 1 proven. 68 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 03:17:55,118 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:17:55,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629424694] [2024-11-14 03:17:55,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629424694] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:17:55,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255844223] [2024-11-14 03:17:55,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:17:55,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:17:55,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:17:55,120 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:17:55,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-14 03:17:55,410 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-14 03:17:55,410 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:17:55,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-14 03:17:55,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:17:55,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:17:55,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:17:55,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:17:55,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-14 03:17:55,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:17:55,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-14 03:17:55,955 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:17:55,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:17:56,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:17:56,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:17:56,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:17:56,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:17:56,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:17:56,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 03:17:56,795 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 3 proven. 68 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:17:56,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:17:57,182 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1637 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1637) c_~o_0~0.base) (+ c_~o_0~0.offset 8)) 2147483648)) is different from false [2024-11-14 03:17:57,323 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1637 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_212| Int) (v_ArrVal_1632 Int)) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1632)) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_212| v_ArrVal_1637) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_212|) 0)))) is different from false [2024-11-14 03:18:09,867 INFO L349 Elim1Store]: treesize reduction 66, result has 35.9 percent of original size [2024-11-14 03:18:09,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 49 [2024-11-14 03:18:09,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:18:09,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2024-11-14 03:18:09,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:18:10,288 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 2 proven. 51 refuted. 0 times theorem prover too weak. 22 trivial. 18 not checked. [2024-11-14 03:18:10,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255844223] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:18:10,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1767285921] [2024-11-14 03:18:10,288 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:18:10,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:18:10,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 51 [2024-11-14 03:18:10,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738257539] [2024-11-14 03:18:10,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:18:10,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-14 03:18:10,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:18:10,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-14 03:18:10,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2354, Unknown=8, NotChecked=198, Total=2756 [2024-11-14 03:18:10,291 INFO L87 Difference]: Start difference. First operand 9054 states and 26188 transitions. Second operand has 53 states, 52 states have (on average 2.519230769230769) internal successors, (131), 52 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:18:17,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:18:17,023 INFO L93 Difference]: Finished difference Result 12354 states and 34300 transitions. [2024-11-14 03:18:17,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-14 03:18:17,024 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.519230769230769) internal successors, (131), 52 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-14 03:18:17,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:18:17,055 INFO L225 Difference]: With dead ends: 12354 [2024-11-14 03:18:17,055 INFO L226 Difference]: Without dead ends: 12222 [2024-11-14 03:18:17,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 86 SyntacticMatches, 7 SemanticMatches, 80 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1779 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=547, Invalid=5773, Unknown=8, NotChecked=314, Total=6642 [2024-11-14 03:18:17,061 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 815 mSDsluCounter, 3573 mSDsCounter, 0 mSdLazyCounter, 5031 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 3748 SdHoareTripleChecker+Invalid, 6162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 5031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1085 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:18:17,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 3748 Invalid, 6162 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [46 Valid, 5031 Invalid, 0 Unknown, 1085 Unchecked, 4.4s Time] [2024-11-14 03:18:17,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12222 states. [2024-11-14 03:18:17,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12222 to 9318. [2024-11-14 03:18:17,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9318 states, 9286 states have (on average 2.910618134826621) internal successors, (27028), 9317 states have internal predecessors, (27028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:18:17,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9318 states to 9318 states and 27028 transitions. [2024-11-14 03:18:17,607 INFO L78 Accepts]: Start accepts. Automaton has 9318 states and 27028 transitions. Word has length 60 [2024-11-14 03:18:17,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:18:17,607 INFO L471 AbstractCegarLoop]: Abstraction has 9318 states and 27028 transitions. [2024-11-14 03:18:17,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.519230769230769) internal successors, (131), 52 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:18:17,607 INFO L276 IsEmpty]: Start isEmpty. Operand 9318 states and 27028 transitions. [2024-11-14 03:18:17,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-14 03:18:17,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:18:17,611 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:18:17,629 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-14 03:18:17,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-14 03:18:17,812 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:18:17,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:18:17,812 INFO L85 PathProgramCache]: Analyzing trace with hash -875024868, now seen corresponding path program 2 times [2024-11-14 03:18:17,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:18:17,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271421793] [2024-11-14 03:18:17,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:18:17,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:18:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:18:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 03:18:19,000 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:18:19,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271421793] [2024-11-14 03:18:19,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271421793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:18:19,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087621059] [2024-11-14 03:18:19,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:18:19,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:18:19,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:18:19,002 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:18:19,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-11-14 03:18:19,249 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-14 03:18:19,249 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:18:19,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-14 03:18:19,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:18:19,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:18:19,509 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2024-11-14 03:18:19,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2024-11-14 03:18:19,688 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2024-11-14 03:18:19,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 21 [2024-11-14 03:18:20,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-14 03:18:20,258 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:18:20,258 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:18:25,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2024-11-14 03:18:25,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 238 treesize of output 230 [2024-11-14 03:18:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:18:25,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087621059] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:18:25,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1058472279] [2024-11-14 03:18:25,690 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:18:25,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:18:25,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19, 19] total 54 [2024-11-14 03:18:25,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247563477] [2024-11-14 03:18:25,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:18:25,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-14 03:18:25,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:18:25,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-14 03:18:25,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2716, Unknown=0, NotChecked=0, Total=2970 [2024-11-14 03:18:25,692 INFO L87 Difference]: Start difference. First operand 9318 states and 27028 transitions. Second operand has 55 states, 54 states have (on average 2.3518518518518516) internal successors, (127), 55 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:18:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:18:31,056 INFO L93 Difference]: Finished difference Result 13485 states and 37698 transitions. [2024-11-14 03:18:31,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-14 03:18:31,057 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.3518518518518516) internal successors, (127), 55 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-14 03:18:31,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:18:31,095 INFO L225 Difference]: With dead ends: 13485 [2024-11-14 03:18:31,095 INFO L226 Difference]: Without dead ends: 13344 [2024-11-14 03:18:31,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=459, Invalid=4511, Unknown=0, NotChecked=0, Total=4970 [2024-11-14 03:18:31,100 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 792 mSDsluCounter, 3612 mSDsCounter, 0 mSdLazyCounter, 4607 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 3779 SdHoareTripleChecker+Invalid, 4659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 4607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:18:31,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 3779 Invalid, 4659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 4607 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-14 03:18:31,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13344 states. [2024-11-14 03:18:31,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13344 to 9741. [2024-11-14 03:18:31,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9741 states, 9709 states have (on average 2.901843650221444) internal successors, (28174), 9740 states have internal predecessors, (28174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:18:31,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9741 states to 9741 states and 28174 transitions. [2024-11-14 03:18:31,696 INFO L78 Accepts]: Start accepts. Automaton has 9741 states and 28174 transitions. Word has length 61 [2024-11-14 03:18:31,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:18:31,696 INFO L471 AbstractCegarLoop]: Abstraction has 9741 states and 28174 transitions. [2024-11-14 03:18:31,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.3518518518518516) internal successors, (127), 55 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:18:31,697 INFO L276 IsEmpty]: Start isEmpty. Operand 9741 states and 28174 transitions. [2024-11-14 03:18:31,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-14 03:18:31,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:18:31,702 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:18:31,720 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2024-11-14 03:18:31,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-14 03:18:31,903 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:18:31,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:18:31,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1355966310, now seen corresponding path program 2 times [2024-11-14 03:18:31,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:18:31,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299381651] [2024-11-14 03:18:31,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:18:31,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:18:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:18:33,288 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 03:18:33,288 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:18:33,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299381651] [2024-11-14 03:18:33,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299381651] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:18:33,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12520257] [2024-11-14 03:18:33,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:18:33,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:18:33,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:18:33,290 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:18:33,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-14 03:18:33,578 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-14 03:18:33,578 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:18:33,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-14 03:18:33,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:18:33,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:18:33,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:18:33,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-14 03:18:34,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:18:34,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-14 03:18:34,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 03:18:34,511 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 3 proven. 55 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:18:34,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:18:39,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-14 03:18:39,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2024-11-14 03:18:40,158 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-14 03:18:40,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12520257] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:18:40,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1626292051] [2024-11-14 03:18:40,159 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:18:40,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:18:40,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20, 19] total 53 [2024-11-14 03:18:40,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786712018] [2024-11-14 03:18:40,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:18:40,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-14 03:18:40,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:18:40,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-14 03:18:40,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2654, Unknown=5, NotChecked=0, Total=2862 [2024-11-14 03:18:40,161 INFO L87 Difference]: Start difference. First operand 9741 states and 28174 transitions. Second operand has 54 states, 53 states have (on average 2.4339622641509435) internal successors, (129), 54 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:18:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:18:47,570 INFO L93 Difference]: Finished difference Result 13062 states and 36411 transitions. [2024-11-14 03:18:47,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-14 03:18:47,570 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.4339622641509435) internal successors, (129), 54 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-14 03:18:47,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:18:47,604 INFO L225 Difference]: With dead ends: 13062 [2024-11-14 03:18:47,604 INFO L226 Difference]: Without dead ends: 12921 [2024-11-14 03:18:47,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1563 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=468, Invalid=5227, Unknown=5, NotChecked=0, Total=5700 [2024-11-14 03:18:47,611 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 659 mSDsluCounter, 4592 mSDsCounter, 0 mSdLazyCounter, 5943 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 4767 SdHoareTripleChecker+Invalid, 6000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 5943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:18:47,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 4767 Invalid, 6000 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 5943 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-14 03:18:47,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12921 states. [2024-11-14 03:18:48,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12921 to 10023. [2024-11-14 03:18:48,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10023 states, 9991 states have (on average 2.909818836953258) internal successors, (29072), 10022 states have internal predecessors, (29072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:18:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10023 states to 10023 states and 29072 transitions. [2024-11-14 03:18:48,204 INFO L78 Accepts]: Start accepts. Automaton has 10023 states and 29072 transitions. Word has length 62 [2024-11-14 03:18:48,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:18:48,204 INFO L471 AbstractCegarLoop]: Abstraction has 10023 states and 29072 transitions. [2024-11-14 03:18:48,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.4339622641509435) internal successors, (129), 54 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:18:48,204 INFO L276 IsEmpty]: Start isEmpty. Operand 10023 states and 29072 transitions. [2024-11-14 03:18:48,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-14 03:18:48,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:18:48,210 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:18:48,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2024-11-14 03:18:48,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:18:48,410 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:18:48,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:18:48,411 INFO L85 PathProgramCache]: Analyzing trace with hash -176016460, now seen corresponding path program 3 times [2024-11-14 03:18:48,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:18:48,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756569698] [2024-11-14 03:18:48,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:18:48,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:18:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:18:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:18:49,953 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:18:49,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756569698] [2024-11-14 03:18:49,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756569698] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:18:49,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758300064] [2024-11-14 03:18:49,954 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:18:49,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:18:49,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:18:49,956 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:18:49,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-14 03:18:50,250 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:18:50,251 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:18:50,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-14 03:18:50,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:18:50,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:18:50,735 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:18:50,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:18:51,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-14 03:18:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:18:51,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:18:56,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-14 03:18:56,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2024-11-14 03:18:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:18:56,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758300064] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:18:56,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1775309681] [2024-11-14 03:18:56,364 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:18:56,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:18:56,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20, 20] total 58 [2024-11-14 03:18:56,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430681662] [2024-11-14 03:18:56,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:18:56,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-14 03:18:56,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:18:56,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-14 03:18:56,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=3225, Unknown=3, NotChecked=0, Total=3422 [2024-11-14 03:18:56,366 INFO L87 Difference]: Start difference. First operand 10023 states and 29072 transitions. Second operand has 59 states, 58 states have (on average 2.6206896551724137) internal successors, (152), 59 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:07,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:19:07,394 INFO L93 Difference]: Finished difference Result 18739 states and 51828 transitions. [2024-11-14 03:19:07,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-14 03:19:07,395 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.6206896551724137) internal successors, (152), 59 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-14 03:19:07,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:19:07,448 INFO L225 Difference]: With dead ends: 18739 [2024-11-14 03:19:07,448 INFO L226 Difference]: Without dead ends: 18597 [2024-11-14 03:19:07,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1325 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=472, Invalid=6497, Unknown=3, NotChecked=0, Total=6972 [2024-11-14 03:19:07,455 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 1065 mSDsluCounter, 7222 mSDsCounter, 0 mSdLazyCounter, 9514 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 7435 SdHoareTripleChecker+Invalid, 9594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 9514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:19:07,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1065 Valid, 7435 Invalid, 9594 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [80 Valid, 9514 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2024-11-14 03:19:07,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18597 states. [2024-11-14 03:19:08,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18597 to 11017. [2024-11-14 03:19:08,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11017 states, 10985 states have (on average 2.9165225307237144) internal successors, (32038), 11016 states have internal predecessors, (32038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:08,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11017 states to 11017 states and 32038 transitions. [2024-11-14 03:19:08,197 INFO L78 Accepts]: Start accepts. Automaton has 11017 states and 32038 transitions. Word has length 66 [2024-11-14 03:19:08,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:19:08,198 INFO L471 AbstractCegarLoop]: Abstraction has 11017 states and 32038 transitions. [2024-11-14 03:19:08,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.6206896551724137) internal successors, (152), 59 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:08,198 INFO L276 IsEmpty]: Start isEmpty. Operand 11017 states and 32038 transitions. [2024-11-14 03:19:08,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-14 03:19:08,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:19:08,204 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:19:08,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2024-11-14 03:19:08,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2024-11-14 03:19:08,404 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:19:08,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:19:08,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1161573948, now seen corresponding path program 3 times [2024-11-14 03:19:08,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:19:08,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347201286] [2024-11-14 03:19:08,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:19:08,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:19:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:19:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:19:10,204 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:19:10,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347201286] [2024-11-14 03:19:10,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347201286] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:19:10,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016619127] [2024-11-14 03:19:10,204 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:19:10,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:19:10,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:19:10,206 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:19:10,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-14 03:19:10,508 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:19:10,508 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:19:10,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-14 03:19:10,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:10,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:19:10,964 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:19:10,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-11-14 03:19:11,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-14 03:19:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:19:11,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:19:16,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2024-11-14 03:19:16,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2024-11-14 03:19:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:19:16,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016619127] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:19:16,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [144442269] [2024-11-14 03:19:16,797 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:19:16,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:19:16,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20, 20] total 58 [2024-11-14 03:19:16,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943490904] [2024-11-14 03:19:16,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:19:16,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-14 03:19:16,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:19:16,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-14 03:19:16,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=3225, Unknown=3, NotChecked=0, Total=3422 [2024-11-14 03:19:16,800 INFO L87 Difference]: Start difference. First operand 11017 states and 32038 transitions. Second operand has 59 states, 58 states have (on average 2.6551724137931036) internal successors, (154), 59 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:26,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:19:26,345 INFO L93 Difference]: Finished difference Result 17035 states and 47220 transitions. [2024-11-14 03:19:26,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 03:19:26,346 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.6551724137931036) internal successors, (154), 59 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-14 03:19:26,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:19:26,392 INFO L225 Difference]: With dead ends: 17035 [2024-11-14 03:19:26,392 INFO L226 Difference]: Without dead ends: 16893 [2024-11-14 03:19:26,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=431, Invalid=6046, Unknown=3, NotChecked=0, Total=6480 [2024-11-14 03:19:26,399 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 922 mSDsluCounter, 5369 mSDsCounter, 0 mSdLazyCounter, 7507 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 5541 SdHoareTripleChecker+Invalid, 7583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 7507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:19:26,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 5541 Invalid, 7583 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [76 Valid, 7507 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2024-11-14 03:19:26,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16893 states. [2024-11-14 03:19:27,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16893 to 11443. [2024-11-14 03:19:27,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11443 states, 11411 states have (on average 2.9210411006923143) internal successors, (33332), 11442 states have internal predecessors, (33332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11443 states to 11443 states and 33332 transitions. [2024-11-14 03:19:27,253 INFO L78 Accepts]: Start accepts. Automaton has 11443 states and 33332 transitions. Word has length 67 [2024-11-14 03:19:27,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:19:27,254 INFO L471 AbstractCegarLoop]: Abstraction has 11443 states and 33332 transitions. [2024-11-14 03:19:27,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.6551724137931036) internal successors, (154), 59 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:27,254 INFO L276 IsEmpty]: Start isEmpty. Operand 11443 states and 33332 transitions. [2024-11-14 03:19:27,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-14 03:19:27,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:19:27,261 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:19:27,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2024-11-14 03:19:27,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:19:27,461 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:19:27,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:19:27,462 INFO L85 PathProgramCache]: Analyzing trace with hash 203788259, now seen corresponding path program 3 times [2024-11-14 03:19:27,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:19:27,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149572699] [2024-11-14 03:19:27,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:19:27,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:19:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:19:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:19:28,677 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:19:28,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149572699] [2024-11-14 03:19:28,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149572699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:19:28,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4243821] [2024-11-14 03:19:28,677 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:19:28,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:19:28,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:19:28,679 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:19:28,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-14 03:19:28,949 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:19:28,950 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:19:28,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-14 03:19:28,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:28,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:19:29,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:19:29,104 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:19:29,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:19:29,133 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:19:29,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:19:29,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:19:29,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:19:29,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:19:29,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:19:29,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:19:29,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-14 03:19:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:19:29,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:19:30,166 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1900 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1900) c_~o_0~0.base) (+ c_~o_0~0.offset 12)) 9223372039002259456)) is different from false [2024-11-14 03:19:30,604 INFO L349 Elim1Store]: treesize reduction 21, result has 54.3 percent of original size [2024-11-14 03:19:30,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2024-11-14 03:19:30,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:19:30,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2024-11-14 03:19:30,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:19:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 22 trivial. 13 not checked. [2024-11-14 03:19:31,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4243821] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:19:31,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1675054193] [2024-11-14 03:19:31,341 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:19:31,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:19:31,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 46 [2024-11-14 03:19:31,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079121192] [2024-11-14 03:19:31,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:19:31,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-14 03:19:31,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:19:31,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-14 03:19:31,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2016, Unknown=2, NotChecked=90, Total=2256 [2024-11-14 03:19:31,345 INFO L87 Difference]: Start difference. First operand 11443 states and 33332 transitions. Second operand has 48 states, 47 states have (on average 2.978723404255319) internal successors, (140), 47 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:40,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:19:40,947 INFO L93 Difference]: Finished difference Result 21019 states and 58638 transitions. [2024-11-14 03:19:40,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-14 03:19:40,947 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.978723404255319) internal successors, (140), 47 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-14 03:19:40,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:19:41,002 INFO L225 Difference]: With dead ends: 21019 [2024-11-14 03:19:41,003 INFO L226 Difference]: Without dead ends: 20858 [2024-11-14 03:19:41,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=393, Invalid=5011, Unknown=2, NotChecked=144, Total=5550 [2024-11-14 03:19:41,011 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 717 mSDsluCounter, 5700 mSDsCounter, 0 mSdLazyCounter, 7111 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 5913 SdHoareTripleChecker+Invalid, 7687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 7111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 541 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:19:41,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 5913 Invalid, 7687 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [35 Valid, 7111 Invalid, 0 Unknown, 541 Unchecked, 6.5s Time] [2024-11-14 03:19:41,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20858 states. [2024-11-14 03:19:41,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20858 to 12570. [2024-11-14 03:19:41,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12570 states, 12538 states have (on average 2.9281384590843835) internal successors, (36713), 12569 states have internal predecessors, (36713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:42,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12570 states to 12570 states and 36713 transitions. [2024-11-14 03:19:42,018 INFO L78 Accepts]: Start accepts. Automaton has 12570 states and 36713 transitions. Word has length 68 [2024-11-14 03:19:42,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:19:42,019 INFO L471 AbstractCegarLoop]: Abstraction has 12570 states and 36713 transitions. [2024-11-14 03:19:42,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.978723404255319) internal successors, (140), 47 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:42,019 INFO L276 IsEmpty]: Start isEmpty. Operand 12570 states and 36713 transitions. [2024-11-14 03:19:42,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-14 03:19:42,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:19:42,025 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-11-14 03:19:42,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2024-11-14 03:19:42,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:19:42,225 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:19:42,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:19:42,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1649054250, now seen corresponding path program 3 times [2024-11-14 03:19:42,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:19:42,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347763162] [2024-11-14 03:19:42,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:19:42,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:19:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:19:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:19:43,788 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:19:43,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347763162] [2024-11-14 03:19:43,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347763162] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:19:43,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274445793] [2024-11-14 03:19:43,788 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:19:43,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:19:43,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:19:43,790 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:19:43,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-14 03:19:44,122 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:19:44,122 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:19:44,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-14 03:19:44,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:44,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:19:44,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:19:44,297 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:19:44,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-11-14 03:19:44,328 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:19:44,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:19:44,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:19:44,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:19:44,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:19:44,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:19:44,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:19:44,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-14 03:19:45,119 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:19:45,119 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:19:45,563 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1958 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1958) c_~o_0~0.base) (+ c_~o_0~0.offset 12))))) is different from false [2024-11-14 03:19:46,143 INFO L349 Elim1Store]: treesize reduction 21, result has 54.3 percent of original size [2024-11-14 03:19:46,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2024-11-14 03:19:46,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:19:46,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2024-11-14 03:19:46,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:19:46,821 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 22 trivial. 13 not checked. [2024-11-14 03:19:46,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274445793] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:19:46,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [907216169] [2024-11-14 03:19:46,821 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:19:46,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:19:46,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 43 [2024-11-14 03:19:46,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156181203] [2024-11-14 03:19:46,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:19:46,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-14 03:19:46,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:19:46,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-14 03:19:46,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1760, Unknown=1, NotChecked=84, Total=1980 [2024-11-14 03:19:46,825 INFO L87 Difference]: Start difference. First operand 12570 states and 36713 transitions. Second operand has 45 states, 44 states have (on average 2.772727272727273) internal successors, (122), 44 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:56,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:19:56,707 INFO L93 Difference]: Finished difference Result 18254 states and 50908 transitions. [2024-11-14 03:19:56,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-14 03:19:56,708 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.772727272727273) internal successors, (122), 44 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-14 03:19:56,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:19:56,762 INFO L225 Difference]: With dead ends: 18254 [2024-11-14 03:19:56,762 INFO L226 Difference]: Without dead ends: 18098 [2024-11-14 03:19:56,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 111 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1184 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=419, Invalid=5134, Unknown=1, NotChecked=146, Total=5700 [2024-11-14 03:19:56,768 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 987 mSDsluCounter, 5091 mSDsCounter, 0 mSdLazyCounter, 6925 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 5312 SdHoareTripleChecker+Invalid, 7607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 6925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 645 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:19:56,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 5312 Invalid, 7607 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [37 Valid, 6925 Invalid, 0 Unknown, 645 Unchecked, 6.5s Time] [2024-11-14 03:19:56,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18098 states. [2024-11-14 03:19:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18098 to 13038. [2024-11-14 03:19:57,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13038 states, 13006 states have (on average 2.9203444564047363) internal successors, (37982), 13037 states have internal predecessors, (37982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:57,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13038 states to 13038 states and 37982 transitions. [2024-11-14 03:19:57,738 INFO L78 Accepts]: Start accepts. Automaton has 13038 states and 37982 transitions. Word has length 68 [2024-11-14 03:19:57,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:19:57,738 INFO L471 AbstractCegarLoop]: Abstraction has 13038 states and 37982 transitions. [2024-11-14 03:19:57,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.772727272727273) internal successors, (122), 44 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:57,738 INFO L276 IsEmpty]: Start isEmpty. Operand 13038 states and 37982 transitions. [2024-11-14 03:19:57,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-14 03:19:57,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:19:57,750 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:19:57,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2024-11-14 03:19:57,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-11-14 03:19:57,950 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:19:57,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:19:57,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2022437774, now seen corresponding path program 3 times [2024-11-14 03:19:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:19:57,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435577601] [2024-11-14 03:19:57,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:19:57,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:19:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:19:59,085 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:19:59,085 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:19:59,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435577601] [2024-11-14 03:19:59,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435577601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:19:59,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802403402] [2024-11-14 03:19:59,086 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:19:59,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:19:59,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:19:59,088 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:19:59,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-11-14 03:19:59,410 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:19:59,411 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:19:59,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-14 03:19:59,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:59,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:19:59,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:19:59,639 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:19:59,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-11-14 03:19:59,682 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:19:59,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:19:59,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:19:59,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:19:59,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:19:59,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:19:59,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:20:00,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-14 03:20:00,348 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:20:00,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:20:01,406 INFO L349 Elim1Store]: treesize reduction 21, result has 54.3 percent of original size [2024-11-14 03:20:01,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2024-11-14 03:20:01,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:20:01,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2024-11-14 03:20:01,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:20:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:20:02,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802403402] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:20:02,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1361128030] [2024-11-14 03:20:02,111 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:20:02,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:20:02,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 46 [2024-11-14 03:20:02,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766695514] [2024-11-14 03:20:02,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:20:02,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-14 03:20:02,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:20:02,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-14 03:20:02,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2104, Unknown=3, NotChecked=0, Total=2256 [2024-11-14 03:20:02,114 INFO L87 Difference]: Start difference. First operand 13038 states and 37982 transitions. Second operand has 48 states, 47 states have (on average 3.021276595744681) internal successors, (142), 47 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:11,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:11,402 INFO L93 Difference]: Finished difference Result 19801 states and 55230 transitions. [2024-11-14 03:20:11,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-14 03:20:11,402 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 3.021276595744681) internal successors, (142), 47 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-14 03:20:11,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:11,452 INFO L225 Difference]: With dead ends: 19801 [2024-11-14 03:20:11,453 INFO L226 Difference]: Without dead ends: 19634 [2024-11-14 03:20:11,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=369, Invalid=4740, Unknown=3, NotChecked=0, Total=5112 [2024-11-14 03:20:11,459 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 715 mSDsluCounter, 5156 mSDsCounter, 0 mSdLazyCounter, 6721 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 5328 SdHoareTripleChecker+Invalid, 6744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 6721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:20:11,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 5328 Invalid, 6744 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 6721 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-14 03:20:11,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19634 states. [2024-11-14 03:20:12,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19634 to 13539. [2024-11-14 03:20:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13539 states, 13507 states have (on average 2.92500185089213) internal successors, (39508), 13538 states have internal predecessors, (39508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:12,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13539 states to 13539 states and 39508 transitions. [2024-11-14 03:20:12,417 INFO L78 Accepts]: Start accepts. Automaton has 13539 states and 39508 transitions. Word has length 69 [2024-11-14 03:20:12,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:12,418 INFO L471 AbstractCegarLoop]: Abstraction has 13539 states and 39508 transitions. [2024-11-14 03:20:12,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 3.021276595744681) internal successors, (142), 47 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:12,418 INFO L276 IsEmpty]: Start isEmpty. Operand 13539 states and 39508 transitions. [2024-11-14 03:20:12,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-14 03:20:12,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:12,424 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-11-14 03:20:12,442 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2024-11-14 03:20:12,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-11-14 03:20:12,625 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:20:12,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:12,625 INFO L85 PathProgramCache]: Analyzing trace with hash 418926599, now seen corresponding path program 3 times [2024-11-14 03:20:12,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:20:12,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818180529] [2024-11-14 03:20:12,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:12,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:20:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:13,835 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 1 proven. 93 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 03:20:13,836 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:20:13,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818180529] [2024-11-14 03:20:13,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818180529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:20:13,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186516697] [2024-11-14 03:20:13,836 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:20:13,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:20:13,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:20:13,838 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:20:13,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-11-14 03:20:14,160 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:20:14,160 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:20:14,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-14 03:20:14,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:14,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:20:14,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:20:14,359 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:20:14,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:20:14,384 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:20:14,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:20:14,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:20:14,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:20:14,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:20:14,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:20:14,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:20:14,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-14 03:20:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:20:14,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:20:15,605 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2072 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_228| Int) (v_ArrVal_2066 Int)) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_2066)) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_228| v_ArrVal_2072) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_228|) 0)))) is different from false [2024-11-14 03:20:15,772 INFO L349 Elim1Store]: treesize reduction 21, result has 54.3 percent of original size [2024-11-14 03:20:15,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2024-11-14 03:20:15,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:20:15,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2024-11-14 03:20:15,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:20:16,432 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 22 trivial. 5 not checked. [2024-11-14 03:20:16,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186516697] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:20:16,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2016430680] [2024-11-14 03:20:16,432 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:20:16,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:20:16,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 22] total 43 [2024-11-14 03:20:16,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226033276] [2024-11-14 03:20:16,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:20:16,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-14 03:20:16,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:20:16,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-14 03:20:16,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1757, Unknown=12, NotChecked=84, Total=1980 [2024-11-14 03:20:16,434 INFO L87 Difference]: Start difference. First operand 13539 states and 39508 transitions. Second operand has 45 states, 44 states have (on average 2.7045454545454546) internal successors, (119), 44 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:26,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:26,181 INFO L93 Difference]: Finished difference Result 18635 states and 51928 transitions. [2024-11-14 03:20:26,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-14 03:20:26,182 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.7045454545454546) internal successors, (119), 44 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-14 03:20:26,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:26,232 INFO L225 Difference]: With dead ends: 18635 [2024-11-14 03:20:26,232 INFO L226 Difference]: Without dead ends: 18473 [2024-11-14 03:20:26,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 112 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1238 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=411, Invalid=5278, Unknown=15, NotChecked=148, Total=5852 [2024-11-14 03:20:26,239 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 884 mSDsluCounter, 5653 mSDsCounter, 0 mSdLazyCounter, 7575 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 5882 SdHoareTripleChecker+Invalid, 8285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 7575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 666 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:20:26,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 5882 Invalid, 8285 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 7575 Invalid, 0 Unknown, 666 Unchecked, 6.7s Time] [2024-11-14 03:20:26,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18473 states. [2024-11-14 03:20:27,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18473 to 13863. [2024-11-14 03:20:27,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13863 states, 13831 states have (on average 2.931386016918516) internal successors, (40544), 13862 states have internal predecessors, (40544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13863 states to 13863 states and 40544 transitions. [2024-11-14 03:20:27,357 INFO L78 Accepts]: Start accepts. Automaton has 13863 states and 40544 transitions. Word has length 69 [2024-11-14 03:20:27,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:27,357 INFO L471 AbstractCegarLoop]: Abstraction has 13863 states and 40544 transitions. [2024-11-14 03:20:27,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.7045454545454546) internal successors, (119), 44 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:27,357 INFO L276 IsEmpty]: Start isEmpty. Operand 13863 states and 40544 transitions. [2024-11-14 03:20:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-14 03:20:27,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:27,364 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:20:27,382 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2024-11-14 03:20:27,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2024-11-14 03:20:27,565 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:20:27,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:27,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1728938651, now seen corresponding path program 3 times [2024-11-14 03:20:27,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:20:27,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027989746] [2024-11-14 03:20:27,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:27,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:20:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:20:29,108 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:20:29,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027989746] [2024-11-14 03:20:29,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027989746] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:20:29,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830224548] [2024-11-14 03:20:29,108 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:20:29,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:20:29,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:20:29,110 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:20:29,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2024-11-14 03:20:29,456 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:20:29,456 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:20:29,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-14 03:20:29,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:29,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:20:30,041 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:20:30,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-11-14 03:20:30,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-14 03:20:31,016 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:20:31,017 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:20:33,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-14 03:20:33,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-14 03:20:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:20:33,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830224548] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:20:33,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1069102627] [2024-11-14 03:20:33,276 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:20:33,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:20:33,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 21, 21] total 57 [2024-11-14 03:20:33,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689104540] [2024-11-14 03:20:33,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:20:33,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-14 03:20:33,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:20:33,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-14 03:20:33,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3128, Unknown=0, NotChecked=0, Total=3306 [2024-11-14 03:20:33,278 INFO L87 Difference]: Start difference. First operand 13863 states and 40544 transitions. Second operand has 58 states, 57 states have (on average 2.7017543859649122) internal successors, (154), 58 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:46,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:46,037 INFO L93 Difference]: Finished difference Result 19764 states and 55446 transitions. [2024-11-14 03:20:46,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-14 03:20:46,038 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 2.7017543859649122) internal successors, (154), 58 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-14 03:20:46,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:46,093 INFO L225 Difference]: With dead ends: 19764 [2024-11-14 03:20:46,093 INFO L226 Difference]: Without dead ends: 19593 [2024-11-14 03:20:46,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1493 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=491, Invalid=6991, Unknown=0, NotChecked=0, Total=7482 [2024-11-14 03:20:46,101 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 950 mSDsluCounter, 8007 mSDsCounter, 0 mSdLazyCounter, 10153 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 8228 SdHoareTripleChecker+Invalid, 10237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 10153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:20:46,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 8228 Invalid, 10237 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [84 Valid, 10153 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2024-11-14 03:20:46,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19593 states. [2024-11-14 03:20:47,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19593 to 14376. [2024-11-14 03:20:47,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14376 states, 14344 states have (on average 2.9238008923591745) internal successors, (41939), 14375 states have internal predecessors, (41939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14376 states to 14376 states and 41939 transitions. [2024-11-14 03:20:47,325 INFO L78 Accepts]: Start accepts. Automaton has 14376 states and 41939 transitions. Word has length 70 [2024-11-14 03:20:47,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:47,326 INFO L471 AbstractCegarLoop]: Abstraction has 14376 states and 41939 transitions. [2024-11-14 03:20:47,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 2.7017543859649122) internal successors, (154), 58 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:47,326 INFO L276 IsEmpty]: Start isEmpty. Operand 14376 states and 41939 transitions. [2024-11-14 03:20:47,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-14 03:20:47,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:47,333 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:20:47,361 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2024-11-14 03:20:47,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2024-11-14 03:20:47,534 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:20:47,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:47,535 INFO L85 PathProgramCache]: Analyzing trace with hash -2057489807, now seen corresponding path program 3 times [2024-11-14 03:20:47,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:20:47,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722624742] [2024-11-14 03:20:47,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:47,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:20:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:20:49,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:20:49,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722624742] [2024-11-14 03:20:49,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722624742] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:20:49,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343286551] [2024-11-14 03:20:49,106 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:20:49,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:20:49,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:20:49,108 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:20:49,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-11-14 03:20:49,456 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:20:49,456 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:20:49,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-14 03:20:49,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:49,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:20:50,051 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:20:50,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-14 03:20:50,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-14 03:20:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:20:50,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:20:53,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-14 03:20:53,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-14 03:20:53,823 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:20:53,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343286551] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:20:53,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [809373070] [2024-11-14 03:20:53,824 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:20:53,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:20:53,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 22, 22] total 58 [2024-11-14 03:20:53,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433320401] [2024-11-14 03:20:53,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:20:53,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-14 03:20:53,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:20:53,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-14 03:20:53,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=3240, Unknown=0, NotChecked=0, Total=3422 [2024-11-14 03:20:53,826 INFO L87 Difference]: Start difference. First operand 14376 states and 41939 transitions. Second operand has 59 states, 58 states have (on average 2.6724137931034484) internal successors, (155), 59 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:05,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:05,537 INFO L93 Difference]: Finished difference Result 19422 states and 54345 transitions. [2024-11-14 03:21:05,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-14 03:21:05,538 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.6724137931034484) internal successors, (155), 59 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-14 03:21:05,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:05,589 INFO L225 Difference]: With dead ends: 19422 [2024-11-14 03:21:05,589 INFO L226 Difference]: Without dead ends: 19251 [2024-11-14 03:21:05,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 119 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1567 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=514, Invalid=7318, Unknown=0, NotChecked=0, Total=7832 [2024-11-14 03:21:05,597 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 1039 mSDsluCounter, 8370 mSDsCounter, 0 mSdLazyCounter, 10319 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 8599 SdHoareTripleChecker+Invalid, 10393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 10319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:05,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 8599 Invalid, 10393 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [74 Valid, 10319 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2024-11-14 03:21:05,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19251 states. [2024-11-14 03:21:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19251 to 14718. [2024-11-14 03:21:06,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14718 states, 14686 states have (on average 2.9302056380226067) internal successors, (43033), 14717 states have internal predecessors, (43033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:06,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14718 states to 14718 states and 43033 transitions. [2024-11-14 03:21:06,609 INFO L78 Accepts]: Start accepts. Automaton has 14718 states and 43033 transitions. Word has length 71 [2024-11-14 03:21:06,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:06,609 INFO L471 AbstractCegarLoop]: Abstraction has 14718 states and 43033 transitions. [2024-11-14 03:21:06,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.6724137931034484) internal successors, (155), 59 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:06,609 INFO L276 IsEmpty]: Start isEmpty. Operand 14718 states and 43033 transitions. [2024-11-14 03:21:06,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-14 03:21:06,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:06,617 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:21:06,637 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2024-11-14 03:21:06,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2024-11-14 03:21:06,818 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:21:06,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:06,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1690112048, now seen corresponding path program 4 times [2024-11-14 03:21:06,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:21:06,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047482914] [2024-11-14 03:21:06,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:06,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:21:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:08,747 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 12 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:21:08,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:21:08,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047482914] [2024-11-14 03:21:08,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047482914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:21:08,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382090489] [2024-11-14 03:21:08,748 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 03:21:08,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:21:08,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:21:08,751 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:21:08,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-11-14 03:21:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:09,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-14 03:21:09,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:09,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:21:10,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-14 03:21:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:21:10,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:21:11,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-11-14 03:21:11,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-14 03:21:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:21:11,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382090489] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:21:11,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1942440068] [2024-11-14 03:21:11,703 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:21:11,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:21:11,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 22, 22] total 64 [2024-11-14 03:21:11,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385676250] [2024-11-14 03:21:11,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:21:11,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-14 03:21:11,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:21:11,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-14 03:21:11,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=3946, Unknown=0, NotChecked=0, Total=4160 [2024-11-14 03:21:11,706 INFO L87 Difference]: Start difference. First operand 14718 states and 43033 transitions. Second operand has 65 states, 64 states have (on average 2.796875) internal successors, (179), 65 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:26,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:26,273 INFO L93 Difference]: Finished difference Result 26906 states and 74682 transitions. [2024-11-14 03:21:26,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-14 03:21:26,274 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.796875) internal successors, (179), 65 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-14 03:21:26,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:26,347 INFO L225 Difference]: With dead ends: 26906 [2024-11-14 03:21:26,347 INFO L226 Difference]: Without dead ends: 26734 [2024-11-14 03:21:26,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1761 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=557, Invalid=8373, Unknown=0, NotChecked=0, Total=8930 [2024-11-14 03:21:26,357 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 1197 mSDsluCounter, 10199 mSDsCounter, 0 mSdLazyCounter, 13161 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 10469 SdHoareTripleChecker+Invalid, 13234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 13161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:26,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 10469 Invalid, 13234 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [73 Valid, 13161 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2024-11-14 03:21:26,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26734 states. [2024-11-14 03:21:27,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26734 to 15922. [2024-11-14 03:21:27,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15922 states, 15890 states have (on average 2.935179358086847) internal successors, (46640), 15921 states have internal predecessors, (46640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:27,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15922 states to 15922 states and 46640 transitions. [2024-11-14 03:21:27,669 INFO L78 Accepts]: Start accepts. Automaton has 15922 states and 46640 transitions. Word has length 75 [2024-11-14 03:21:27,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:27,670 INFO L471 AbstractCegarLoop]: Abstraction has 15922 states and 46640 transitions. [2024-11-14 03:21:27,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.796875) internal successors, (179), 65 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:27,670 INFO L276 IsEmpty]: Start isEmpty. Operand 15922 states and 46640 transitions. [2024-11-14 03:21:27,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-14 03:21:27,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:27,677 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:21:27,694 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2024-11-14 03:21:27,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-11-14 03:21:27,878 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:21:27,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:27,878 INFO L85 PathProgramCache]: Analyzing trace with hash 853834952, now seen corresponding path program 4 times [2024-11-14 03:21:27,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:21:27,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574470810] [2024-11-14 03:21:27,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:27,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:21:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:21:29,663 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:21:29,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574470810] [2024-11-14 03:21:29,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574470810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:21:29,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942087222] [2024-11-14 03:21:29,663 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 03:21:29,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:21:29,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:21:29,667 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:21:29,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2024-11-14 03:21:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:30,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-14 03:21:30,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:30,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:21:31,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-14 03:21:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:21:31,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:21:32,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-14 03:21:32,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-14 03:21:32,534 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:21:32,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942087222] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:21:32,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1330754595] [2024-11-14 03:21:32,535 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:21:32,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:21:32,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 22, 22] total 64 [2024-11-14 03:21:32,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591443294] [2024-11-14 03:21:32,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:21:32,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-14 03:21:32,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:21:32,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-14 03:21:32,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3947, Unknown=0, NotChecked=0, Total=4160 [2024-11-14 03:21:32,537 INFO L87 Difference]: Start difference. First operand 15922 states and 46640 transitions. Second operand has 65 states, 64 states have (on average 2.828125) internal successors, (181), 65 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:44,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:44,451 INFO L93 Difference]: Finished difference Result 24326 states and 67677 transitions. [2024-11-14 03:21:44,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-14 03:21:44,451 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.828125) internal successors, (181), 65 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-14 03:21:44,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:44,510 INFO L225 Difference]: With dead ends: 24326 [2024-11-14 03:21:44,510 INFO L226 Difference]: Without dead ends: 24154 [2024-11-14 03:21:44,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1617 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=501, Invalid=7689, Unknown=0, NotChecked=0, Total=8190 [2024-11-14 03:21:44,514 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 1085 mSDsluCounter, 8227 mSDsCounter, 0 mSdLazyCounter, 10909 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 8442 SdHoareTripleChecker+Invalid, 10971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 10909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:44,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 8442 Invalid, 10971 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [62 Valid, 10909 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2024-11-14 03:21:44,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24154 states. [2024-11-14 03:21:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24154 to 16438. [2024-11-14 03:21:45,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16438 states, 16406 states have (on average 2.938741923686456) internal successors, (48213), 16437 states have internal predecessors, (48213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:45,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16438 states to 16438 states and 48213 transitions. [2024-11-14 03:21:45,622 INFO L78 Accepts]: Start accepts. Automaton has 16438 states and 48213 transitions. Word has length 76 [2024-11-14 03:21:45,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:45,622 INFO L471 AbstractCegarLoop]: Abstraction has 16438 states and 48213 transitions. [2024-11-14 03:21:45,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.828125) internal successors, (181), 65 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:45,623 INFO L276 IsEmpty]: Start isEmpty. Operand 16438 states and 48213 transitions. [2024-11-14 03:21:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-14 03:21:45,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:45,630 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:21:45,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2024-11-14 03:21:45,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:21:45,831 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:21:45,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:45,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1239035002, now seen corresponding path program 4 times [2024-11-14 03:21:45,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:21:45,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782573457] [2024-11-14 03:21:45,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:45,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:21:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 12 proven. 98 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:21:46,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:21:46,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782573457] [2024-11-14 03:21:46,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782573457] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:21:46,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068967115] [2024-11-14 03:21:46,839 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 03:21:46,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:21:46,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:21:46,841 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:21:46,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2024-11-14 03:21:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:47,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-14 03:21:47,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:47,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:21:47,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:21:47,566 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:21:47,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:21:47,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:21:47,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:21:47,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:21:47,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:21:47,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:21:48,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-14 03:21:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:21:48,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:21:48,920 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2330 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_2330) c_~o_0~0.base) (+ 16 c_~o_0~0.offset)) 9223372039002259456)) is different from false [2024-11-14 03:21:49,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:21:49,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-11-14 03:21:49,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:21:49,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2024-11-14 03:21:49,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:21:50,184 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 22 trivial. 13 not checked. [2024-11-14 03:21:50,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068967115] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:21:50,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [469432865] [2024-11-14 03:21:50,184 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:21:50,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:21:50,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 60 [2024-11-14 03:21:50,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531349463] [2024-11-14 03:21:50,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:21:50,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-14 03:21:50,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:21:50,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-14 03:21:50,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3474, Unknown=1, NotChecked=118, Total=3782 [2024-11-14 03:21:50,186 INFO L87 Difference]: Start difference. First operand 16438 states and 48213 transitions. Second operand has 62 states, 61 states have (on average 2.9344262295081966) internal successors, (179), 61 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:22:04,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:22:04,332 INFO L93 Difference]: Finished difference Result 29512 states and 82547 transitions. [2024-11-14 03:22:04,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-14 03:22:04,333 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 2.9344262295081966) internal successors, (179), 61 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-14 03:22:04,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:22:04,412 INFO L225 Difference]: With dead ends: 29512 [2024-11-14 03:22:04,412 INFO L226 Difference]: Without dead ends: 29321 [2024-11-14 03:22:04,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1853 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=566, Invalid=8749, Unknown=1, NotChecked=190, Total=9506 [2024-11-14 03:22:04,421 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 978 mSDsluCounter, 9765 mSDsCounter, 0 mSdLazyCounter, 11811 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 10035 SdHoareTripleChecker+Invalid, 12521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 11811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 660 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:22:04,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 10035 Invalid, 12521 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 11811 Invalid, 0 Unknown, 660 Unchecked, 9.4s Time] [2024-11-14 03:22:04,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29321 states. [2024-11-14 03:22:05,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29321 to 17775. [2024-11-14 03:22:05,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17775 states, 17743 states have (on average 2.943977906780139) internal successors, (52235), 17774 states have internal predecessors, (52235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:22:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17775 states to 17775 states and 52235 transitions. [2024-11-14 03:22:06,011 INFO L78 Accepts]: Start accepts. Automaton has 17775 states and 52235 transitions. Word has length 77 [2024-11-14 03:22:06,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:22:06,012 INFO L471 AbstractCegarLoop]: Abstraction has 17775 states and 52235 transitions. [2024-11-14 03:22:06,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 2.9344262295081966) internal successors, (179), 61 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:22:06,012 INFO L276 IsEmpty]: Start isEmpty. Operand 17775 states and 52235 transitions. [2024-11-14 03:22:06,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-14 03:22:06,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:22:06,020 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-14 03:22:06,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2024-11-14 03:22:06,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:22:06,220 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:22:06,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:22:06,220 INFO L85 PathProgramCache]: Analyzing trace with hash 699079506, now seen corresponding path program 4 times [2024-11-14 03:22:06,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:22:06,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433660216] [2024-11-14 03:22:06,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:22:06,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:22:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:07,327 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:22:07,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:22:07,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433660216] [2024-11-14 03:22:07,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433660216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:22:07,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654764902] [2024-11-14 03:22:07,328 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 03:22:07,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:22:07,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:22:07,330 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:22:07,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2024-11-14 03:22:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:07,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-14 03:22:07,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:22:07,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:22:07,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:22:07,760 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:22:07,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:22:07,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:22:07,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:22:07,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:22:07,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:22:07,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:22:08,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-14 03:22:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:22:08,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:22:08,989 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2385 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_2385) c_~o_0~0.base) (+ 16 c_~o_0~0.offset))))) is different from false [2024-11-14 03:22:09,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:22:09,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-14 03:22:09,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:22:09,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2024-11-14 03:22:09,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:22:10,157 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 22 trivial. 13 not checked. [2024-11-14 03:22:10,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654764902] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:22:10,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [175076497] [2024-11-14 03:22:10,158 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:22:10,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:22:10,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2024-11-14 03:22:10,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499249347] [2024-11-14 03:22:10,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:22:10,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-14 03:22:10,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:22:10,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-14 03:22:10,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1949, Unknown=1, NotChecked=88, Total=2162 [2024-11-14 03:22:10,160 INFO L87 Difference]: Start difference. First operand 17775 states and 52235 transitions. Second operand has 47 states, 46 states have (on average 2.891304347826087) internal successors, (133), 46 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:22:23,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:22:23,260 INFO L93 Difference]: Finished difference Result 25574 states and 71500 transitions. [2024-11-14 03:22:23,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-14 03:22:23,260 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.891304347826087) internal successors, (133), 46 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-14 03:22:23,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:22:23,325 INFO L225 Difference]: With dead ends: 25574 [2024-11-14 03:22:23,325 INFO L226 Difference]: Without dead ends: 25388 [2024-11-14 03:22:23,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 126 SyntacticMatches, 8 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=400, Invalid=6083, Unknown=1, NotChecked=158, Total=6642 [2024-11-14 03:22:23,330 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 991 mSDsluCounter, 7531 mSDsCounter, 0 mSdLazyCounter, 9847 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 7810 SdHoareTripleChecker+Invalid, 10668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 9847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 767 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:22:23,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 7810 Invalid, 10668 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 9847 Invalid, 0 Unknown, 767 Unchecked, 8.6s Time] [2024-11-14 03:22:23,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25388 states. [2024-11-14 03:22:24,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25388 to 18333. [2024-11-14 03:22:24,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18333 states, 18301 states have (on average 2.9371619037211083) internal successors, (53753), 18332 states have internal predecessors, (53753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:22:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18333 states to 18333 states and 53753 transitions. [2024-11-14 03:22:24,648 INFO L78 Accepts]: Start accepts. Automaton has 18333 states and 53753 transitions. Word has length 77 [2024-11-14 03:22:24,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:22:24,648 INFO L471 AbstractCegarLoop]: Abstraction has 18333 states and 53753 transitions. [2024-11-14 03:22:24,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.891304347826087) internal successors, (133), 46 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:22:24,648 INFO L276 IsEmpty]: Start isEmpty. Operand 18333 states and 53753 transitions. [2024-11-14 03:22:24,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-14 03:22:24,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:22:24,656 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:22:24,673 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2024-11-14 03:22:24,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:22:24,857 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:22:24,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:22:24,857 INFO L85 PathProgramCache]: Analyzing trace with hash -244651561, now seen corresponding path program 4 times [2024-11-14 03:22:24,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:22:24,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283056858] [2024-11-14 03:22:24,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:22:24,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:22:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:25,982 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 106 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:22:25,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:22:25,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283056858] [2024-11-14 03:22:25,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283056858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:22:25,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081164669] [2024-11-14 03:22:25,982 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 03:22:25,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:22:25,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:22:25,984 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:22:26,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2024-11-14 03:22:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:26,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-14 03:22:26,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:22:26,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:22:26,986 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 03:22:26,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2024-11-14 03:22:27,189 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 03:22:27,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2024-11-14 03:22:27,394 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 03:22:27,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2024-11-14 03:22:27,600 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 03:22:27,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2024-11-14 03:22:27,810 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-14 03:22:27,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2024-11-14 03:22:29,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:22:29,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2024-11-14 03:22:29,324 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:22:29,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:22:30,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:22:30,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2024-11-14 03:22:30,601 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_19 (Array Int Int))) (or (< (+ (select v_arrayElimArr_19 (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648) 0) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_19) c_~o_0~0.base) (+ 16 c_~o_0~0.offset)) 4294967296)))) is different from false [2024-11-14 03:22:31,537 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_19 (Array Int Int))) (or (< (+ (select v_arrayElimArr_19 (+ 16 (* |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648) 0) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_19) c_~o_0~0.base) (+ 16 c_~o_0~0.offset)) 4294967296)))) is different from false [2024-11-14 03:22:32,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:22:32,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-14 03:22:32,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:22:32,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2024-11-14 03:22:32,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:22:32,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2024-11-14 03:22:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 3 proven. 113 refuted. 11 times theorem prover too weak. 0 trivial. 13 not checked. [2024-11-14 03:22:32,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081164669] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:22:32,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1538569452] [2024-11-14 03:22:32,304 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:22:32,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:22:32,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 30, 30] total 72 [2024-11-14 03:22:32,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562609288] [2024-11-14 03:22:32,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:22:32,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-11-14 03:22:32,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:22:32,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-11-14 03:22:32,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=4752, Unknown=94, NotChecked=282, Total=5402 [2024-11-14 03:22:32,306 INFO L87 Difference]: Start difference. First operand 18333 states and 53753 transitions. Second operand has 74 states, 73 states have (on average 2.8493150684931505) internal successors, (208), 73 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:22:47,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:22:47,782 INFO L93 Difference]: Finished difference Result 27487 states and 76907 transitions. [2024-11-14 03:22:47,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-14 03:22:47,783 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 2.8493150684931505) internal successors, (208), 73 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-14 03:22:47,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:22:47,864 INFO L225 Difference]: With dead ends: 27487 [2024-11-14 03:22:47,864 INFO L226 Difference]: Without dead ends: 27290 [2024-11-14 03:22:47,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2409 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=717, Invalid=10107, Unknown=104, NotChecked=414, Total=11342 [2024-11-14 03:22:47,874 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 915 mSDsluCounter, 9745 mSDsCounter, 0 mSdLazyCounter, 12121 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 9960 SdHoareTripleChecker+Invalid, 13253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 12121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1089 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:22:47,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 9960 Invalid, 13253 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [43 Valid, 12121 Invalid, 0 Unknown, 1089 Unchecked, 10.2s Time] [2024-11-14 03:22:47,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27290 states. [2024-11-14 03:22:49,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27290 to 18924. [2024-11-14 03:22:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18924 states, 18892 states have (on average 2.9408215117510057) internal successors, (55558), 18923 states have internal predecessors, (55558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:22:49,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18924 states to 18924 states and 55558 transitions. [2024-11-14 03:22:49,770 INFO L78 Accepts]: Start accepts. Automaton has 18924 states and 55558 transitions. Word has length 78 [2024-11-14 03:22:49,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:22:49,770 INFO L471 AbstractCegarLoop]: Abstraction has 18924 states and 55558 transitions. [2024-11-14 03:22:49,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 2.8493150684931505) internal successors, (208), 73 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:22:49,770 INFO L276 IsEmpty]: Start isEmpty. Operand 18924 states and 55558 transitions. [2024-11-14 03:22:49,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-14 03:22:49,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:22:49,779 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-14 03:22:49,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2024-11-14 03:22:49,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2024-11-14 03:22:49,979 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:22:49,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:22:49,980 INFO L85 PathProgramCache]: Analyzing trace with hash 196629003, now seen corresponding path program 4 times [2024-11-14 03:22:49,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:22:49,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546655102] [2024-11-14 03:22:49,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:22:49,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:22:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:22:51,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:22:51,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546655102] [2024-11-14 03:22:51,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546655102] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:22:51,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396783295] [2024-11-14 03:22:51,366 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 03:22:51,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:22:51,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:22:51,368 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:22:51,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2024-11-14 03:22:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:51,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-14 03:22:51,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:22:51,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:22:51,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:22:51,956 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:22:51,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:22:51,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:22:51,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:22:52,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:22:52,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:22:52,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:22:52,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-14 03:22:52,714 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 03:22:52,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:22:53,289 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2496 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_2496) c_~o_0~0.base) (+ 16 c_~o_0~0.offset)) 2147483648)) is different from false [2024-11-14 03:22:53,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:22:53,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-11-14 03:22:53,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:22:53,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2024-11-14 03:22:53,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:22:54,350 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 22 trivial. 13 not checked. [2024-11-14 03:22:54,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396783295] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:22:54,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1465060656] [2024-11-14 03:22:54,351 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:22:54,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:22:54,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 48 [2024-11-14 03:22:54,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127057924] [2024-11-14 03:22:54,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:22:54,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-14 03:22:54,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:22:54,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-14 03:22:54,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2211, Unknown=1, NotChecked=94, Total=2450 [2024-11-14 03:22:54,353 INFO L87 Difference]: Start difference. First operand 18924 states and 55558 transitions. Second operand has 50 states, 49 states have (on average 2.816326530612245) internal successors, (138), 49 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:23:09,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:23:09,029 INFO L93 Difference]: Finished difference Result 26210 states and 73206 transitions. [2024-11-14 03:23:09,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-14 03:23:09,030 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.816326530612245) internal successors, (138), 49 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-14 03:23:09,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:23:09,108 INFO L225 Difference]: With dead ends: 26210 [2024-11-14 03:23:09,108 INFO L226 Difference]: Without dead ends: 26018 [2024-11-14 03:23:09,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 127 SyntacticMatches, 9 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1444 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=470, Invalid=6673, Unknown=1, NotChecked=166, Total=7310 [2024-11-14 03:23:09,118 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 1001 mSDsluCounter, 8796 mSDsCounter, 0 mSdLazyCounter, 11400 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 9081 SdHoareTripleChecker+Invalid, 12215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 11400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 771 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:23:09,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 9081 Invalid, 12215 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 11400 Invalid, 0 Unknown, 771 Unchecked, 9.9s Time] [2024-11-14 03:23:09,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26018 states. [2024-11-14 03:23:10,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26018 to 19308. [2024-11-14 03:23:11,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19308 states, 19276 states have (on average 2.9461506536625857) internal successors, (56790), 19307 states have internal predecessors, (56790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:23:11,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19308 states to 19308 states and 56790 transitions. [2024-11-14 03:23:11,066 INFO L78 Accepts]: Start accepts. Automaton has 19308 states and 56790 transitions. Word has length 78 [2024-11-14 03:23:11,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:23:11,066 INFO L471 AbstractCegarLoop]: Abstraction has 19308 states and 56790 transitions. [2024-11-14 03:23:11,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.816326530612245) internal successors, (138), 49 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:23:11,067 INFO L276 IsEmpty]: Start isEmpty. Operand 19308 states and 56790 transitions. [2024-11-14 03:23:11,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-14 03:23:11,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:23:11,079 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:23:11,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2024-11-14 03:23:11,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2024-11-14 03:23:11,280 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-14 03:23:11,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:23:11,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1005735996, now seen corresponding path program 4 times [2024-11-14 03:23:11,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:23:11,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917620209] [2024-11-14 03:23:11,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:23:11,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:23:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:23:13,287 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 12 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:23:13,287 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:23:13,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917620209] [2024-11-14 03:23:13,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917620209] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:23:13,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466889620] [2024-11-14 03:23:13,287 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 03:23:13,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:23:13,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:23:13,289 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:23:13,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd6569d-41ce-41ef-80a5-4432367afea0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2024-11-14 03:23:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:23:13,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-14 03:23:13,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:23:14,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:23:14,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-14 03:23:15,119 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:23:15,119 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:23:15,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-14 03:23:15,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-14 03:23:16,006 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-14 03:23:16,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466889620] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:23:16,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1317188201] [2024-11-14 03:23:16,006 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:23:16,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:23:16,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 23, 23] total 64 [2024-11-14 03:23:16,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104152522] [2024-11-14 03:23:16,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:23:16,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-14 03:23:16,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:23:16,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-14 03:23:16,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=3958, Unknown=0, NotChecked=0, Total=4160 [2024-11-14 03:23:16,009 INFO L87 Difference]: Start difference. First operand 19308 states and 56790 transitions. Second operand has 65 states, 64 states have (on average 2.84375) internal successors, (182), 65 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)