./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/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_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/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_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/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 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:07:50,427 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:07:50,546 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-11-12 00:07:50,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:07:50,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:07:50,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:07:50,605 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:07:50,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:07:50,607 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:07:50,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:07:50,612 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:07:50,613 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:07:50,613 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:07:50,615 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:07:50,616 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:07:50,616 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:07:50,617 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:07:50,617 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:07:50,618 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:07:50,618 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:07:50,619 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:07:50,620 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:07:50,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:07:50,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:07:50,622 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:07:50,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:07:50,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:07:50,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:07:50,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:07:50,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:07:50,626 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:07:50,626 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-12 00:07:50,626 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:07:50,626 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:07:50,627 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:07:50,627 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:07:50,627 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:07:50,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:07:50,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:07:50,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:07:50,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:07:50,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:07:50,629 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:07:50,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:07:50,630 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:07:50,630 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:07:50,631 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:07:50,631 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_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/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_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/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 -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2023-11-12 00:07:50,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:07:50,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:07:50,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:07:50,956 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:07:50,957 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:07:50,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/pthread/queue_ok_longest.i [2023-11-12 00:07:54,188 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:07:54,467 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:07:54,473 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/sv-benchmarks/c/pthread/queue_ok_longest.i [2023-11-12 00:07:54,505 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/data/78a9a0173/40338ad2d03a427181889a7c1873f4d3/FLAG54637c2e6 [2023-11-12 00:07:54,521 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/data/78a9a0173/40338ad2d03a427181889a7c1873f4d3 [2023-11-12 00:07:54,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:07:54,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:07:54,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:07:54,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:07:54,533 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:07:54,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:07:54" (1/1) ... [2023-11-12 00:07:54,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ceffa37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:07:54, skipping insertion in model container [2023-11-12 00:07:54,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:07:54" (1/1) ... [2023-11-12 00:07:54,589 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:07:55,143 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:07:55,158 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:07:55,225 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:07:55,306 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:07:55,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:07:55 WrapperNode [2023-11-12 00:07:55,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:07:55,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:07:55,309 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:07:55,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:07:55,317 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:07:55" (1/1) ... [2023-11-12 00:07:55,364 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:07:55" (1/1) ... [2023-11-12 00:07:55,412 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 220 [2023-11-12 00:07:55,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:07:55,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:07:55,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:07:55,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:07:55,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:07:55" (1/1) ... [2023-11-12 00:07:55,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:07:55" (1/1) ... [2023-11-12 00:07:55,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:07:55" (1/1) ... [2023-11-12 00:07:55,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:07:55" (1/1) ... [2023-11-12 00:07:55,457 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:07:55" (1/1) ... [2023-11-12 00:07:55,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:07:55" (1/1) ... [2023-11-12 00:07:55,478 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:07:55" (1/1) ... [2023-11-12 00:07:55,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:07:55" (1/1) ... [2023-11-12 00:07:55,493 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:07:55,494 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:07:55,501 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:07:55,502 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:07:55,503 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:07:55" (1/1) ... [2023-11-12 00:07:55,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:07:55,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:07:55,541 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/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:07:55,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/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:07:55,586 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-12 00:07:55,588 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-12 00:07:55,588 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-12 00:07:55,588 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-12 00:07:55,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:07:55,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:07:55,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:07:55,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:07:55,592 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-12 00:07:55,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:07:55,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:07:55,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:07:55,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:07:55,594 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:07:55,768 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:07:55,770 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:07:56,211 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:07:56,222 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:07:56,223 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-12 00:07:56,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:07:56 BoogieIcfgContainer [2023-11-12 00:07:56,226 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:07:56,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:07:56,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:07:56,232 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:07:56,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:07:54" (1/3) ... [2023-11-12 00:07:56,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a34fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:07:56, skipping insertion in model container [2023-11-12 00:07:56,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:07:55" (2/3) ... [2023-11-12 00:07:56,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a34fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:07:56, skipping insertion in model container [2023-11-12 00:07:56,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:07:56" (3/3) ... [2023-11-12 00:07:56,235 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2023-11-12 00:07:56,245 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-12 00:07:56,257 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:07:56,257 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-11-12 00:07:56,257 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 00:07:56,388 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-12 00:07:56,457 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-12 00:07:56,484 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 250 places, 258 transitions, 530 flow [2023-11-12 00:07:56,488 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 250 places, 258 transitions, 530 flow [2023-11-12 00:07:56,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 250 places, 258 transitions, 530 flow [2023-11-12 00:07:56,680 INFO L124 PetriNetUnfolderBase]: 15/256 cut-off events. [2023-11-12 00:07:56,680 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-12 00:07:56,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 256 events. 15/256 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 477 event pairs, 0 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 175. Up to 3 conditions per place. [2023-11-12 00:07:56,701 INFO L119 LiptonReduction]: Number of co-enabled transitions 15300 [2023-11-12 00:08:06,025 INFO L134 LiptonReduction]: Checked pairs total: 32702 [2023-11-12 00:08:06,026 INFO L136 LiptonReduction]: Total number of compositions: 256 [2023-11-12 00:08:06,035 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 62 places, 62 transitions, 138 flow [2023-11-12 00:08:06,159 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1104 states, 1056 states have (on average 2.777462121212121) internal successors, (2933), 1103 states have internal predecessors, (2933), 0 states have call successors, (0), 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:08:06,181 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:08:06,187 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;@1748d189, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:08:06,188 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-11-12 00:08:06,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 1104 states, 1056 states have (on average 2.777462121212121) internal successors, (2933), 1103 states have internal predecessors, (2933), 0 states have call successors, (0), 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:08:06,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:08:06,200 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:08:06,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:08:06,201 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-12 00:08:06,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:08:06,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1097154522, now seen corresponding path program 1 times [2023-11-12 00:08:06,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:08:06,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624762434] [2023-11-12 00:08:06,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:06,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:08:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:07,158 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:08:07,159 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:08:07,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624762434] [2023-11-12 00:08:07,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624762434] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:08:07,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:08:07,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:08:07,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232201186] [2023-11-12 00:08:07,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:08:07,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:08:07,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:08:07,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:08:07,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:08:07,201 INFO L87 Difference]: Start difference. First operand has 1104 states, 1056 states have (on average 2.777462121212121) internal successors, (2933), 1103 states have internal predecessors, (2933), 0 states have call successors, (0), 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 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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:08:07,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:08:07,544 INFO L93 Difference]: Finished difference Result 1112 states and 2949 transitions. [2023-11-12 00:08:07,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:08:07,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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:08:07,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:08:07,580 INFO L225 Difference]: With dead ends: 1112 [2023-11-12 00:08:07,580 INFO L226 Difference]: Without dead ends: 1112 [2023-11-12 00:08:07,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:08:07,585 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:08:07,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 20 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:08:07,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2023-11-12 00:08:07,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1107. [2023-11-12 00:08:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 1059 states have (on average 2.776203966005666) internal successors, (2940), 1106 states have internal predecessors, (2940), 0 states have call successors, (0), 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:08:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 2940 transitions. [2023-11-12 00:08:07,750 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 2940 transitions. Word has length 7 [2023-11-12 00:08:07,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:08:07,751 INFO L495 AbstractCegarLoop]: Abstraction has 1107 states and 2940 transitions. [2023-11-12 00:08:07,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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:08:07,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 2940 transitions. [2023-11-12 00:08:07,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 00:08:07,757 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:08:07,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:08:07,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:08:07,758 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-12 00:08:07,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:08:07,759 INFO L85 PathProgramCache]: Analyzing trace with hash -235032713, now seen corresponding path program 1 times [2023-11-12 00:08:07,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:08:07,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623146742] [2023-11-12 00:08:07,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:07,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:08:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:08,204 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:08:08,204 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:08:08,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623146742] [2023-11-12 00:08:08,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623146742] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:08:08,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:08:08,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:08:08,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994523552] [2023-11-12 00:08:08,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:08:08,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:08:08,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:08:08,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:08:08,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:08:08,208 INFO L87 Difference]: Start difference. First operand 1107 states and 2940 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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:08:08,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:08:08,617 INFO L93 Difference]: Finished difference Result 1481 states and 3910 transitions. [2023-11-12 00:08:08,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:08:08,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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:08:08,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:08:08,633 INFO L225 Difference]: With dead ends: 1481 [2023-11-12 00:08:08,634 INFO L226 Difference]: Without dead ends: 1481 [2023-11-12 00:08:08,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:08:08,636 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 130 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:08:08,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 26 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:08:08,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2023-11-12 00:08:08,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1272. [2023-11-12 00:08:08,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1224 states have (on average 2.7908496732026142) internal successors, (3416), 1271 states have internal predecessors, (3416), 0 states have call successors, (0), 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:08:08,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 3416 transitions. [2023-11-12 00:08:08,705 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 3416 transitions. Word has length 8 [2023-11-12 00:08:08,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:08:08,706 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 3416 transitions. [2023-11-12 00:08:08,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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:08:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 3416 transitions. [2023-11-12 00:08:08,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 00:08:08,708 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:08:08,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:08:08,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:08:08,709 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-12 00:08:08,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:08:08,710 INFO L85 PathProgramCache]: Analyzing trace with hash -347613863, now seen corresponding path program 2 times [2023-11-12 00:08:08,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:08:08,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413000735] [2023-11-12 00:08:08,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:08,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:08:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:09,178 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:08:09,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:08:09,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413000735] [2023-11-12 00:08:09,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413000735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:08:09,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:08:09,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:08:09,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533844671] [2023-11-12 00:08:09,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:08:09,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:08:09,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:08:09,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:08:09,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:08:09,187 INFO L87 Difference]: Start difference. First operand 1272 states and 3416 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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:08:09,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:08:09,578 INFO L93 Difference]: Finished difference Result 1516 states and 4001 transitions. [2023-11-12 00:08:09,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:08:09,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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:08:09,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:08:09,592 INFO L225 Difference]: With dead ends: 1516 [2023-11-12 00:08:09,593 INFO L226 Difference]: Without dead ends: 1516 [2023-11-12 00:08:09,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:08:09,597 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 89 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:08:09,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 29 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:08:09,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2023-11-12 00:08:09,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1272. [2023-11-12 00:08:09,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1224 states have (on average 2.7908496732026142) internal successors, (3416), 1271 states have internal predecessors, (3416), 0 states have call successors, (0), 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:08:09,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 3416 transitions. [2023-11-12 00:08:09,656 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 3416 transitions. Word has length 8 [2023-11-12 00:08:09,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:08:09,658 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 3416 transitions. [2023-11-12 00:08:09,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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:08:09,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 3416 transitions. [2023-11-12 00:08:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:08:09,665 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:08:09,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:08:09,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:08:09,667 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-12 00:08:09,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:08:09,667 INFO L85 PathProgramCache]: Analyzing trace with hash -2123999781, now seen corresponding path program 1 times [2023-11-12 00:08:09,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:08:09,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178768331] [2023-11-12 00:08:09,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:09,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:08:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:09,736 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:08:09,737 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:08:09,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178768331] [2023-11-12 00:08:09,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178768331] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:08:09,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:08:09,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:08:09,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181047575] [2023-11-12 00:08:09,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:08:09,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:08:09,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:08:09,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:08:09,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:08:09,746 INFO L87 Difference]: Start difference. First operand 1272 states and 3416 transitions. Second operand has 4 states, 3 states have (on average 3.0) 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:08:09,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:08:09,976 INFO L93 Difference]: Finished difference Result 2078 states and 5596 transitions. [2023-11-12 00:08:09,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:08:09,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) 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:08:09,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:08:09,995 INFO L225 Difference]: With dead ends: 2078 [2023-11-12 00:08:09,995 INFO L226 Difference]: Without dead ends: 2078 [2023-11-12 00:08:09,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:08:10,000 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 69 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:08:10,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 26 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:08:10,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2023-11-12 00:08:10,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1890. [2023-11-12 00:08:10,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1842 states have (on average 2.8762214983713354) internal successors, (5298), 1889 states have internal predecessors, (5298), 0 states have call successors, (0), 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:08:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 5298 transitions. [2023-11-12 00:08:10,084 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 5298 transitions. Word has length 9 [2023-11-12 00:08:10,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:08:10,085 INFO L495 AbstractCegarLoop]: Abstraction has 1890 states and 5298 transitions. [2023-11-12 00:08:10,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) 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:08:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 5298 transitions. [2023-11-12 00:08:10,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:08:10,088 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:08:10,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:08:10,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:08:10,089 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-12 00:08:10,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:08:10,090 INFO L85 PathProgramCache]: Analyzing trace with hash 630565487, now seen corresponding path program 1 times [2023-11-12 00:08:10,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:08:10,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087972410] [2023-11-12 00:08:10,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:10,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:08:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:10,437 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:08:10,437 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:08:10,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087972410] [2023-11-12 00:08:10,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087972410] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:08:10,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:08:10,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:08:10,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018512049] [2023-11-12 00:08:10,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:08:10,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:08:10,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:08:10,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:08:10,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:08:10,440 INFO L87 Difference]: Start difference. First operand 1890 states and 5298 transitions. Second operand has 6 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:08:10,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:08:10,670 INFO L93 Difference]: Finished difference Result 1900 states and 5318 transitions. [2023-11-12 00:08:10,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:08:10,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 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:08:10,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:08:10,688 INFO L225 Difference]: With dead ends: 1900 [2023-11-12 00:08:10,689 INFO L226 Difference]: Without dead ends: 1900 [2023-11-12 00:08:10,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:08:10,690 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:08:10,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 20 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:08:10,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1900 states. [2023-11-12 00:08:10,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 1893. [2023-11-12 00:08:10,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1845 states have (on average 2.875880758807588) internal successors, (5306), 1892 states have internal predecessors, (5306), 0 states have call successors, (0), 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:08:10,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 5306 transitions. [2023-11-12 00:08:10,769 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 5306 transitions. Word has length 10 [2023-11-12 00:08:10,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:08:10,770 INFO L495 AbstractCegarLoop]: Abstraction has 1893 states and 5306 transitions. [2023-11-12 00:08:10,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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:08:10,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 5306 transitions. [2023-11-12 00:08:10,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:08:10,771 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:08:10,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:08:10,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:08:10,772 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-12 00:08:10,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:08:10,776 INFO L85 PathProgramCache]: Analyzing trace with hash 630565552, now seen corresponding path program 1 times [2023-11-12 00:08:10,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:08:10,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956051852] [2023-11-12 00:08:10,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:10,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:08:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:11,078 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:08:11,079 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:08:11,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956051852] [2023-11-12 00:08:11,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956051852] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:08:11,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:08:11,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:08:11,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987756733] [2023-11-12 00:08:11,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:08:11,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:08:11,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:08:11,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:08:11,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:08:11,083 INFO L87 Difference]: Start difference. First operand 1893 states and 5306 transitions. Second operand has 6 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:08:11,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:08:11,365 INFO L93 Difference]: Finished difference Result 2052 states and 5656 transitions. [2023-11-12 00:08:11,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:08:11,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 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:08:11,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:08:11,385 INFO L225 Difference]: With dead ends: 2052 [2023-11-12 00:08:11,386 INFO L226 Difference]: Without dead ends: 2052 [2023-11-12 00:08:11,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:08:11,387 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 36 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:08:11,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 27 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:08:11,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2023-11-12 00:08:11,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 1893. [2023-11-12 00:08:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1845 states have (on average 2.87479674796748) internal successors, (5304), 1892 states have internal predecessors, (5304), 0 states have call successors, (0), 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:08:11,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 5304 transitions. [2023-11-12 00:08:11,463 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 5304 transitions. Word has length 10 [2023-11-12 00:08:11,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:08:11,464 INFO L495 AbstractCegarLoop]: Abstraction has 1893 states and 5304 transitions. [2023-11-12 00:08:11,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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:08:11,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 5304 transitions. [2023-11-12 00:08:11,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:08:11,465 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:08:11,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:08:11,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 00:08:11,467 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-12 00:08:11,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:08:11,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1061537358, now seen corresponding path program 1 times [2023-11-12 00:08:11,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:08:11,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211227696] [2023-11-12 00:08:11,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:11,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:08:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:11,871 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:08:11,872 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:08:11,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211227696] [2023-11-12 00:08:11,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211227696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:08:11,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:08:11,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:08:11,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276888532] [2023-11-12 00:08:11,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:08:11,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:08:11,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:08:11,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:08:11,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:08:11,874 INFO L87 Difference]: Start difference. First operand 1893 states and 5304 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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:08:12,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:08:12,340 INFO L93 Difference]: Finished difference Result 2956 states and 8148 transitions. [2023-11-12 00:08:12,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:08:12,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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:08:12,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:08:12,367 INFO L225 Difference]: With dead ends: 2956 [2023-11-12 00:08:12,368 INFO L226 Difference]: Without dead ends: 2956 [2023-11-12 00:08:12,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:08:12,369 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 160 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:08:12,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 34 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 00:08:12,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2023-11-12 00:08:12,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2362. [2023-11-12 00:08:12,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2314 states have (on average 2.933448573898012) internal successors, (6788), 2361 states have internal predecessors, (6788), 0 states have call successors, (0), 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:08:12,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 6788 transitions. [2023-11-12 00:08:12,469 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 6788 transitions. Word has length 11 [2023-11-12 00:08:12,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:08:12,469 INFO L495 AbstractCegarLoop]: Abstraction has 2362 states and 6788 transitions. [2023-11-12 00:08:12,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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:08:12,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 6788 transitions. [2023-11-12 00:08:12,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:08:12,471 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:08:12,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:08:12,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 00:08:12,472 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-12 00:08:12,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:08:12,472 INFO L85 PathProgramCache]: Analyzing trace with hash -597118832, now seen corresponding path program 2 times [2023-11-12 00:08:12,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:08:12,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739030705] [2023-11-12 00:08:12,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:12,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:08:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:12,881 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:08:12,882 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:08:12,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739030705] [2023-11-12 00:08:12,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739030705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:08:12,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:08:12,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:08:12,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673420413] [2023-11-12 00:08:12,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:08:12,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:08:12,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:08:12,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:08:12,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:08:12,884 INFO L87 Difference]: Start difference. First operand 2362 states and 6788 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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:08:13,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:08:13,257 INFO L93 Difference]: Finished difference Result 2767 states and 7812 transitions. [2023-11-12 00:08:13,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:08:13,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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:08:13,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:08:13,289 INFO L225 Difference]: With dead ends: 2767 [2023-11-12 00:08:13,289 INFO L226 Difference]: Without dead ends: 2767 [2023-11-12 00:08:13,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:08:13,292 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 130 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:08:13,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 31 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:08:13,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2767 states. [2023-11-12 00:08:13,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2767 to 2429. [2023-11-12 00:08:13,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2429 states, 2381 states have (on average 2.9542209155816885) internal successors, (7034), 2428 states have internal predecessors, (7034), 0 states have call successors, (0), 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:08:13,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 2429 states and 7034 transitions. [2023-11-12 00:08:13,399 INFO L78 Accepts]: Start accepts. Automaton has 2429 states and 7034 transitions. Word has length 11 [2023-11-12 00:08:13,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:08:13,399 INFO L495 AbstractCegarLoop]: Abstraction has 2429 states and 7034 transitions. [2023-11-12 00:08:13,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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:08:13,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 7034 transitions. [2023-11-12 00:08:13,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:08:13,405 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:08:13,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:08:13,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 00:08:13,405 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-12 00:08:13,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:08:13,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1922224860, now seen corresponding path program 3 times [2023-11-12 00:08:13,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:08:13,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110535835] [2023-11-12 00:08:13,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:13,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:08:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:13,789 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:08:13,789 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:08:13,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110535835] [2023-11-12 00:08:13,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110535835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:08:13,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:08:13,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:08:13,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129147105] [2023-11-12 00:08:13,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:08:13,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:08:13,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:08:13,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:08:13,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:08:13,792 INFO L87 Difference]: Start difference. First operand 2429 states and 7034 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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:08:14,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:08:14,096 INFO L93 Difference]: Finished difference Result 2834 states and 8058 transitions. [2023-11-12 00:08:14,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:08:14,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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:08:14,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:08:14,121 INFO L225 Difference]: With dead ends: 2834 [2023-11-12 00:08:14,122 INFO L226 Difference]: Without dead ends: 2834 [2023-11-12 00:08:14,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:08:14,123 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 191 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:08:14,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 21 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:08:14,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2023-11-12 00:08:14,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2429. [2023-11-12 00:08:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2429 states, 2381 states have (on average 2.9542209155816885) internal successors, (7034), 2428 states have internal predecessors, (7034), 0 states have call successors, (0), 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:08:14,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 2429 states and 7034 transitions. [2023-11-12 00:08:14,251 INFO L78 Accepts]: Start accepts. Automaton has 2429 states and 7034 transitions. Word has length 11 [2023-11-12 00:08:14,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:08:14,251 INFO L495 AbstractCegarLoop]: Abstraction has 2429 states and 7034 transitions. [2023-11-12 00:08:14,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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:08:14,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 7034 transitions. [2023-11-12 00:08:14,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:08:14,252 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:08:14,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:08:14,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 00:08:14,253 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-12 00:08:14,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:08:14,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1054384760, now seen corresponding path program 1 times [2023-11-12 00:08:14,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:08:14,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411130296] [2023-11-12 00:08:14,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:14,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:08:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:14,323 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:08:14,324 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:08:14,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411130296] [2023-11-12 00:08:14,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411130296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:08:14,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:08:14,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:08:14,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542411812] [2023-11-12 00:08:14,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:08:14,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:08:14,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:08:14,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:08:14,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:08:14,327 INFO L87 Difference]: Start difference. First operand 2429 states and 7034 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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:08:14,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:08:14,415 INFO L93 Difference]: Finished difference Result 609 states and 1413 transitions. [2023-11-12 00:08:14,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:08:14,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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:08:14,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:08:14,417 INFO L225 Difference]: With dead ends: 609 [2023-11-12 00:08:14,418 INFO L226 Difference]: Without dead ends: 587 [2023-11-12 00:08:14,419 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:08:14,419 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 28 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:08:14,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 7 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:08:14,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2023-11-12 00:08:14,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 562. [2023-11-12 00:08:14,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 544 states have (on average 2.4099264705882355) internal successors, (1311), 561 states have internal predecessors, (1311), 0 states have call successors, (0), 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:08:14,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1311 transitions. [2023-11-12 00:08:14,439 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1311 transitions. Word has length 11 [2023-11-12 00:08:14,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:08:14,439 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 1311 transitions. [2023-11-12 00:08:14,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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:08:14,440 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1311 transitions. [2023-11-12 00:08:14,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:08:14,440 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:08:14,441 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:08:14,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 00:08:14,441 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-12 00:08:14,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:08:14,442 INFO L85 PathProgramCache]: Analyzing trace with hash 383074367, now seen corresponding path program 1 times [2023-11-12 00:08:14,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:08:14,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50639658] [2023-11-12 00:08:14,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:14,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:08:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:14,483 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:08:14,483 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:08:14,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50639658] [2023-11-12 00:08:14,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50639658] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:08:14,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:08:14,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:08:14,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178200631] [2023-11-12 00:08:14,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:08:14,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:08:14,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:08:14,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:08:14,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:08:14,486 INFO L87 Difference]: Start difference. First operand 562 states and 1311 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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:08:14,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:08:14,588 INFO L93 Difference]: Finished difference Result 586 states and 1359 transitions. [2023-11-12 00:08:14,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:08:14,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-12 00:08:14,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:08:14,591 INFO L225 Difference]: With dead ends: 586 [2023-11-12 00:08:14,591 INFO L226 Difference]: Without dead ends: 586 [2023-11-12 00:08:14,591 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:08:14,592 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 7 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:08:14,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 11 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:08:14,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2023-11-12 00:08:14,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2023-11-12 00:08:14,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 568 states have (on average 2.392605633802817) internal successors, (1359), 585 states have internal predecessors, (1359), 0 states have call successors, (0), 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:08:14,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 1359 transitions. [2023-11-12 00:08:14,610 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 1359 transitions. Word has length 12 [2023-11-12 00:08:14,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:08:14,611 INFO L495 AbstractCegarLoop]: Abstraction has 586 states and 1359 transitions. [2023-11-12 00:08:14,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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:08:14,611 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 1359 transitions. [2023-11-12 00:08:14,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 00:08:14,612 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:08:14,612 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:08:14,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 00:08:14,612 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-12 00:08:14,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:08:14,613 INFO L85 PathProgramCache]: Analyzing trace with hash 442112290, now seen corresponding path program 1 times [2023-11-12 00:08:14,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:08:14,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205539453] [2023-11-12 00:08:14,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:14,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:08:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:08:15,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:08:15,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205539453] [2023-11-12 00:08:15,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205539453] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:08:15,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594213285] [2023-11-12 00:08:15,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:15,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:08:15,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:08:15,151 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:08:15,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:08:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:15,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-12 00:08:15,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:08:15,564 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:08:15,636 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 25 treesize of output 13 [2023-11-12 00:08:15,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:08:15,670 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:08:15,759 INFO L322 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2023-11-12 00:08:15,759 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2023-11-12 00:08:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:08:15,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:08:15,977 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_267 Int) (v_ArrVal_266 (Array Int Int))) (or (< 0 (+ (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_266) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_267) (+ 3208 |c_~#queue~0.offset|)) 2147483650)) (< (+ v_ArrVal_267 2147483648) 0))) is different from false [2023-11-12 00:08:16,102 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:08:16,102 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 2 case distinctions, treesize of input 40 treesize of output 46 [2023-11-12 00:08:16,116 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:08:16,116 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 56 treesize of output 60 [2023-11-12 00:08:16,126 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 28 treesize of output 24 [2023-11-12 00:08:16,145 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 10 treesize of output 6 [2023-11-12 00:08:16,161 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:08:16,162 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 44 treesize of output 44 [2023-11-12 00:08:16,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:08:16,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594213285] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:08:16,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [143555557] [2023-11-12 00:08:16,301 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:08:16,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:08:16,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-11-12 00:08:16,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128758088] [2023-11-12 00:08:16,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:08:16,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-12 00:08:16,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:08:16,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-12 00:08:16,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=475, Unknown=3, NotChecked=46, Total=650 [2023-11-12 00:08:16,308 INFO L87 Difference]: Start difference. First operand 586 states and 1359 transitions. Second operand has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 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:08:17,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:08:17,320 INFO L93 Difference]: Finished difference Result 1146 states and 2671 transitions. [2023-11-12 00:08:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 00:08:17,321 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-12 00:08:17,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:08:17,325 INFO L225 Difference]: With dead ends: 1146 [2023-11-12 00:08:17,326 INFO L226 Difference]: Without dead ends: 1146 [2023-11-12 00:08:17,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=213, Invalid=600, Unknown=3, NotChecked=54, Total=870 [2023-11-12 00:08:17,327 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 619 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-12 00:08:17,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 81 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 755 Invalid, 0 Unknown, 155 Unchecked, 0.8s Time] [2023-11-12 00:08:17,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2023-11-12 00:08:17,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 717. [2023-11-12 00:08:17,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 699 states have (on average 2.4721030042918457) internal successors, (1728), 716 states have internal predecessors, (1728), 0 states have call successors, (0), 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:08:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1728 transitions. [2023-11-12 00:08:17,353 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1728 transitions. Word has length 15 [2023-11-12 00:08:17,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:08:17,354 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 1728 transitions. [2023-11-12 00:08:17,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 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:08:17,354 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1728 transitions. [2023-11-12 00:08:17,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 00:08:17,355 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:08:17,355 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:08:17,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:08:17,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:08:17,568 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-12 00:08:17,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:08:17,569 INFO L85 PathProgramCache]: Analyzing trace with hash 442112309, now seen corresponding path program 1 times [2023-11-12 00:08:17,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:08:17,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945309351] [2023-11-12 00:08:17,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:17,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:08:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:08:18,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:08:18,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945309351] [2023-11-12 00:08:18,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945309351] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:08:18,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500964768] [2023-11-12 00:08:18,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:18,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:08:18,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:08:18,408 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:08:18,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:08:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:18,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-12 00:08:18,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:08:18,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:08:18,608 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 15 [2023-11-12 00:08:18,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:08:18,620 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 00:08:18,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:08:18,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:08:18,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:08:18,639 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 1 [2023-11-12 00:08:18,792 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2023-11-12 00:08:18,961 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 58 [2023-11-12 00:08:19,210 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 132 [2023-11-12 00:08:19,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:08:19,350 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 285 treesize of output 250 [2023-11-12 00:08:19,601 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 303 treesize of output 266 [2023-11-12 00:08:19,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:08:19,934 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:08:20,047 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_327 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| Int) (v_ArrVal_329 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_327) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| 4) |c_~#queue~0.offset|) v_ArrVal_329) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157|)))) is different from false [2023-11-12 00:08:20,136 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166| Int) (v_ArrVal_327 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| Int) (v_ArrVal_329 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166| 1))) |c_~#stored_elements~0.base| v_ArrVal_327) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166|) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| 4) |c_~#queue~0.offset|) v_ArrVal_329) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157|))))) is different from false [2023-11-12 00:08:20,179 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166| Int) (v_ArrVal_327 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| Int) (v_ArrVal_329 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166| 1))) |c_~#stored_elements~0.base| v_ArrVal_327) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166|) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157|) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| 4) |c_~#queue~0.offset|) v_ArrVal_329) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-11-12 00:08:20,330 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_196| Int) (v_ArrVal_323 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166| Int) (v_ArrVal_327 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| Int) (v_ArrVal_329 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_323)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_196| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166| 1))) |c_~#stored_elements~0.base| v_ArrVal_327) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| 4) |c_~#queue~0.offset|) v_ArrVal_329) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_196|) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166|))))) is different from false [2023-11-12 00:08:21,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-12 00:08:21,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500964768] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:08:21,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [807330458] [2023-11-12 00:08:21,471 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:08:21,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:08:21,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-11-12 00:08:21,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379288981] [2023-11-12 00:08:21,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:08:21,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-12 00:08:21,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:08:21,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-12 00:08:21,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=553, Unknown=14, NotChecked=220, Total=992 [2023-11-12 00:08:21,478 INFO L87 Difference]: Start difference. First operand 717 states and 1728 transitions. Second operand has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 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:08:24,003 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| Int) (v_ArrVal_329 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| 4) |c_~#queue~0.offset|) v_ArrVal_329) .cse2) 2147483647)))) (forall ((v_ArrVal_327 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| Int) (v_ArrVal_329 Int)) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_327) |c_~#queue~0.base|))) (or (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157|) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| 4) |c_~#queue~0.offset|) v_ArrVal_329) .cse2) 2147483647)))))) is different from false [2023-11-12 00:08:24,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:08:24,634 INFO L93 Difference]: Finished difference Result 762 states and 1829 transitions. [2023-11-12 00:08:24,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-12 00:08:24,635 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-12 00:08:24,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:08:24,637 INFO L225 Difference]: With dead ends: 762 [2023-11-12 00:08:24,637 INFO L226 Difference]: Without dead ends: 762 [2023-11-12 00:08:24,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=392, Invalid=1013, Unknown=21, NotChecked=380, Total=1806 [2023-11-12 00:08:24,639 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 42 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 19 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 631 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-12 00:08:24,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 87 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 711 Invalid, 25 Unknown, 631 Unchecked, 1.5s Time] [2023-11-12 00:08:24,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2023-11-12 00:08:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 728. [2023-11-12 00:08:24,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 710 states have (on average 2.4746478873239437) internal successors, (1757), 727 states have internal predecessors, (1757), 0 states have call successors, (0), 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:08:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1757 transitions. [2023-11-12 00:08:24,660 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1757 transitions. Word has length 15 [2023-11-12 00:08:24,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:08:24,661 INFO L495 AbstractCegarLoop]: Abstraction has 728 states and 1757 transitions. [2023-11-12 00:08:24,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 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:08:24,661 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1757 transitions. [2023-11-12 00:08:24,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 00:08:24,662 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:08:24,662 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:08:24,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:08:24,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:08:24,873 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-12 00:08:24,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:08:24,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1292606418, now seen corresponding path program 1 times [2023-11-12 00:08:24,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:08:24,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597442205] [2023-11-12 00:08:24,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:24,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:08:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:25,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:08:25,817 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:08:25,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597442205] [2023-11-12 00:08:25,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597442205] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:08:25,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234164632] [2023-11-12 00:08:25,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:25,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:08:25,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:08:25,820 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:08:25,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:08:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:25,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-12 00:08:25,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:08:26,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:08:26,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:08:26,003 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 15 [2023-11-12 00:08:26,031 INFO L322 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-12 00:08:26,032 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-11-12 00:08:26,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:08:26,048 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 15 [2023-11-12 00:08:26,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:08:26,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:08:26,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:08:26,066 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:08:26,067 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-12 00:08:26,146 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 35 treesize of output 26 [2023-11-12 00:08:26,276 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2023-11-12 00:08:26,452 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 58 [2023-11-12 00:08:26,726 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 132 [2023-11-12 00:08:26,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:08:26,864 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 285 treesize of output 250 [2023-11-12 00:08:27,088 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 303 treesize of output 266 [2023-11-12 00:08:27,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:08:27,385 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:08:27,507 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| Int) (v_ArrVal_395 Int) (v_ArrVal_394 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_394) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_395) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-11-12 00:08:27,525 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| Int) (v_ArrVal_395 Int) (v_ArrVal_394 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_394) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_395) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-11-12 00:08:27,547 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| Int) (v_ArrVal_395 Int) (v_ArrVal_394 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| 1))) |c_~#stored_elements~0.base| v_ArrVal_394) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_395) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171|) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164|))))) is different from false [2023-11-12 00:08:27,587 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| Int) (v_ArrVal_395 Int) (v_ArrVal_394 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| 1))) |c_~#stored_elements~0.base| v_ArrVal_394) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171|) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_395) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164|))))) is different from false [2023-11-12 00:08:27,618 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| Int) (v_ArrVal_395 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_203| Int) (v_ArrVal_394 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_203| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| 1))) |c_~#stored_elements~0.base| v_ArrVal_394) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171|) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_203|) (< (select .cse3 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164|) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_395) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-11-12 00:08:27,652 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| Int) (v_ArrVal_395 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_203| Int) (v_ArrVal_394 (Array Int Int)) (v_ArrVal_390 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_390)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_203| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| 1))) |c_~#stored_elements~0.base| v_ArrVal_394) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171|) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_203|) (< (select .cse3 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164|) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_395) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-11-12 00:08:27,854 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_167| Int) (v_ArrVal_395 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_203| Int) (v_ArrVal_394 (Array Int Int)) (v_ArrVal_390 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| Int) (v_ArrVal_389 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_389))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_390)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_203| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| 1))) |c_~#stored_elements~0.base| v_ArrVal_394) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_395) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164|) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171|) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_167|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_203|))))))) is different from false [2023-11-12 00:08:27,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-12 00:08:27,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234164632] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:08:27,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1874876603] [2023-11-12 00:08:27,921 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:08:27,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:08:27,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-11-12 00:08:27,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951831464] [2023-11-12 00:08:27,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:08:27,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-12 00:08:27,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:08:27,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-12 00:08:27,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=569, Unknown=7, NotChecked=406, Total=1190 [2023-11-12 00:08:27,925 INFO L87 Difference]: Start difference. First operand 728 states and 1757 transitions. Second operand has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 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:08:32,874 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| Int) (v_ArrVal_395 Int) (v_ArrVal_394 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| 1))) |c_~#stored_elements~0.base| v_ArrVal_394) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_395) .cse1) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171|) (< (select .cse0 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| Int) (v_ArrVal_395 Int)) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_395) .cse1) 2147483647) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164|)))))) is different from false [2023-11-12 00:08:35,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:08:35,024 INFO L93 Difference]: Finished difference Result 1244 states and 3002 transitions. [2023-11-12 00:08:35,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-12 00:08:35,024 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-12 00:08:35,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:08:35,032 INFO L225 Difference]: With dead ends: 1244 [2023-11-12 00:08:35,033 INFO L226 Difference]: Without dead ends: 1244 [2023-11-12 00:08:35,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=423, Invalid=1160, Unknown=9, NotChecked=664, Total=2256 [2023-11-12 00:08:35,035 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 443 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 4032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2934 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:08:35,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 151 Invalid, 4032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1061 Invalid, 0 Unknown, 2934 Unchecked, 2.2s Time] [2023-11-12 00:08:35,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2023-11-12 00:08:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 849. [2023-11-12 00:08:35,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 831 states have (on average 2.523465703971119) internal successors, (2097), 848 states have internal predecessors, (2097), 0 states have call successors, (0), 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:08:35,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2097 transitions. [2023-11-12 00:08:35,067 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2097 transitions. Word has length 16 [2023-11-12 00:08:35,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:08:35,067 INFO L495 AbstractCegarLoop]: Abstraction has 849 states and 2097 transitions. [2023-11-12 00:08:35,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 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:08:35,068 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2097 transitions. [2023-11-12 00:08:35,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 00:08:35,069 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:08:35,069 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:08:35,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:08:35,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-12 00:08:35,275 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-12 00:08:35,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:08:35,277 INFO L85 PathProgramCache]: Analyzing trace with hash -2002989033, now seen corresponding path program 1 times [2023-11-12 00:08:35,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:08:35,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202583430] [2023-11-12 00:08:35,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:35,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:08:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:36,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:08:36,343 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:08:36,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202583430] [2023-11-12 00:08:36,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202583430] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:08:36,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048626063] [2023-11-12 00:08:36,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:36,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:08:36,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:08:36,348 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:08:36,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f995aa-809f-421b-8ac5-fa1b1fc34b3f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:08:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:36,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-12 00:08:36,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:08:36,536 INFO L322 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-12 00:08:36,536 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-11-12 00:08:36,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:08:36,828 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:08:36,907 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 25 treesize of output 13 [2023-11-12 00:08:36,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:08:36,956 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:08:37,067 INFO L322 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2023-11-12 00:08:37,067 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2023-11-12 00:08:37,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:08:37,136 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:08:37,799 INFO L322 Elim1Store]: treesize reduction 17, result has 66.0 percent of original size [2023-11-12 00:08:37,800 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2054 treesize of output 1878 [2023-11-12 00:08:37,836 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:08:37,836 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 208 treesize of output 208 [2023-11-12 00:08:37,860 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 271 treesize of output 259 [2023-11-12 00:08:37,886 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 130 treesize of output 114