./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX --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 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:43:00,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:43:00,605 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-11-12 00:43:00,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:43:00,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:43:00,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:43:00,641 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:43:00,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:43:00,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:43:00,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:43:00,644 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:43:00,645 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:43:00,645 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:43:00,646 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:43:00,647 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:43:00,647 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:43:00,648 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:43:00,648 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:43:00,649 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:43:00,650 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:43:00,650 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:43:00,654 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:43:00,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:43:00,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:43:00,657 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:43:00,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:43:00,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:43:00,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:43:00,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:43:00,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:43:00,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:43:00,661 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-12 00:43:00,661 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:43:00,662 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:43:00,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:43:00,662 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:43:00,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:43:00,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:43:00,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:43:00,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:43:00,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:43:00,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:43:00,665 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:43:00,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:43:00,666 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:43:00,666 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:43:00,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:43:00,667 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX 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 -> 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 [2023-11-12 00:43:00,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:43:01,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:43:01,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:43:01,031 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:43:01,033 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:43:01,034 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2023-11-12 00:43:04,190 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:43:04,464 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:43:04,464 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2023-11-12 00:43:04,475 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/data/ba400174c/84bbcb0d44a741b4a5876a491698b21f/FLAG6871fda64 [2023-11-12 00:43:04,492 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/data/ba400174c/84bbcb0d44a741b4a5876a491698b21f [2023-11-12 00:43:04,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:43:04,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:43:04,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:43:04,507 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:43:04,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:43:04,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:43:04" (1/1) ... [2023-11-12 00:43:04,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f01c740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:04, skipping insertion in model container [2023-11-12 00:43:04,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:43:04" (1/1) ... [2023-11-12 00:43:04,552 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:43:04,815 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:43:04,826 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:43:04,856 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:43:04,873 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:43:04,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:04 WrapperNode [2023-11-12 00:43:04,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:43:04,875 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:43:04,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:43:04,876 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:43:04,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:04" (1/1) ... [2023-11-12 00:43:04,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:04" (1/1) ... [2023-11-12 00:43:04,925 INFO L138 Inliner]: procedures = 25, calls = 40, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 247 [2023-11-12 00:43:04,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:43:04,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:43:04,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:43:04,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:43:04,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:04" (1/1) ... [2023-11-12 00:43:04,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:04" (1/1) ... [2023-11-12 00:43:04,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:04" (1/1) ... [2023-11-12 00:43:04,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:04" (1/1) ... [2023-11-12 00:43:04,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:04" (1/1) ... [2023-11-12 00:43:04,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:04" (1/1) ... [2023-11-12 00:43:04,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:04" (1/1) ... [2023-11-12 00:43:04,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:04" (1/1) ... [2023-11-12 00:43:04,967 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:43:04,968 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:43:04,968 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:43:04,968 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:43:04,969 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:04" (1/1) ... [2023-11-12 00:43:04,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:43:05,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:43:05,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:43:05,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:43:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:43:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:43:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:43:05,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:43:05,075 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-12 00:43:05,075 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-12 00:43:05,075 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-12 00:43:05,076 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-12 00:43:05,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:43:05,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:43:05,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:43:05,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:43:05,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:43:05,078 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 00:43:05,199 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:43:05,201 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:43:05,692 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:43:05,710 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:43:05,710 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-12 00:43:05,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:43:05 BoogieIcfgContainer [2023-11-12 00:43:05,717 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:43:05,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:43:05,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:43:05,725 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:43:05,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:43:04" (1/3) ... [2023-11-12 00:43:05,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28397907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:43:05, skipping insertion in model container [2023-11-12 00:43:05,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:04" (2/3) ... [2023-11-12 00:43:05,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28397907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:43:05, skipping insertion in model container [2023-11-12 00:43:05,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:43:05" (3/3) ... [2023-11-12 00:43:05,731 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-symm.wvr.c [2023-11-12 00:43:05,741 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-12 00:43:05,751 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:43:05,751 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-11-12 00:43:05,751 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 00:43:05,919 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-12 00:43:05,961 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-12 00:43:05,976 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 314 places, 332 transitions, 678 flow [2023-11-12 00:43:05,979 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 314 places, 332 transitions, 678 flow [2023-11-12 00:43:05,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 314 places, 332 transitions, 678 flow [2023-11-12 00:43:06,144 INFO L124 PetriNetUnfolderBase]: 25/330 cut-off events. [2023-11-12 00:43:06,146 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-12 00:43:06,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 330 events. 25/330 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 641 event pairs, 0 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 206. Up to 3 conditions per place. [2023-11-12 00:43:06,171 INFO L119 LiptonReduction]: Number of co-enabled transitions 15552 [2023-11-12 00:43:22,709 INFO L134 LiptonReduction]: Checked pairs total: 19430 [2023-11-12 00:43:22,710 INFO L136 LiptonReduction]: Total number of compositions: 424 [2023-11-12 00:43:22,721 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 49 transitions, 112 flow [2023-11-12 00:43:22,771 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 478 states, 354 states have (on average 3.34180790960452) internal successors, (1183), 477 states have internal predecessors, (1183), 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) [2023-11-12 00:43:22,824 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:43:22,833 INFO L357 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, mHoare=true, 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;@1cf3f1f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:43:22,834 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2023-11-12 00:43:22,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 478 states, 354 states have (on average 3.34180790960452) internal successors, (1183), 477 states have internal predecessors, (1183), 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) [2023-11-12 00:43:22,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-12 00:43:22,845 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:22,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-12 00:43:22,847 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-12 00:43:22,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:22,855 INFO L85 PathProgramCache]: Analyzing trace with hash 44077, now seen corresponding path program 1 times [2023-11-12 00:43:22,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:22,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164480959] [2023-11-12 00:43:22,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:22,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:23,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:23,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164480959] [2023-11-12 00:43:23,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164480959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:43:23,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:43:23,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:43:23,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105222843] [2023-11-12 00:43:23,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:43:23,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:43:23,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:23,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:43:23,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:43:23,251 INFO L87 Difference]: Start difference. First operand has 478 states, 354 states have (on average 3.34180790960452) internal successors, (1183), 477 states have internal predecessors, (1183), 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 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-12 00:43:23,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:23,430 INFO L93 Difference]: Finished difference Result 364 states and 897 transitions. [2023-11-12 00:43:23,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:43:23,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-12 00:43:23,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:23,459 INFO L225 Difference]: With dead ends: 364 [2023-11-12 00:43:23,459 INFO L226 Difference]: Without dead ends: 364 [2023-11-12 00:43:23,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:43:23,465 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:23,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:43:23,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2023-11-12 00:43:23,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2023-11-12 00:43:23,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 280 states have (on average 3.2035714285714287) internal successors, (897), 363 states have internal predecessors, (897), 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) [2023-11-12 00:43:23,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 897 transitions. [2023-11-12 00:43:23,530 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 897 transitions. Word has length 2 [2023-11-12 00:43:23,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:23,530 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 897 transitions. [2023-11-12 00:43:23,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-12 00:43:23,531 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 897 transitions. [2023-11-12 00:43:23,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-12 00:43:23,531 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:23,532 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-12 00:43:23,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:43:23,532 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-12 00:43:23,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:23,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1369327, now seen corresponding path program 1 times [2023-11-12 00:43:23,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:23,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015419241] [2023-11-12 00:43:23,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:23,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:23,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:23,660 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:23,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015419241] [2023-11-12 00:43:23,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015419241] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:43:23,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405953620] [2023-11-12 00:43:23,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:23,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:43:23,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:43:23,664 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:43:23,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:43:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:23,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 00:43:23,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:43:23,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:23,804 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:43:23,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:23,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405953620] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:43:23,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1009293261] [2023-11-12 00:43:23,839 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:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) 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) [2023-11-12 00:43:23,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:43:23,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2023-11-12 00:43:23,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171320393] [2023-11-12 00:43:23,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:43:23,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:43:23,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:23,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:43:23,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:43:23,849 INFO L87 Difference]: Start difference. First operand 364 states and 897 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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) [2023-11-12 00:43:24,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:24,079 INFO L93 Difference]: Finished difference Result 370 states and 915 transitions. [2023-11-12 00:43:24,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:43:24,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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 3 [2023-11-12 00:43:24,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:24,084 INFO L225 Difference]: With dead ends: 370 [2023-11-12 00:43:24,084 INFO L226 Difference]: Without dead ends: 370 [2023-11-12 00:43:24,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:43:24,086 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:24,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:43:24,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2023-11-12 00:43:24,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2023-11-12 00:43:24,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 286 states have (on average 3.199300699300699) internal successors, (915), 369 states have internal predecessors, (915), 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) [2023-11-12 00:43:24,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 915 transitions. [2023-11-12 00:43:24,112 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 915 transitions. Word has length 3 [2023-11-12 00:43:24,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:24,113 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 915 transitions. [2023-11-12 00:43:24,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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) [2023-11-12 00:43:24,113 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 915 transitions. [2023-11-12 00:43:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-12 00:43:24,114 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:24,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-12 00:43:24,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:43:24,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-12 00:43:24,320 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-12 00:43:24,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:24,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1369298, now seen corresponding path program 1 times [2023-11-12 00:43:24,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:24,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345510238] [2023-11-12 00:43:24,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:24,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:24,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:24,425 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:24,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345510238] [2023-11-12 00:43:24,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345510238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:43:24,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:43:24,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:43:24,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847048792] [2023-11-12 00:43:24,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:43:24,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:43:24,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:24,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:43:24,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:43:24,428 INFO L87 Difference]: Start difference. First operand 370 states and 915 transitions. Second operand has 3 states, 2 states have (on average 1.5) 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) [2023-11-12 00:43:24,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:24,514 INFO L93 Difference]: Finished difference Result 368 states and 907 transitions. [2023-11-12 00:43:24,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:43:24,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) 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 [2023-11-12 00:43:24,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:24,518 INFO L225 Difference]: With dead ends: 368 [2023-11-12 00:43:24,519 INFO L226 Difference]: Without dead ends: 368 [2023-11-12 00:43:24,519 INFO L412 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 [2023-11-12 00:43:24,521 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:24,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:43:24,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2023-11-12 00:43:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2023-11-12 00:43:24,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 286 states have (on average 3.1713286713286712) internal successors, (907), 367 states have internal predecessors, (907), 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) [2023-11-12 00:43:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 907 transitions. [2023-11-12 00:43:24,548 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 907 transitions. Word has length 3 [2023-11-12 00:43:24,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:24,548 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 907 transitions. [2023-11-12 00:43:24,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) 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) [2023-11-12 00:43:24,549 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 907 transitions. [2023-11-12 00:43:24,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:43:24,549 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:24,549 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:43:24,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:43:24,550 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-12 00:43:24,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:24,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1316696165, now seen corresponding path program 1 times [2023-11-12 00:43:24,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:24,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888005175] [2023-11-12 00:43:24,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:24,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:24,741 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:24,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888005175] [2023-11-12 00:43:24,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888005175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:43:24,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:43:24,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:43:24,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409872209] [2023-11-12 00:43:24,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:43:24,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:43:24,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:24,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:43:24,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:43:24,744 INFO L87 Difference]: Start difference. First operand 368 states and 907 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2023-11-12 00:43:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:24,916 INFO L93 Difference]: Finished difference Result 623 states and 1583 transitions. [2023-11-12 00:43:24,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:43:24,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2023-11-12 00:43:24,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:24,923 INFO L225 Difference]: With dead ends: 623 [2023-11-12 00:43:24,923 INFO L226 Difference]: Without dead ends: 623 [2023-11-12 00:43:24,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:43:24,925 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 99 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:24,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:43:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2023-11-12 00:43:24,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 435. [2023-11-12 00:43:24,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 353 states have (on average 3.13314447592068) internal successors, (1106), 434 states have internal predecessors, (1106), 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) [2023-11-12 00:43:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1106 transitions. [2023-11-12 00:43:24,947 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1106 transitions. Word has length 5 [2023-11-12 00:43:24,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:24,947 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 1106 transitions. [2023-11-12 00:43:24,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2023-11-12 00:43:24,947 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1106 transitions. [2023-11-12 00:43:24,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:43:24,948 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:24,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:43:24,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:43:24,949 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-12 00:43:24,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:24,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1316696166, now seen corresponding path program 1 times [2023-11-12 00:43:24,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:24,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251513367] [2023-11-12 00:43:24,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:24,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:25,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:25,088 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:25,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251513367] [2023-11-12 00:43:25,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251513367] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:43:25,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:43:25,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:43:25,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745003423] [2023-11-12 00:43:25,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:43:25,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:43:25,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:25,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:43:25,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:43:25,090 INFO L87 Difference]: Start difference. First operand 435 states and 1106 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-12 00:43:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:25,252 INFO L93 Difference]: Finished difference Result 759 states and 1948 transitions. [2023-11-12 00:43:25,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:43:25,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2023-11-12 00:43:25,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:25,260 INFO L225 Difference]: With dead ends: 759 [2023-11-12 00:43:25,261 INFO L226 Difference]: Without dead ends: 759 [2023-11-12 00:43:25,261 INFO L412 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 [2023-11-12 00:43:25,262 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 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 [2023-11-12 00:43:25,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:43:25,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2023-11-12 00:43:25,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 570. [2023-11-12 00:43:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 490 states have (on average 3.0020408163265304) internal successors, (1471), 569 states have internal predecessors, (1471), 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) [2023-11-12 00:43:25,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1471 transitions. [2023-11-12 00:43:25,289 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1471 transitions. Word has length 5 [2023-11-12 00:43:25,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:25,290 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 1471 transitions. [2023-11-12 00:43:25,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-12 00:43:25,290 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1471 transitions. [2023-11-12 00:43:25,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:43:25,291 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:25,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:43:25,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:43:25,292 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-12 00:43:25,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:25,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2131928046, now seen corresponding path program 1 times [2023-11-12 00:43:25,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:25,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930764741] [2023-11-12 00:43:25,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:25,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:25,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:25,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930764741] [2023-11-12 00:43:25,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930764741] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:43:25,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806546889] [2023-11-12 00:43:25,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:25,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:43:25,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:43:25,413 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:43:25,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:43:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:25,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:43:25,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:43:25,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:43:25,554 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:43:25,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806546889] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:43:25,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:43:25,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2023-11-12 00:43:25,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764861227] [2023-11-12 00:43:25,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:43:25,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:43:25,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:25,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:43:25,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:43:25,557 INFO L87 Difference]: Start difference. First operand 570 states and 1471 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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) [2023-11-12 00:43:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:25,624 INFO L93 Difference]: Finished difference Result 488 states and 1217 transitions. [2023-11-12 00:43:25,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:43:25,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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 [2023-11-12 00:43:25,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:25,629 INFO L225 Difference]: With dead ends: 488 [2023-11-12 00:43:25,629 INFO L226 Difference]: Without dead ends: 488 [2023-11-12 00:43:25,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:43:25,630 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:25,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:43:25,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2023-11-12 00:43:25,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 358. [2023-11-12 00:43:25,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 301 states have (on average 2.8870431893687707) internal successors, (869), 357 states have internal predecessors, (869), 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) [2023-11-12 00:43:25,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 869 transitions. [2023-11-12 00:43:25,646 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 869 transitions. Word has length 6 [2023-11-12 00:43:25,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:25,646 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 869 transitions. [2023-11-12 00:43:25,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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) [2023-11-12 00:43:25,647 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 869 transitions. [2023-11-12 00:43:25,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:43:25,647 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:25,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:43:25,654 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:43:25,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-12 00:43:25,854 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-12 00:43:25,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:25,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2142513252, now seen corresponding path program 1 times [2023-11-12 00:43:25,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:25,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168927414] [2023-11-12 00:43:25,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:25,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:25,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:25,955 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:25,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168927414] [2023-11-12 00:43:25,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168927414] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:43:25,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615619259] [2023-11-12 00:43:25,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:25,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:43:25,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:43:25,957 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:43:25,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:43:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:26,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:43:26,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:43:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:43:26,096 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:43:26,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615619259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:43:26,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:43:26,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-11-12 00:43:26,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230846742] [2023-11-12 00:43:26,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:43:26,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:43:26,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:26,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:43:26,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:43:26,099 INFO L87 Difference]: Start difference. First operand 358 states and 869 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2023-11-12 00:43:26,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:26,162 INFO L93 Difference]: Finished difference Result 312 states and 754 transitions. [2023-11-12 00:43:26,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:43:26,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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 [2023-11-12 00:43:26,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:26,165 INFO L225 Difference]: With dead ends: 312 [2023-11-12 00:43:26,166 INFO L226 Difference]: Without dead ends: 312 [2023-11-12 00:43:26,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:43:26,167 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:26,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:43:26,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2023-11-12 00:43:26,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 242. [2023-11-12 00:43:26,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 199 states have (on average 2.969849246231156) internal successors, (591), 241 states have internal predecessors, (591), 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) [2023-11-12 00:43:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 591 transitions. [2023-11-12 00:43:26,177 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 591 transitions. Word has length 6 [2023-11-12 00:43:26,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:26,178 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 591 transitions. [2023-11-12 00:43:26,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2023-11-12 00:43:26,178 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 591 transitions. [2023-11-12 00:43:26,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:43:26,178 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:26,179 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1] [2023-11-12 00:43:26,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:43:26,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-12 00:43:26,384 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-12 00:43:26,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:26,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2141834413, now seen corresponding path program 2 times [2023-11-12 00:43:26,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:26,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685414280] [2023-11-12 00:43:26,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:26,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:26,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:26,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:26,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685414280] [2023-11-12 00:43:26,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685414280] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:43:26,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645339352] [2023-11-12 00:43:26,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:43:26,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:43:26,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:43:26,512 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:43:26,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:43:26,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-12 00:43:26,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:43:26,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 00:43:26,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:43:26,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-12 00:43:26,627 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:43:26,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645339352] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:43:26,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:43:26,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2023-11-12 00:43:26,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039219812] [2023-11-12 00:43:26,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:43:26,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:43:26,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:26,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:43:26,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:43:26,630 INFO L87 Difference]: Start difference. First operand 242 states and 591 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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) [2023-11-12 00:43:26,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:26,732 INFO L93 Difference]: Finished difference Result 241 states and 590 transitions. [2023-11-12 00:43:26,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:43:26,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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 6 [2023-11-12 00:43:26,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:26,735 INFO L225 Difference]: With dead ends: 241 [2023-11-12 00:43:26,735 INFO L226 Difference]: Without dead ends: 241 [2023-11-12 00:43:26,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:43:26,736 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:26,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:43:26,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-11-12 00:43:26,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 237. [2023-11-12 00:43:26,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 195 states have (on average 2.9846153846153847) internal successors, (582), 236 states have internal predecessors, (582), 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) [2023-11-12 00:43:26,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 582 transitions. [2023-11-12 00:43:26,746 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 582 transitions. Word has length 6 [2023-11-12 00:43:26,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:26,747 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 582 transitions. [2023-11-12 00:43:26,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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) [2023-11-12 00:43:26,747 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 582 transitions. [2023-11-12 00:43:26,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:43:26,748 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:26,748 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1] [2023-11-12 00:43:26,761 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 00:43:26,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-12 00:43:26,954 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-12 00:43:26,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:26,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1665090771, now seen corresponding path program 1 times [2023-11-12 00:43:26,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:26,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857793497] [2023-11-12 00:43:26,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:26,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:27,055 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:27,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857793497] [2023-11-12 00:43:27,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857793497] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:43:27,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573436365] [2023-11-12 00:43:27,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:27,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:43:27,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:43:27,058 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:43:27,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 00:43:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:27,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-12 00:43:27,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:43:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:27,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:43:27,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:27,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573436365] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:43:27,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [64912612] [2023-11-12 00:43:27,260 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:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) 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) [2023-11-12 00:43:27,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:43:27,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-11-12 00:43:27,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567007652] [2023-11-12 00:43:27,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:43:27,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-12 00:43:27,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:27,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-12 00:43:27,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-12 00:43:27,264 INFO L87 Difference]: Start difference. First operand 237 states and 582 transitions. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 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) [2023-11-12 00:43:27,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:27,454 INFO L93 Difference]: Finished difference Result 253 states and 614 transitions. [2023-11-12 00:43:27,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 00:43:27,454 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 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 [2023-11-12 00:43:27,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:27,457 INFO L225 Difference]: With dead ends: 253 [2023-11-12 00:43:27,457 INFO L226 Difference]: Without dead ends: 253 [2023-11-12 00:43:27,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-12 00:43:27,458 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:27,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:43:27,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-11-12 00:43:27,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 243. [2023-11-12 00:43:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 201 states have (on average 2.955223880597015) internal successors, (594), 242 states have internal predecessors, (594), 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) [2023-11-12 00:43:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 594 transitions. [2023-11-12 00:43:27,469 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 594 transitions. Word has length 7 [2023-11-12 00:43:27,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:27,469 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 594 transitions. [2023-11-12 00:43:27,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 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) [2023-11-12 00:43:27,470 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 594 transitions. [2023-11-12 00:43:27,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:43:27,470 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:27,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:43:27,481 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-12 00:43:27,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-12 00:43:27,676 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-12 00:43:27,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:27,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1670269498, now seen corresponding path program 1 times [2023-11-12 00:43:27,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:27,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572966418] [2023-11-12 00:43:27,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:27,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:27,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:27,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:27,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572966418] [2023-11-12 00:43:27,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572966418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:43:27,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:43:27,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:43:27,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546092241] [2023-11-12 00:43:27,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:43:27,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:43:27,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:27,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:43:27,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:43:27,720 INFO L87 Difference]: Start difference. First operand 243 states and 594 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-11-12 00:43:27,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:27,823 INFO L93 Difference]: Finished difference Result 417 states and 1029 transitions. [2023-11-12 00:43:27,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:43:27,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 [2023-11-12 00:43:27,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:27,828 INFO L225 Difference]: With dead ends: 417 [2023-11-12 00:43:27,828 INFO L226 Difference]: Without dead ends: 417 [2023-11-12 00:43:27,828 INFO L412 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 [2023-11-12 00:43:27,829 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:27,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:43:27,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2023-11-12 00:43:27,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 279. [2023-11-12 00:43:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 237 states have (on average 3.021097046413502) internal successors, (716), 278 states have internal predecessors, (716), 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) [2023-11-12 00:43:27,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 716 transitions. [2023-11-12 00:43:27,858 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 716 transitions. Word has length 7 [2023-11-12 00:43:27,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:27,859 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 716 transitions. [2023-11-12 00:43:27,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-11-12 00:43:27,859 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 716 transitions. [2023-11-12 00:43:27,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 00:43:27,860 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:27,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:43:27,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 00:43:27,861 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-12 00:43:27,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:27,861 INFO L85 PathProgramCache]: Analyzing trace with hash -237632539, now seen corresponding path program 1 times [2023-11-12 00:43:27,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:27,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493108411] [2023-11-12 00:43:27,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:27,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:27,956 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:27,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493108411] [2023-11-12 00:43:27,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493108411] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:43:27,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:43:27,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:43:27,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182310370] [2023-11-12 00:43:27,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:43:27,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:43:27,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:27,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:43:27,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:43:27,961 INFO L87 Difference]: Start difference. First operand 279 states and 716 transitions. Second operand has 5 states, 4 states have (on average 2.0) 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) [2023-11-12 00:43:28,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:28,141 INFO L93 Difference]: Finished difference Result 407 states and 1001 transitions. [2023-11-12 00:43:28,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:43:28,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) 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 [2023-11-12 00:43:28,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:28,145 INFO L225 Difference]: With dead ends: 407 [2023-11-12 00:43:28,145 INFO L226 Difference]: Without dead ends: 397 [2023-11-12 00:43:28,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:43:28,146 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:28,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:43:28,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2023-11-12 00:43:28,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 370. [2023-11-12 00:43:28,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 328 states have (on average 2.8353658536585367) internal successors, (930), 369 states have internal predecessors, (930), 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) [2023-11-12 00:43:28,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 930 transitions. [2023-11-12 00:43:28,162 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 930 transitions. Word has length 8 [2023-11-12 00:43:28,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:28,162 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 930 transitions. [2023-11-12 00:43:28,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) 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) [2023-11-12 00:43:28,163 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 930 transitions. [2023-11-12 00:43:28,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:43:28,164 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:28,164 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:43:28,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 00:43:28,165 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-12 00:43:28,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:28,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1188839773, now seen corresponding path program 1 times [2023-11-12 00:43:28,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:28,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908929109] [2023-11-12 00:43:28,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:28,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:28,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:43:28,295 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:28,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908929109] [2023-11-12 00:43:28,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908929109] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:43:28,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:43:28,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:43:28,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396628125] [2023-11-12 00:43:28,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:43:28,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:43:28,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:28,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:43:28,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:43:28,297 INFO L87 Difference]: Start difference. First operand 370 states and 930 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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) [2023-11-12 00:43:28,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:28,437 INFO L93 Difference]: Finished difference Result 309 states and 768 transitions. [2023-11-12 00:43:28,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:43:28,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 [2023-11-12 00:43:28,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:28,440 INFO L225 Difference]: With dead ends: 309 [2023-11-12 00:43:28,441 INFO L226 Difference]: Without dead ends: 292 [2023-11-12 00:43:28,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:43:28,442 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:28,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:43:28,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-11-12 00:43:28,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2023-11-12 00:43:28,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 249 states have (on average 2.931726907630522) internal successors, (730), 290 states have internal predecessors, (730), 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) [2023-11-12 00:43:28,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 730 transitions. [2023-11-12 00:43:28,456 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 730 transitions. Word has length 9 [2023-11-12 00:43:28,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:28,456 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 730 transitions. [2023-11-12 00:43:28,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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) [2023-11-12 00:43:28,457 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 730 transitions. [2023-11-12 00:43:28,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:43:28,457 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:28,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:43:28,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 00:43:28,458 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-12 00:43:28,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:28,458 INFO L85 PathProgramCache]: Analyzing trace with hash 106504999, now seen corresponding path program 1 times [2023-11-12 00:43:28,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:28,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356143663] [2023-11-12 00:43:28,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:28,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:28,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:43:28,595 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:28,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356143663] [2023-11-12 00:43:28,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356143663] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:43:28,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:43:28,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:43:28,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119115220] [2023-11-12 00:43:28,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:43:28,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:43:28,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:28,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:43:28,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:43:28,598 INFO L87 Difference]: Start difference. First operand 291 states and 730 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2023-11-12 00:43:28,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:28,766 INFO L93 Difference]: Finished difference Result 406 states and 990 transitions. [2023-11-12 00:43:28,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:43:28,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 [2023-11-12 00:43:28,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:28,771 INFO L225 Difference]: With dead ends: 406 [2023-11-12 00:43:28,771 INFO L226 Difference]: Without dead ends: 396 [2023-11-12 00:43:28,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:43:28,772 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:28,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:43:28,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2023-11-12 00:43:28,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 370. [2023-11-12 00:43:28,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 328 states have (on average 2.801829268292683) internal successors, (919), 369 states have internal predecessors, (919), 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) [2023-11-12 00:43:28,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 919 transitions. [2023-11-12 00:43:28,789 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 919 transitions. Word has length 9 [2023-11-12 00:43:28,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:28,790 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 919 transitions. [2023-11-12 00:43:28,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2023-11-12 00:43:28,790 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 919 transitions. [2023-11-12 00:43:28,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:43:28,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:28,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:43:28,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 00:43:28,792 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-12 00:43:28,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:28,792 INFO L85 PathProgramCache]: Analyzing trace with hash -505453034, now seen corresponding path program 1 times [2023-11-12 00:43:28,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:28,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174924000] [2023-11-12 00:43:28,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:28,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:29,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:29,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174924000] [2023-11-12 00:43:29,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174924000] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:43:29,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163599496] [2023-11-12 00:43:29,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:29,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:43:29,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:43:29,319 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:43:29,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-12 00:43:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:29,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-12 00:43:29,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:43:29,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:29,505 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-12 00:43:29,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:29,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:29,524 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-12 00:43:29,586 INFO L351 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 [2023-11-12 00:43:29,644 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:43:29,644 INFO L351 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 [2023-11-12 00:43:29,689 INFO L351 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 [2023-11-12 00:43:29,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:29,733 INFO L351 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 [2023-11-12 00:43:29,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:29,772 INFO L351 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 [2023-11-12 00:43:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:29,786 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:43:29,996 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:29,997 INFO L351 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 30 treesize of output 31 [2023-11-12 00:43:30,019 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:30,019 INFO L351 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 279 treesize of output 271 [2023-11-12 00:43:30,040 INFO L351 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 124 treesize of output 120 [2023-11-12 00:43:30,052 INFO L351 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 120 treesize of output 112 [2023-11-12 00:43:30,065 INFO L351 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 56 treesize of output 54 [2023-11-12 00:43:30,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:30,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163599496] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:43:30,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1604755674] [2023-11-12 00:43:30,237 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:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) 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) [2023-11-12 00:43:30,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:43:30,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-11-12 00:43:30,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994777666] [2023-11-12 00:43:30,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:43:30,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-12 00:43:30,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:30,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-12 00:43:30,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=327, Unknown=7, NotChecked=0, Total=420 [2023-11-12 00:43:30,241 INFO L87 Difference]: Start difference. First operand 370 states and 919 transitions. Second operand has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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) [2023-11-12 00:43:30,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:30,726 INFO L93 Difference]: Finished difference Result 517 states and 1306 transitions. [2023-11-12 00:43:30,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:43:30,727 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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 10 [2023-11-12 00:43:30,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:30,731 INFO L225 Difference]: With dead ends: 517 [2023-11-12 00:43:30,732 INFO L226 Difference]: Without dead ends: 517 [2023-11-12 00:43:30,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=389, Unknown=7, NotChecked=0, Total=506 [2023-11-12 00:43:30,733 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 128 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:30,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 0 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 00:43:30,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2023-11-12 00:43:30,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 400. [2023-11-12 00:43:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 358 states have (on average 3.1145251396648046) internal successors, (1115), 399 states have internal predecessors, (1115), 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) [2023-11-12 00:43:30,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1115 transitions. [2023-11-12 00:43:30,750 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1115 transitions. Word has length 10 [2023-11-12 00:43:30,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:30,751 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 1115 transitions. [2023-11-12 00:43:30,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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) [2023-11-12 00:43:30,752 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1115 transitions. [2023-11-12 00:43:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:43:30,755 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:30,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:43:30,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-12 00:43:30,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-12 00:43:30,961 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-12 00:43:30,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:30,962 INFO L85 PathProgramCache]: Analyzing trace with hash -505453032, now seen corresponding path program 1 times [2023-11-12 00:43:30,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:30,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27850528] [2023-11-12 00:43:30,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:30,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:31,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:43:31,539 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:31,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27850528] [2023-11-12 00:43:31,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27850528] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:43:31,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907355653] [2023-11-12 00:43:31,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:31,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:43:31,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:43:31,540 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:43:31,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-12 00:43:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:31,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-12 00:43:31,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:43:31,718 INFO L351 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 [2023-11-12 00:43:31,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:31,766 INFO L351 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 [2023-11-12 00:43:31,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:31,802 INFO L351 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 [2023-11-12 00:43:31,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:43:31,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:43:32,132 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_294 (Array Int Int)) (~a1~0.base Int) (~a1~0.offset Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_294))) (let ((.cse1 (select (select .cse0 ~a1~0.base) ~a1~0.offset))) (or (< (select (select .cse0 c_~a2~0.base) c_~a2~0.offset) (+ 2147483648 .cse1)) (< 9223372039002259455 .cse1) (< .cse1 1))))) (forall ((v_ArrVal_294 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_294))) (or (forall ((~a1~0.base Int) (~a1~0.offset Int)) (not (= 0 (select (select .cse2 ~a1~0.base) ~a1~0.offset)))) (< (select (select .cse2 c_~a2~0.base) c_~a2~0.offset) 2147483648))))) is different from false [2023-11-12 00:43:32,201 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_294))) (or (< (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648) (forall ((~a1~0.base Int) (~a1~0.offset Int)) (not (= (select (select .cse0 ~a1~0.base) ~a1~0.offset) 0)))))) (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (~a1~0.base Int) (~a1~0.offset Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_294))) (let ((.cse1 (select (select .cse2 ~a1~0.base) ~a1~0.offset))) (or (< .cse1 1) (< 9223372039002259455 .cse1) (< (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse1 2147483648))))))) is different from false [2023-11-12 00:43:32,231 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:32,232 INFO L351 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 153 treesize of output 94 [2023-11-12 00:43:32,300 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:32,301 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 981 treesize of output 956 [2023-11-12 00:43:32,378 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:32,379 INFO L351 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 473 treesize of output 478 [2023-11-12 00:43:32,425 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:32,426 INFO L351 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 469 treesize of output 470 [2023-11-12 00:43:32,470 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:32,470 INFO L351 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 461 treesize of output 450 [2023-11-12 00:43:32,512 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:32,513 INFO L351 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 441 treesize of output 410 [2023-11-12 00:43:35,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-12 00:43:35,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907355653] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:43:35,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [443305550] [2023-11-12 00:43:35,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:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) 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) [2023-11-12 00:43:35,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:43:35,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-11-12 00:43:35,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820199471] [2023-11-12 00:43:35,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:43:35,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-12 00:43:35,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:35,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-12 00:43:35,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=171, Unknown=2, NotChecked=54, Total=272 [2023-11-12 00:43:35,353 INFO L87 Difference]: Start difference. First operand 400 states and 1115 transitions. Second operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 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) [2023-11-12 00:43:36,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:36,043 INFO L93 Difference]: Finished difference Result 512 states and 1267 transitions. [2023-11-12 00:43:36,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:43:36,044 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 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 10 [2023-11-12 00:43:36,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:36,048 INFO L225 Difference]: With dead ends: 512 [2023-11-12 00:43:36,048 INFO L226 Difference]: Without dead ends: 512 [2023-11-12 00:43:36,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=298, Unknown=2, NotChecked=74, Total=462 [2023-11-12 00:43:36,049 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 213 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:36,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 0 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 455 Invalid, 0 Unknown, 177 Unchecked, 0.5s Time] [2023-11-12 00:43:36,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2023-11-12 00:43:36,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 400. [2023-11-12 00:43:36,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 358 states have (on average 3.03072625698324) internal successors, (1085), 399 states have internal predecessors, (1085), 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) [2023-11-12 00:43:36,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1085 transitions. [2023-11-12 00:43:36,065 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1085 transitions. Word has length 10 [2023-11-12 00:43:36,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:36,066 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 1085 transitions. [2023-11-12 00:43:36,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 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) [2023-11-12 00:43:36,066 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1085 transitions. [2023-11-12 00:43:36,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:43:36,067 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:36,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:43:36,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-12 00:43:36,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-12 00:43:36,281 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-12 00:43:36,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:36,281 INFO L85 PathProgramCache]: Analyzing trace with hash -505453031, now seen corresponding path program 1 times [2023-11-12 00:43:36,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:36,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158494679] [2023-11-12 00:43:36,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:36,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:36,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:43:36,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:36,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158494679] [2023-11-12 00:43:36,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158494679] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:43:36,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935478763] [2023-11-12 00:43:36,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:36,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:43:36,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:43:36,747 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:43:36,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-12 00:43:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:36,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-12 00:43:36,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:43:36,928 INFO L351 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 [2023-11-12 00:43:36,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:36,972 INFO L351 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 [2023-11-12 00:43:37,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:37,010 INFO L351 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 [2023-11-12 00:43:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:43:37,023 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:43:37,062 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_330 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_330) c_~a2~0.base) c_~a2~0.offset)))) is different from false [2023-11-12 00:43:37,116 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:37,116 INFO L351 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 27 treesize of output 28 [2023-11-12 00:43:37,137 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:37,137 INFO L351 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 73 treesize of output 69 [2023-11-12 00:43:37,154 INFO L351 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 56 treesize of output 52 [2023-11-12 00:43:37,160 INFO L351 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 [2023-11-12 00:43:37,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:43:37,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935478763] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:43:37,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [955174747] [2023-11-12 00:43:37,253 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:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) 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) [2023-11-12 00:43:37,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:43:37,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-11-12 00:43:37,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015420255] [2023-11-12 00:43:37,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:43:37,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-12 00:43:37,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:37,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-12 00:43:37,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=196, Unknown=1, NotChecked=28, Total=272 [2023-11-12 00:43:37,260 INFO L87 Difference]: Start difference. First operand 400 states and 1085 transitions. Second operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 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) [2023-11-12 00:43:37,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:37,803 INFO L93 Difference]: Finished difference Result 482 states and 1187 transitions. [2023-11-12 00:43:37,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:43:37,803 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 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 10 [2023-11-12 00:43:37,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:37,807 INFO L225 Difference]: With dead ends: 482 [2023-11-12 00:43:37,808 INFO L226 Difference]: Without dead ends: 482 [2023-11-12 00:43:37,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=332, Unknown=1, NotChecked=38, Total=462 [2023-11-12 00:43:37,809 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 160 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:37,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 0 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 483 Invalid, 0 Unknown, 87 Unchecked, 0.4s Time] [2023-11-12 00:43:37,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2023-11-12 00:43:37,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 400. [2023-11-12 00:43:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 358 states have (on average 2.946927374301676) internal successors, (1055), 399 states have internal predecessors, (1055), 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) [2023-11-12 00:43:37,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1055 transitions. [2023-11-12 00:43:37,825 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1055 transitions. Word has length 10 [2023-11-12 00:43:37,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:37,825 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 1055 transitions. [2023-11-12 00:43:37,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 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) [2023-11-12 00:43:37,826 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1055 transitions. [2023-11-12 00:43:37,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:43:37,826 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:37,826 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:43:37,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-12 00:43:38,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-12 00:43:38,033 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-12 00:43:38,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:38,033 INFO L85 PathProgramCache]: Analyzing trace with hash -505453079, now seen corresponding path program 1 times [2023-11-12 00:43:38,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:38,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092954238] [2023-11-12 00:43:38,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:38,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:38,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:38,537 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:38,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092954238] [2023-11-12 00:43:38,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092954238] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:43:38,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587041146] [2023-11-12 00:43:38,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:38,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:43:38,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:43:38,540 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:43:38,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-12 00:43:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:38,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-12 00:43:38,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:43:38,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:38,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:38,705 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-12 00:43:38,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:38,716 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-12 00:43:38,744 INFO L351 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 [2023-11-12 00:43:38,789 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:43:38,790 INFO L351 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 [2023-11-12 00:43:38,832 INFO L351 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 [2023-11-12 00:43:38,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:38,868 INFO L351 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 [2023-11-12 00:43:38,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:38,905 INFO L351 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 [2023-11-12 00:43:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:38,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:43:38,953 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_369 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_369) c_~a1~0.base) c_~a1~0.offset) 9223372039002259456)) is different from false [2023-11-12 00:43:39,091 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:39,091 INFO L351 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 28 treesize of output 29 [2023-11-12 00:43:39,103 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:39,103 INFO L351 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 245 treesize of output 237 [2023-11-12 00:43:39,115 INFO L351 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 108 treesize of output 100 [2023-11-12 00:43:39,123 INFO L351 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 49 treesize of output 47 [2023-11-12 00:43:39,131 INFO L351 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 50 treesize of output 46 [2023-11-12 00:43:39,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:39,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587041146] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:43:39,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [699860660] [2023-11-12 00:43:39,327 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:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) 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) [2023-11-12 00:43:39,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:43:39,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-11-12 00:43:39,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381504179] [2023-11-12 00:43:39,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:43:39,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-12 00:43:39,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:39,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-12 00:43:39,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=295, Unknown=10, NotChecked=36, Total=420 [2023-11-12 00:43:39,331 INFO L87 Difference]: Start difference. First operand 400 states and 1055 transitions. Second operand has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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) [2023-11-12 00:43:39,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:39,787 INFO L93 Difference]: Finished difference Result 427 states and 1066 transitions. [2023-11-12 00:43:39,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:43:39,787 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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 10 [2023-11-12 00:43:39,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:39,791 INFO L225 Difference]: With dead ends: 427 [2023-11-12 00:43:39,791 INFO L226 Difference]: Without dead ends: 427 [2023-11-12 00:43:39,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=355, Unknown=10, NotChecked=40, Total=506 [2023-11-12 00:43:39,792 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 141 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:39,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 0 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 406 Invalid, 0 Unknown, 69 Unchecked, 0.4s Time] [2023-11-12 00:43:39,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2023-11-12 00:43:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 400. [2023-11-12 00:43:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 358 states have (on average 2.863128491620112) internal successors, (1025), 399 states have internal predecessors, (1025), 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) [2023-11-12 00:43:39,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1025 transitions. [2023-11-12 00:43:39,805 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1025 transitions. Word has length 10 [2023-11-12 00:43:39,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:39,806 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 1025 transitions. [2023-11-12 00:43:39,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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) [2023-11-12 00:43:39,806 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1025 transitions. [2023-11-12 00:43:39,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:43:39,807 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:39,807 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:43:39,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-12 00:43:40,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-12 00:43:40,013 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-12 00:43:40,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:40,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1027798437, now seen corresponding path program 1 times [2023-11-12 00:43:40,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:40,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385870545] [2023-11-12 00:43:40,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:40,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 00:43:40,097 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:40,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385870545] [2023-11-12 00:43:40,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385870545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:43:40,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:43:40,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:43:40,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357020405] [2023-11-12 00:43:40,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:43:40,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:43:40,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:40,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:43:40,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:43:40,099 INFO L87 Difference]: Start difference. First operand 400 states and 1025 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2023-11-12 00:43:40,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:40,210 INFO L93 Difference]: Finished difference Result 338 states and 863 transitions. [2023-11-12 00:43:40,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:43:40,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2023-11-12 00:43:40,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:40,213 INFO L225 Difference]: With dead ends: 338 [2023-11-12 00:43:40,213 INFO L226 Difference]: Without dead ends: 321 [2023-11-12 00:43:40,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:43:40,214 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:40,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:43:40,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-11-12 00:43:40,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2023-11-12 00:43:40,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 279 states have (on average 2.992831541218638) internal successors, (835), 320 states have internal predecessors, (835), 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) [2023-11-12 00:43:40,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 835 transitions. [2023-11-12 00:43:40,225 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 835 transitions. Word has length 10 [2023-11-12 00:43:40,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:40,226 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 835 transitions. [2023-11-12 00:43:40,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2023-11-12 00:43:40,226 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 835 transitions. [2023-11-12 00:43:40,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:43:40,227 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:40,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:43:40,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-12 00:43:40,227 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-12 00:43:40,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:40,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1510824624, now seen corresponding path program 1 times [2023-11-12 00:43:40,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:40,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463672144] [2023-11-12 00:43:40,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:40,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:40,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:43:40,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:40,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463672144] [2023-11-12 00:43:40,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463672144] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:43:40,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089126242] [2023-11-12 00:43:40,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:40,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:43:40,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:43:40,392 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:43:40,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-12 00:43:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:40,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-12 00:43:40,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:43:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:43:40,609 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:43:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:43:40,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089126242] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:43:40,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [617816095] [2023-11-12 00:43:40,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:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) 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) [2023-11-12 00:43:40,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:43:40,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2023-11-12 00:43:40,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602847635] [2023-11-12 00:43:40,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:43:40,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-12 00:43:40,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:40,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-12 00:43:40,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-11-12 00:43:40,692 INFO L87 Difference]: Start difference. First operand 321 states and 835 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 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) [2023-11-12 00:43:41,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:41,525 INFO L93 Difference]: Finished difference Result 847 states and 2080 transitions. [2023-11-12 00:43:41,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-12 00:43:41,525 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 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 11 [2023-11-12 00:43:41,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:41,533 INFO L225 Difference]: With dead ends: 847 [2023-11-12 00:43:41,534 INFO L226 Difference]: Without dead ends: 805 [2023-11-12 00:43:41,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2023-11-12 00:43:41,535 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 225 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:41,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 0 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 00:43:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2023-11-12 00:43:41,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 438. [2023-11-12 00:43:41,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 396 states have (on average 2.8813131313131315) internal successors, (1141), 437 states have internal predecessors, (1141), 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) [2023-11-12 00:43:41,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1141 transitions. [2023-11-12 00:43:41,557 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1141 transitions. Word has length 11 [2023-11-12 00:43:41,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:41,557 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 1141 transitions. [2023-11-12 00:43:41,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 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) [2023-11-12 00:43:41,558 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1141 transitions. [2023-11-12 00:43:41,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:43:41,558 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:41,558 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:43:41,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-12 00:43:41,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:43:41,764 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-12 00:43:41,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:41,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1476339020, now seen corresponding path program 1 times [2023-11-12 00:43:41,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:41,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894727345] [2023-11-12 00:43:41,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:41,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:43:41,868 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:41,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894727345] [2023-11-12 00:43:41,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894727345] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:43:41,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381488662] [2023-11-12 00:43:41,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:41,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:43:41,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:43:41,870 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:43:41,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-12 00:43:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:42,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-12 00:43:42,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:43:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:43:42,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:43:42,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:43:42,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381488662] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:43:42,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1907106328] [2023-11-12 00:43:42,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:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) 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) [2023-11-12 00:43:42,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:43:42,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2023-11-12 00:43:42,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025217278] [2023-11-12 00:43:42,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:43:42,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-12 00:43:42,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:42,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-12 00:43:42,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-11-12 00:43:42,161 INFO L87 Difference]: Start difference. First operand 438 states and 1141 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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) [2023-11-12 00:43:42,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:42,603 INFO L93 Difference]: Finished difference Result 637 states and 1552 transitions. [2023-11-12 00:43:42,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-12 00:43:42,603 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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 11 [2023-11-12 00:43:42,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:42,608 INFO L225 Difference]: With dead ends: 637 [2023-11-12 00:43:42,608 INFO L226 Difference]: Without dead ends: 607 [2023-11-12 00:43:42,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2023-11-12 00:43:42,609 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:42,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:43:42,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2023-11-12 00:43:42,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 412. [2023-11-12 00:43:42,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 370 states have (on average 2.8378378378378377) internal successors, (1050), 411 states have internal predecessors, (1050), 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) [2023-11-12 00:43:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1050 transitions. [2023-11-12 00:43:42,625 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1050 transitions. Word has length 11 [2023-11-12 00:43:42,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:42,626 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 1050 transitions. [2023-11-12 00:43:42,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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) [2023-11-12 00:43:42,626 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1050 transitions. [2023-11-12 00:43:42,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:43:42,626 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:42,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:43:42,641 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-12 00:43:42,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:43:42,832 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-12 00:43:42,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:42,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1476030088, now seen corresponding path program 1 times [2023-11-12 00:43:42,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:42,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256286607] [2023-11-12 00:43:42,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:42,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:43:43,152 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:43,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256286607] [2023-11-12 00:43:43,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256286607] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:43:43,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731835269] [2023-11-12 00:43:43,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:43,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:43:43,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:43:43,154 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:43:43,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-12 00:43:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:43,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-12 00:43:43,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:43:43,330 INFO L351 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 [2023-11-12 00:43:43,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:43,361 INFO L351 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 [2023-11-12 00:43:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:43:43,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:43:43,429 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_472 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_472) |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 [2023-11-12 00:43:43,439 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:43,439 INFO L351 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 22 treesize of output 23 [2023-11-12 00:43:43,446 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:43,446 INFO L351 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 [2023-11-12 00:43:43,457 INFO L351 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 5 treesize of output 3 [2023-11-12 00:43:43,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-12 00:43:43,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731835269] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:43:43,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1536313066] [2023-11-12 00:43:43,482 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:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) 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) [2023-11-12 00:43:43,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:43:43,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-11-12 00:43:43,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923374920] [2023-11-12 00:43:43,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:43:43,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-12 00:43:43,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:43:43,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-12 00:43:43,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=125, Unknown=1, NotChecked=22, Total=182 [2023-11-12 00:43:43,486 INFO L87 Difference]: Start difference. First operand 412 states and 1050 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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) [2023-11-12 00:43:43,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:43:43,871 INFO L93 Difference]: Finished difference Result 529 states and 1243 transitions. [2023-11-12 00:43:43,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 00:43:43,872 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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 11 [2023-11-12 00:43:43,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:43:43,876 INFO L225 Difference]: With dead ends: 529 [2023-11-12 00:43:43,876 INFO L226 Difference]: Without dead ends: 529 [2023-11-12 00:43:43,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=267, Unknown=1, NotChecked=34, Total=380 [2023-11-12 00:43:43,877 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:43:43,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 333 Invalid, 0 Unknown, 71 Unchecked, 0.3s Time] [2023-11-12 00:43:43,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2023-11-12 00:43:43,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 413. [2023-11-12 00:43:43,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 371 states have (on average 2.8436657681940702) internal successors, (1055), 412 states have internal predecessors, (1055), 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) [2023-11-12 00:43:43,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1055 transitions. [2023-11-12 00:43:43,891 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 1055 transitions. Word has length 11 [2023-11-12 00:43:43,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:43:43,891 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 1055 transitions. [2023-11-12 00:43:43,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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) [2023-11-12 00:43:43,892 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1055 transitions. [2023-11-12 00:43:43,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:43:43,892 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:43:43,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:43:43,904 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-12 00:43:44,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-12 00:43:44,105 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-12 00:43:44,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:43:44,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1476030155, now seen corresponding path program 1 times [2023-11-12 00:43:44,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:43:44,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378704388] [2023-11-12 00:43:44,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:44,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:43:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:44,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:44,568 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:43:44,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378704388] [2023-11-12 00:43:44,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378704388] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:43:44,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160329913] [2023-11-12 00:43:44,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:43:44,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:43:44,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:43:44,570 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:43:44,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10b5cbc-de73-4fba-9ce4-269257ff9fc9/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-12 00:43:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:43:44,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-12 00:43:44,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:43:44,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:44,725 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-12 00:43:44,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:44,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:44,738 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-12 00:43:44,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:44,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:44,745 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-12 00:43:44,768 INFO L351 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 [2023-11-12 00:43:44,808 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:43:44,808 INFO L351 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 [2023-11-12 00:43:44,838 INFO L351 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 [2023-11-12 00:43:44,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:43:44,868 INFO L351 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 [2023-11-12 00:43:44,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:43:44,923 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:43:45,250 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((~a2~0.offset Int) (v_ArrVal_506 (Array Int Int)) (~a2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_506))) (let ((.cse0 (select (select .cse1 ~a2~0.base) ~a2~0.offset))) (or (< 9223372039002259455 .cse0) (< (select (select .cse1 c_~a1~0.base) c_~a1~0.offset) (+ .cse0 2147483648)) (< .cse0 0))))) (forall ((v_ArrVal_506 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_506))) (or (forall ((~a2~0.offset Int) (~a2~0.base Int)) (not (= (select (select .cse2 ~a2~0.base) ~a2~0.offset) 0))) (< (select (select .cse2 c_~a1~0.base) c_~a1~0.offset) 2147483648))))) is different from false [2023-11-12 00:43:45,333 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_505) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_506))) (or (forall ((~a2~0.offset Int) (~a2~0.base Int)) (not (= 0 (select (select .cse0 ~a2~0.base) ~a2~0.offset)))) (< (select (select .cse0 c_~a1~0.base) c_~a1~0.offset) 2147483648)))) (forall ((~a2~0.offset Int) (v_ArrVal_506 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (~a2~0.base Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_505) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_506))) (let ((.cse1 (select (select .cse2 ~a2~0.base) ~a2~0.offset))) (or (< .cse1 0) (< (select (select .cse2 c_~a1~0.base) c_~a1~0.offset) (+ 2147483648 .cse1)) (< 9223372039002259455 .cse1)))))) is different from false [2023-11-12 00:43:45,467 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:45,468 INFO L351 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 165 treesize of output 106 [2023-11-12 00:43:45,532 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:45,532 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 865 treesize of output 848 [2023-11-12 00:43:45,593 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:45,594 INFO L351 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 493 treesize of output 482 [2023-11-12 00:43:45,631 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:45,632 INFO L351 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 473 treesize of output 442 [2023-11-12 00:43:45,669 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:45,669 INFO L351 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 433 treesize of output 434 [2023-11-12 00:43:45,709 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:43:45,710 INFO L351 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 425 treesize of output 430