./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a 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_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --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 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 23:36:17,580 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:36:17,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:36:17,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:36:17,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:36:17,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:36:17,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:36:17,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:36:17,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:36:17,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:36:17,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:36:17,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:36:17,617 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:36:17,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:36:17,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:36:17,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:36:17,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:36:17,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:36:17,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:36:17,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:36:17,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:36:17,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:36:17,659 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:36:17,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:36:17,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:36:17,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:36:17,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:36:17,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:36:17,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:36:17,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:36:17,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:36:17,674 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:36:17,675 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:36:17,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:36:17,678 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:36:17,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:36:17,679 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:36:17,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:36:17,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:36:17,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:36:17,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:36:17,690 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-25 23:36:17,730 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:36:17,730 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:36:17,731 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:36:17,731 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:36:17,732 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:36:17,732 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:36:17,733 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:36:17,733 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:36:17,733 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:36:17,733 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:36:17,735 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:36:17,735 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:36:17,735 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:36:17,735 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:36:17,736 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:36:17,736 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:36:17,736 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:36:17,737 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:36:17,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:36:17,738 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:36:17,738 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:36:17,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:36:17,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:36:17,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:36:17,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:36:17,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:36:17,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:36:17,740 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 23:36:17,741 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:36:17,741 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:36:17,741 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:36:17,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:36:17,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:36:17,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:36:17,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:36:17,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:36:17,745 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:36:17,745 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:36:17,745 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:36:17,745 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:36:17,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:36:17,746 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:36:17,746 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:36:17,746 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/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_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 [2022-11-25 23:36:18,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:36:18,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:36:18,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:36:18,111 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:36:18,112 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:36:18,113 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/pthread/queue.i [2022-11-25 23:36:21,082 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:36:21,379 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:36:21,379 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/sv-benchmarks/c/pthread/queue.i [2022-11-25 23:36:21,393 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/data/173c984cc/aa1e100ba10049138697f12b4135ddd9/FLAGa5b0859b6 [2022-11-25 23:36:21,407 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/data/173c984cc/aa1e100ba10049138697f12b4135ddd9 [2022-11-25 23:36:21,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:36:21,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:36:21,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:36:21,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:36:21,416 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:36:21,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:36:21" (1/1) ... [2022-11-25 23:36:21,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37bc1d26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:21, skipping insertion in model container [2022-11-25 23:36:21,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:36:21" (1/1) ... [2022-11-25 23:36:21,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:36:21,466 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:36:22,007 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/sv-benchmarks/c/pthread/queue.i[43284,43297] [2022-11-25 23:36:22,011 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/sv-benchmarks/c/pthread/queue.i[43491,43504] [2022-11-25 23:36:22,016 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/sv-benchmarks/c/pthread/queue.i[43772,43785] [2022-11-25 23:36:22,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:36:22,044 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:36:22,118 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/sv-benchmarks/c/pthread/queue.i[43284,43297] [2022-11-25 23:36:22,120 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/sv-benchmarks/c/pthread/queue.i[43491,43504] [2022-11-25 23:36:22,122 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/sv-benchmarks/c/pthread/queue.i[43772,43785] [2022-11-25 23:36:22,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:36:22,203 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:36:22,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:22 WrapperNode [2022-11-25 23:36:22,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:36:22,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:36:22,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:36:22,207 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:36:22,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:22" (1/1) ... [2022-11-25 23:36:22,243 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:22" (1/1) ... [2022-11-25 23:36:22,291 INFO L138 Inliner]: procedures = 274, calls = 68, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 268 [2022-11-25 23:36:22,292 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:36:22,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:36:22,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:36:22,293 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:36:22,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:22" (1/1) ... [2022-11-25 23:36:22,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:22" (1/1) ... [2022-11-25 23:36:22,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:22" (1/1) ... [2022-11-25 23:36:22,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:22" (1/1) ... [2022-11-25 23:36:22,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:22" (1/1) ... [2022-11-25 23:36:22,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:22" (1/1) ... [2022-11-25 23:36:22,361 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:22" (1/1) ... [2022-11-25 23:36:22,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:22" (1/1) ... [2022-11-25 23:36:22,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:36:22,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:36:22,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:36:22,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:36:22,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:22" (1/1) ... [2022-11-25 23:36:22,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:36:22,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:36:22,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:36:22,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:36:22,477 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-25 23:36:22,477 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-25 23:36:22,477 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-25 23:36:22,477 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-25 23:36:22,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:36:22,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:36:22,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:36:22,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:36:22,478 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-25 23:36:22,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:36:22,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:36:22,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:36:22,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:36:22,480 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 23:36:22,733 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:36:22,739 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:36:23,178 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:36:23,205 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:36:23,205 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 23:36:23,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:36:23 BoogieIcfgContainer [2022-11-25 23:36:23,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:36:23,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:36:23,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:36:23,214 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:36:23,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:36:21" (1/3) ... [2022-11-25 23:36:23,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a9c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:36:23, skipping insertion in model container [2022-11-25 23:36:23,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:22" (2/3) ... [2022-11-25 23:36:23,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a9c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:36:23, skipping insertion in model container [2022-11-25 23:36:23,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:36:23" (3/3) ... [2022-11-25 23:36:23,217 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2022-11-25 23:36:23,225 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 23:36:23,232 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:36:23,232 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-25 23:36:23,233 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 23:36:23,355 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-25 23:36:23,411 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 23:36:23,424 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 305 places, 313 transitions, 642 flow [2022-11-25 23:36:23,427 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 305 places, 313 transitions, 642 flow [2022-11-25 23:36:23,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 305 places, 313 transitions, 642 flow [2022-11-25 23:36:23,568 INFO L130 PetriNetUnfolder]: 15/311 cut-off events. [2022-11-25 23:36:23,569 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 23:36:23,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 311 events. 15/311 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 460 event pairs, 0 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 226. Up to 2 conditions per place. [2022-11-25 23:36:23,604 INFO L119 LiptonReduction]: Number of co-enabled transitions 23276 [2022-11-25 23:36:42,897 INFO L134 LiptonReduction]: Checked pairs total: 51296 [2022-11-25 23:36:42,897 INFO L136 LiptonReduction]: Total number of compositions: 298 [2022-11-25 23:36:42,913 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 82 transitions, 180 flow [2022-11-25 23:36:43,042 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1882 states, 1792 states have (on average 2.8286830357142856) internal successors, (5069), 1881 states have internal predecessors, (5069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:43,066 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:36:43,074 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=LoopsAndPotentialCycles, 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;@774fe6e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:36:43,075 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-11-25 23:36:43,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 1882 states, 1792 states have (on average 2.8286830357142856) internal successors, (5069), 1881 states have internal predecessors, (5069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:43,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 23:36:43,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:43,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 23:36:43,094 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:36:43,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:43,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1837679621, now seen corresponding path program 1 times [2022-11-25 23:36:43,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:43,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691251145] [2022-11-25 23:36:43,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:43,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:44,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:44,332 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:44,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691251145] [2022-11-25 23:36:44,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691251145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:44,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:44,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:36:44,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266563747] [2022-11-25 23:36:44,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:44,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:36:44,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:44,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:36:44,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:36:44,385 INFO L87 Difference]: Start difference. First operand has 1882 states, 1792 states have (on average 2.8286830357142856) internal successors, (5069), 1881 states have internal predecessors, (5069), 0 states have call successors, (0), 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.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:44,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:44,748 INFO L93 Difference]: Finished difference Result 1880 states and 4939 transitions. [2022-11-25 23:36:44,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:36:44,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-25 23:36:44,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:44,775 INFO L225 Difference]: With dead ends: 1880 [2022-11-25 23:36:44,775 INFO L226 Difference]: Without dead ends: 1880 [2022-11-25 23:36:44,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:36:44,779 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:44,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 21 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:36:44,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2022-11-25 23:36:44,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1880. [2022-11-25 23:36:44,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1790 states have (on average 2.7592178770949722) internal successors, (4939), 1879 states have internal predecessors, (4939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:44,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 4939 transitions. [2022-11-25 23:36:44,896 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 4939 transitions. Word has length 6 [2022-11-25 23:36:44,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:44,897 INFO L495 AbstractCegarLoop]: Abstraction has 1880 states and 4939 transitions. [2022-11-25 23:36:44,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:44,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 4939 transitions. [2022-11-25 23:36:44,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 23:36:44,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:44,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:44,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:36:44,899 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:36:44,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:44,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1133747194, now seen corresponding path program 1 times [2022-11-25 23:36:44,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:44,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110072809] [2022-11-25 23:36:44,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:44,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:45,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:45,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:45,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110072809] [2022-11-25 23:36:45,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110072809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:45,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:45,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:36:45,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419740082] [2022-11-25 23:36:45,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:45,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:36:45,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:45,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:36:45,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:36:45,588 INFO L87 Difference]: Start difference. First operand 1880 states and 4939 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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) [2022-11-25 23:36:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:45,964 INFO L93 Difference]: Finished difference Result 2033 states and 5332 transitions. [2022-11-25 23:36:45,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:36:45,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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 [2022-11-25 23:36:45,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:45,981 INFO L225 Difference]: With dead ends: 2033 [2022-11-25 23:36:45,981 INFO L226 Difference]: Without dead ends: 2033 [2022-11-25 23:36:45,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:36:45,984 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 92 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:45,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 23 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:36:45,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2022-11-25 23:36:46,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 1982. [2022-11-25 23:36:46,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1892 states have (on average 2.7489429175475686) internal successors, (5201), 1981 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 5201 transitions. [2022-11-25 23:36:46,058 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 5201 transitions. Word has length 7 [2022-11-25 23:36:46,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:46,058 INFO L495 AbstractCegarLoop]: Abstraction has 1982 states and 5201 transitions. [2022-11-25 23:36:46,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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) [2022-11-25 23:36:46,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 5201 transitions. [2022-11-25 23:36:46,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 23:36:46,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:46,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:46,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:36:46,062 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:36:46,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:46,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1133495164, now seen corresponding path program 2 times [2022-11-25 23:36:46,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:46,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653644561] [2022-11-25 23:36:46,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:46,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:47,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:47,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:47,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653644561] [2022-11-25 23:36:47,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653644561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:47,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:47,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:36:47,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158813327] [2022-11-25 23:36:47,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:47,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:36:47,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:47,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:36:47,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:36:47,063 INFO L87 Difference]: Start difference. First operand 1982 states and 5201 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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) [2022-11-25 23:36:47,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:47,745 INFO L93 Difference]: Finished difference Result 2048 states and 5373 transitions. [2022-11-25 23:36:47,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:36:47,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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 [2022-11-25 23:36:47,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:47,758 INFO L225 Difference]: With dead ends: 2048 [2022-11-25 23:36:47,758 INFO L226 Difference]: Without dead ends: 2048 [2022-11-25 23:36:47,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:36:47,763 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 62 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:47,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 28 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:36:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2022-11-25 23:36:47,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 1970. [2022-11-25 23:36:47,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1970 states, 1880 states have (on average 2.751595744680851) internal successors, (5173), 1969 states have internal predecessors, (5173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:47,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 5173 transitions. [2022-11-25 23:36:47,861 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 5173 transitions. Word has length 7 [2022-11-25 23:36:47,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:47,861 INFO L495 AbstractCegarLoop]: Abstraction has 1970 states and 5173 transitions. [2022-11-25 23:36:47,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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) [2022-11-25 23:36:47,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 5173 transitions. [2022-11-25 23:36:47,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 23:36:47,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:47,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:47,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:36:47,864 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:36:47,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:47,865 INFO L85 PathProgramCache]: Analyzing trace with hash 260171919, now seen corresponding path program 1 times [2022-11-25 23:36:47,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:47,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423035111] [2022-11-25 23:36:47,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:47,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:47,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:47,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:47,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423035111] [2022-11-25 23:36:47,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423035111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:47,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:47,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:36:47,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742383529] [2022-11-25 23:36:47,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:47,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:36:47,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:47,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:36:47,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:36:47,935 INFO L87 Difference]: Start difference. First operand 1970 states and 5173 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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) [2022-11-25 23:36:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:48,140 INFO L93 Difference]: Finished difference Result 3434 states and 9083 transitions. [2022-11-25 23:36:48,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:36:48,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 [2022-11-25 23:36:48,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:48,159 INFO L225 Difference]: With dead ends: 3434 [2022-11-25 23:36:48,160 INFO L226 Difference]: Without dead ends: 3434 [2022-11-25 23:36:48,160 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 [2022-11-25 23:36:48,162 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 63 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:48,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 19 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:36:48,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2022-11-25 23:36:48,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 3114. [2022-11-25 23:36:48,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3114 states, 3024 states have (on average 2.8382936507936507) internal successors, (8583), 3113 states have internal predecessors, (8583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:48,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 8583 transitions. [2022-11-25 23:36:48,277 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 8583 transitions. Word has length 8 [2022-11-25 23:36:48,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:48,278 INFO L495 AbstractCegarLoop]: Abstraction has 3114 states and 8583 transitions. [2022-11-25 23:36:48,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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) [2022-11-25 23:36:48,278 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 8583 transitions. [2022-11-25 23:36:48,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:36:48,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:48,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:48,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:36:48,285 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:36:48,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:48,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1633551636, now seen corresponding path program 1 times [2022-11-25 23:36:48,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:48,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750082068] [2022-11-25 23:36:48,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:48,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:48,678 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:48,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750082068] [2022-11-25 23:36:48,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750082068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:48,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:48,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:36:48,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784744083] [2022-11-25 23:36:48,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:48,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:36:48,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:48,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:36:48,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:36:48,681 INFO L87 Difference]: Start difference. First operand 3114 states and 8583 transitions. Second operand has 5 states, 4 states have (on average 2.25) 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) [2022-11-25 23:36:48,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:48,916 INFO L93 Difference]: Finished difference Result 3111 states and 8576 transitions. [2022-11-25 23:36:48,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:36:48,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) 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 [2022-11-25 23:36:48,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:48,933 INFO L225 Difference]: With dead ends: 3111 [2022-11-25 23:36:48,934 INFO L226 Difference]: Without dead ends: 3111 [2022-11-25 23:36:48,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:36:48,935 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:48,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 21 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:36:48,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2022-11-25 23:36:49,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 3111. [2022-11-25 23:36:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3111 states, 3021 states have (on average 2.8387951009599472) internal successors, (8576), 3110 states have internal predecessors, (8576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 3111 states and 8576 transitions. [2022-11-25 23:36:49,048 INFO L78 Accepts]: Start accepts. Automaton has 3111 states and 8576 transitions. Word has length 9 [2022-11-25 23:36:49,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:49,049 INFO L495 AbstractCegarLoop]: Abstraction has 3111 states and 8576 transitions. [2022-11-25 23:36:49,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) 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) [2022-11-25 23:36:49,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3111 states and 8576 transitions. [2022-11-25 23:36:49,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:36:49,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:49,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:49,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:36:49,054 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:36:49,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:49,054 INFO L85 PathProgramCache]: Analyzing trace with hash -526806488, now seen corresponding path program 1 times [2022-11-25 23:36:49,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:49,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780407786] [2022-11-25 23:36:49,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:49,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:49,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:49,122 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:49,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780407786] [2022-11-25 23:36:49,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780407786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:49,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:49,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:36:49,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787389989] [2022-11-25 23:36:49,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:49,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:36:49,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:49,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:36:49,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:36:49,124 INFO L87 Difference]: Start difference. First operand 3111 states and 8576 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:49,263 INFO L93 Difference]: Finished difference Result 2873 states and 7689 transitions. [2022-11-25 23:36:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:36:49,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 23:36:49,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:49,288 INFO L225 Difference]: With dead ends: 2873 [2022-11-25 23:36:49,289 INFO L226 Difference]: Without dead ends: 2865 [2022-11-25 23:36:49,289 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 [2022-11-25 23:36:49,290 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 50 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:49,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 12 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:36:49,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2022-11-25 23:36:49,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2705. [2022-11-25 23:36:49,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2705 states, 2627 states have (on average 2.832508564902931) internal successors, (7441), 2704 states have internal predecessors, (7441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2705 states and 7441 transitions. [2022-11-25 23:36:49,378 INFO L78 Accepts]: Start accepts. Automaton has 2705 states and 7441 transitions. Word has length 9 [2022-11-25 23:36:49,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:49,380 INFO L495 AbstractCegarLoop]: Abstraction has 2705 states and 7441 transitions. [2022-11-25 23:36:49,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 7441 transitions. [2022-11-25 23:36:49,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 23:36:49,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:49,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:49,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:36:49,382 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:36:49,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:49,382 INFO L85 PathProgramCache]: Analyzing trace with hash -159178025, now seen corresponding path program 1 times [2022-11-25 23:36:49,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:49,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742074128] [2022-11-25 23:36:49,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:49,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:49,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:49,794 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:49,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742074128] [2022-11-25 23:36:49,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742074128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:49,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:49,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:36:49,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926985770] [2022-11-25 23:36:49,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:49,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:36:49,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:49,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:36:49,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:36:49,797 INFO L87 Difference]: Start difference. First operand 2705 states and 7441 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) [2022-11-25 23:36:50,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:50,053 INFO L93 Difference]: Finished difference Result 2855 states and 7813 transitions. [2022-11-25 23:36:50,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:36:50,054 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 [2022-11-25 23:36:50,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:50,076 INFO L225 Difference]: With dead ends: 2855 [2022-11-25 23:36:50,077 INFO L226 Difference]: Without dead ends: 2855 [2022-11-25 23:36:50,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:36:50,078 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 62 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:50,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 23 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:36:50,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2022-11-25 23:36:50,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2830. [2022-11-25 23:36:50,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2830 states, 2752 states have (on average 2.816497093023256) internal successors, (7751), 2829 states have internal predecessors, (7751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:50,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2830 states and 7751 transitions. [2022-11-25 23:36:50,171 INFO L78 Accepts]: Start accepts. Automaton has 2830 states and 7751 transitions. Word has length 10 [2022-11-25 23:36:50,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:50,171 INFO L495 AbstractCegarLoop]: Abstraction has 2830 states and 7751 transitions. [2022-11-25 23:36:50,171 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) [2022-11-25 23:36:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 7751 transitions. [2022-11-25 23:36:50,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 23:36:50,177 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:50,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:50,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:36:50,177 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:36:50,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:50,178 INFO L85 PathProgramCache]: Analyzing trace with hash 905549967, now seen corresponding path program 2 times [2022-11-25 23:36:50,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:50,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779299949] [2022-11-25 23:36:50,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:50,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:51,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:51,025 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:51,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779299949] [2022-11-25 23:36:51,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779299949] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:51,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:51,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:36:51,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054048002] [2022-11-25 23:36:51,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:51,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:36:51,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:51,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:36:51,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:36:51,026 INFO L87 Difference]: Start difference. First operand 2830 states and 7751 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) [2022-11-25 23:36:51,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:51,476 INFO L93 Difference]: Finished difference Result 2759 states and 7542 transitions. [2022-11-25 23:36:51,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:36:51,477 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 [2022-11-25 23:36:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:51,486 INFO L225 Difference]: With dead ends: 2759 [2022-11-25 23:36:51,487 INFO L226 Difference]: Without dead ends: 2759 [2022-11-25 23:36:51,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:36:51,488 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 94 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:51,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 18 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:36:51,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2022-11-25 23:36:51,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2634. [2022-11-25 23:36:51,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 2564 states have (on average 2.8205928237129485) internal successors, (7232), 2633 states have internal predecessors, (7232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 7232 transitions. [2022-11-25 23:36:51,599 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 7232 transitions. Word has length 10 [2022-11-25 23:36:51,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:51,600 INFO L495 AbstractCegarLoop]: Abstraction has 2634 states and 7232 transitions. [2022-11-25 23:36:51,600 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) [2022-11-25 23:36:51,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 7232 transitions. [2022-11-25 23:36:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:36:51,601 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:51,601 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:51,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:36:51,602 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:36:51,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:51,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1630038228, now seen corresponding path program 1 times [2022-11-25 23:36:51,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:51,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144522405] [2022-11-25 23:36:51,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:51,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:51,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:51,678 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:51,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144522405] [2022-11-25 23:36:51,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144522405] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:51,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981846748] [2022-11-25 23:36:51,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:51,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:51,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:36:51,684 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:36:51,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:36:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:51,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:36:51,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:36:51,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:51,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:36:51,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981846748] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:51,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:36:51,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-11-25 23:36:51,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428357276] [2022-11-25 23:36:51,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:51,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:36:51,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:51,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:36:51,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:36:51,938 INFO L87 Difference]: Start difference. First operand 2634 states and 7232 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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) [2022-11-25 23:36:52,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:52,215 INFO L93 Difference]: Finished difference Result 2770 states and 7309 transitions. [2022-11-25 23:36:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:36:52,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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 [2022-11-25 23:36:52,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:52,226 INFO L225 Difference]: With dead ends: 2770 [2022-11-25 23:36:52,226 INFO L226 Difference]: Without dead ends: 2770 [2022-11-25 23:36:52,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:36:52,227 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 116 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:52,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 36 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:36:52,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2022-11-25 23:36:52,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2562. [2022-11-25 23:36:52,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2562 states, 2501 states have (on average 2.799280287884846) internal successors, (7001), 2561 states have internal predecessors, (7001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 7001 transitions. [2022-11-25 23:36:52,305 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 7001 transitions. Word has length 11 [2022-11-25 23:36:52,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:52,306 INFO L495 AbstractCegarLoop]: Abstraction has 2562 states and 7001 transitions. [2022-11-25 23:36:52,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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) [2022-11-25 23:36:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 7001 transitions. [2022-11-25 23:36:52,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:36:52,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:52,307 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:52,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:36:52,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:52,524 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:36:52,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:52,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1630038143, now seen corresponding path program 1 times [2022-11-25 23:36:52,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:52,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259025202] [2022-11-25 23:36:52,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:52,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:36:52,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:52,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259025202] [2022-11-25 23:36:52,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259025202] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:52,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:52,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:36:52,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169532932] [2022-11-25 23:36:52,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:52,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:36:52,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:52,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:36:52,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:36:52,568 INFO L87 Difference]: Start difference. First operand 2562 states and 7001 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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) [2022-11-25 23:36:52,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:52,718 INFO L93 Difference]: Finished difference Result 2490 states and 6770 transitions. [2022-11-25 23:36:52,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:36:52,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 [2022-11-25 23:36:52,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:52,727 INFO L225 Difference]: With dead ends: 2490 [2022-11-25 23:36:52,727 INFO L226 Difference]: Without dead ends: 2420 [2022-11-25 23:36:52,728 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 [2022-11-25 23:36:52,728 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 57 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:52,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 17 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:36:52,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2022-11-25 23:36:52,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1576. [2022-11-25 23:36:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1524 states have (on average 2.776246719160105) internal successors, (4231), 1575 states have internal predecessors, (4231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:52,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 4231 transitions. [2022-11-25 23:36:52,781 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 4231 transitions. Word has length 11 [2022-11-25 23:36:52,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:52,781 INFO L495 AbstractCegarLoop]: Abstraction has 1576 states and 4231 transitions. [2022-11-25 23:36:52,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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) [2022-11-25 23:36:52,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 4231 transitions. [2022-11-25 23:36:52,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:36:52,783 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:52,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:52,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 23:36:52,783 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:36:52,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:52,784 INFO L85 PathProgramCache]: Analyzing trace with hash -921370203, now seen corresponding path program 1 times [2022-11-25 23:36:52,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:52,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067826932] [2022-11-25 23:36:52,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:52,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:52,879 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:52,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067826932] [2022-11-25 23:36:52,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067826932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:52,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:52,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:36:52,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47746710] [2022-11-25 23:36:52,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:52,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:36:52,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:52,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:36:52,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:36:52,881 INFO L87 Difference]: Start difference. First operand 1576 states and 4231 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:53,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:53,029 INFO L93 Difference]: Finished difference Result 1948 states and 5225 transitions. [2022-11-25 23:36:53,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:36:53,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-11-25 23:36:53,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:53,037 INFO L225 Difference]: With dead ends: 1948 [2022-11-25 23:36:53,037 INFO L226 Difference]: Without dead ends: 1948 [2022-11-25 23:36:53,037 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 [2022-11-25 23:36:53,038 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 42 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:53,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 15 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:36:53,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2022-11-25 23:36:53,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1884. [2022-11-25 23:36:53,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1832 states have (on average 2.7974890829694323) internal successors, (5125), 1883 states have internal predecessors, (5125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:53,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 5125 transitions. [2022-11-25 23:36:53,094 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 5125 transitions. Word has length 17 [2022-11-25 23:36:53,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:53,095 INFO L495 AbstractCegarLoop]: Abstraction has 1884 states and 5125 transitions. [2022-11-25 23:36:53,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:53,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 5125 transitions. [2022-11-25 23:36:53,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 23:36:53,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:53,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:53,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 23:36:53,097 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:36:53,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:53,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1500750492, now seen corresponding path program 1 times [2022-11-25 23:36:53,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:53,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207511083] [2022-11-25 23:36:53,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:53,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:54,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:54,276 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:54,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207511083] [2022-11-25 23:36:54,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207511083] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:54,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:54,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 23:36:54,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763304091] [2022-11-25 23:36:54,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:54,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:36:54,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:54,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:36:54,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:36:54,278 INFO L87 Difference]: Start difference. First operand 1884 states and 5125 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:55,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:55,137 INFO L93 Difference]: Finished difference Result 1939 states and 5215 transitions. [2022-11-25 23:36:55,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 23:36:55,138 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 23:36:55,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:55,145 INFO L225 Difference]: With dead ends: 1939 [2022-11-25 23:36:55,145 INFO L226 Difference]: Without dead ends: 1939 [2022-11-25 23:36:55,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-11-25 23:36:55,146 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 44 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:55,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 75 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:36:55,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2022-11-25 23:36:55,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1883. [2022-11-25 23:36:55,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1831 states have (on average 2.797378481703987) internal successors, (5122), 1882 states have internal predecessors, (5122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:55,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 5122 transitions. [2022-11-25 23:36:55,199 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 5122 transitions. Word has length 18 [2022-11-25 23:36:55,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:55,199 INFO L495 AbstractCegarLoop]: Abstraction has 1883 states and 5122 transitions. [2022-11-25 23:36:55,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:55,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 5122 transitions. [2022-11-25 23:36:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 23:36:55,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:55,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:55,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 23:36:55,201 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:36:55,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:55,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1500750513, now seen corresponding path program 1 times [2022-11-25 23:36:55,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:55,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640908982] [2022-11-25 23:36:55,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:55,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:56,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:56,311 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:56,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640908982] [2022-11-25 23:36:56,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640908982] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:56,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:56,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 23:36:56,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410255948] [2022-11-25 23:36:56,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:56,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:36:56,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:56,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:36:56,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:36:56,313 INFO L87 Difference]: Start difference. First operand 1883 states and 5122 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:57,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:57,005 INFO L93 Difference]: Finished difference Result 1933 states and 5203 transitions. [2022-11-25 23:36:57,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 23:36:57,005 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 23:36:57,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:57,015 INFO L225 Difference]: With dead ends: 1933 [2022-11-25 23:36:57,016 INFO L226 Difference]: Without dead ends: 1933 [2022-11-25 23:36:57,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2022-11-25 23:36:57,017 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 46 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:57,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 50 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:36:57,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2022-11-25 23:36:57,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1882. [2022-11-25 23:36:57,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1830 states have (on average 2.7972677595628417) internal successors, (5119), 1881 states have internal predecessors, (5119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:57,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 5119 transitions. [2022-11-25 23:36:57,077 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 5119 transitions. Word has length 18 [2022-11-25 23:36:57,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:57,078 INFO L495 AbstractCegarLoop]: Abstraction has 1882 states and 5119 transitions. [2022-11-25 23:36:57,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:57,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 5119 transitions. [2022-11-25 23:36:57,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:36:57,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:57,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:57,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 23:36:57,080 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:36:57,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:57,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1101450479, now seen corresponding path program 1 times [2022-11-25 23:36:57,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:57,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209298133] [2022-11-25 23:36:57,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:57,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:58,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:58,111 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:58,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209298133] [2022-11-25 23:36:58,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209298133] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:58,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:58,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 23:36:58,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763089740] [2022-11-25 23:36:58,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:58,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 23:36:58,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:58,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 23:36:58,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:36:58,113 INFO L87 Difference]: Start difference. First operand 1882 states and 5119 transitions. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:59,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:59,114 INFO L93 Difference]: Finished difference Result 2278 states and 6160 transitions. [2022-11-25 23:36:59,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 23:36:59,115 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-25 23:36:59,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:59,122 INFO L225 Difference]: With dead ends: 2278 [2022-11-25 23:36:59,123 INFO L226 Difference]: Without dead ends: 2278 [2022-11-25 23:36:59,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2022-11-25 23:36:59,123 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 189 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:59,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 97 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 23:36:59,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2022-11-25 23:36:59,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2167. [2022-11-25 23:36:59,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2167 states, 2115 states have (on average 2.813238770685579) internal successors, (5950), 2166 states have internal predecessors, (5950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 5950 transitions. [2022-11-25 23:36:59,178 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 5950 transitions. Word has length 19 [2022-11-25 23:36:59,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:59,178 INFO L495 AbstractCegarLoop]: Abstraction has 2167 states and 5950 transitions. [2022-11-25 23:36:59,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 5950 transitions. [2022-11-25 23:36:59,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:36:59,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:59,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:59,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 23:36:59,180 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:36:59,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:59,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1101450458, now seen corresponding path program 1 times [2022-11-25 23:36:59,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:59,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903447826] [2022-11-25 23:36:59,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:59,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:00,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:00,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:00,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903447826] [2022-11-25 23:37:00,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903447826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:00,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:00,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 23:37:00,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317538673] [2022-11-25 23:37:00,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:00,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 23:37:00,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:00,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 23:37:00,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:37:00,389 INFO L87 Difference]: Start difference. First operand 2167 states and 5950 transitions. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:01,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:01,264 INFO L93 Difference]: Finished difference Result 2278 states and 6130 transitions. [2022-11-25 23:37:01,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 23:37:01,265 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-25 23:37:01,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:01,273 INFO L225 Difference]: With dead ends: 2278 [2022-11-25 23:37:01,274 INFO L226 Difference]: Without dead ends: 2278 [2022-11-25 23:37:01,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-11-25 23:37:01,275 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 212 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:01,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 80 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:37:01,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2022-11-25 23:37:01,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2167. [2022-11-25 23:37:01,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2167 states, 2115 states have (on average 2.7990543735224587) internal successors, (5920), 2166 states have internal predecessors, (5920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:01,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 5920 transitions. [2022-11-25 23:37:01,334 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 5920 transitions. Word has length 19 [2022-11-25 23:37:01,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:01,334 INFO L495 AbstractCegarLoop]: Abstraction has 2167 states and 5920 transitions. [2022-11-25 23:37:01,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:01,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 5920 transitions. [2022-11-25 23:37:01,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:37:01,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:01,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:01,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 23:37:01,336 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:37:01,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:01,337 INFO L85 PathProgramCache]: Analyzing trace with hash 633753723, now seen corresponding path program 2 times [2022-11-25 23:37:01,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:01,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969125871] [2022-11-25 23:37:01,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:01,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:02,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:02,260 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:02,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969125871] [2022-11-25 23:37:02,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969125871] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:02,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:02,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 23:37:02,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280350557] [2022-11-25 23:37:02,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:02,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:37:02,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:02,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:37:02,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:37:02,262 INFO L87 Difference]: Start difference. First operand 2167 states and 5920 transitions. Second operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:03,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:03,168 INFO L93 Difference]: Finished difference Result 2368 states and 6425 transitions. [2022-11-25 23:37:03,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 23:37:03,169 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-25 23:37:03,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:03,177 INFO L225 Difference]: With dead ends: 2368 [2022-11-25 23:37:03,177 INFO L226 Difference]: Without dead ends: 2368 [2022-11-25 23:37:03,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-11-25 23:37:03,178 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 184 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:03,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 93 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:37:03,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2022-11-25 23:37:03,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2267. [2022-11-25 23:37:03,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2267 states, 2215 states have (on average 2.8139954853273137) internal successors, (6233), 2266 states have internal predecessors, (6233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 6233 transitions. [2022-11-25 23:37:03,238 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 6233 transitions. Word has length 19 [2022-11-25 23:37:03,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:03,238 INFO L495 AbstractCegarLoop]: Abstraction has 2267 states and 6233 transitions. [2022-11-25 23:37:03,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:03,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 6233 transitions. [2022-11-25 23:37:03,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:37:03,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:03,240 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:03,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 23:37:03,241 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:37:03,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:03,241 INFO L85 PathProgramCache]: Analyzing trace with hash 633753744, now seen corresponding path program 2 times [2022-11-25 23:37:03,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:03,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168522322] [2022-11-25 23:37:03,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:03,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:04,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:04,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:04,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168522322] [2022-11-25 23:37:04,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168522322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:04,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:04,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 23:37:04,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10075777] [2022-11-25 23:37:04,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:04,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 23:37:04,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:04,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 23:37:04,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:37:04,302 INFO L87 Difference]: Start difference. First operand 2267 states and 6233 transitions. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:05,248 INFO L93 Difference]: Finished difference Result 2618 states and 7127 transitions. [2022-11-25 23:37:05,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 23:37:05,248 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-25 23:37:05,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:05,258 INFO L225 Difference]: With dead ends: 2618 [2022-11-25 23:37:05,258 INFO L226 Difference]: Without dead ends: 2618 [2022-11-25 23:37:05,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2022-11-25 23:37:05,259 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 228 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:05,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 82 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:37:05,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2022-11-25 23:37:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2222. [2022-11-25 23:37:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2222 states, 2170 states have (on average 2.8184331797235025) internal successors, (6116), 2221 states have internal predecessors, (6116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 6116 transitions. [2022-11-25 23:37:05,316 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 6116 transitions. Word has length 19 [2022-11-25 23:37:05,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:05,316 INFO L495 AbstractCegarLoop]: Abstraction has 2222 states and 6116 transitions. [2022-11-25 23:37:05,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:05,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 6116 transitions. [2022-11-25 23:37:05,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:37:05,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:05,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:05,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 23:37:05,318 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:37:05,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:05,319 INFO L85 PathProgramCache]: Analyzing trace with hash -384618842, now seen corresponding path program 3 times [2022-11-25 23:37:05,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:05,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617766352] [2022-11-25 23:37:05,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:05,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:06,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:06,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:06,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617766352] [2022-11-25 23:37:06,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617766352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:06,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:06,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 23:37:06,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568437479] [2022-11-25 23:37:06,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:06,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 23:37:06,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:06,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 23:37:06,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:37:06,301 INFO L87 Difference]: Start difference. First operand 2222 states and 6116 transitions. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:07,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:07,266 INFO L93 Difference]: Finished difference Result 2383 states and 6464 transitions. [2022-11-25 23:37:07,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 23:37:07,267 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-25 23:37:07,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:07,275 INFO L225 Difference]: With dead ends: 2383 [2022-11-25 23:37:07,275 INFO L226 Difference]: Without dead ends: 2383 [2022-11-25 23:37:07,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-11-25 23:37:07,276 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 182 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:07,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 89 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:37:07,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2022-11-25 23:37:07,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2042. [2022-11-25 23:37:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 1990 states have (on average 2.808040201005025) internal successors, (5588), 2041 states have internal predecessors, (5588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:07,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 5588 transitions. [2022-11-25 23:37:07,327 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 5588 transitions. Word has length 19 [2022-11-25 23:37:07,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:07,327 INFO L495 AbstractCegarLoop]: Abstraction has 2042 states and 5588 transitions. [2022-11-25 23:37:07,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:07,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 5588 transitions. [2022-11-25 23:37:07,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:37:07,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:07,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:07,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 23:37:07,329 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:37:07,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:07,330 INFO L85 PathProgramCache]: Analyzing trace with hash -721372763, now seen corresponding path program 3 times [2022-11-25 23:37:07,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:07,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845876039] [2022-11-25 23:37:07,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:07,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:08,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:08,360 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:08,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845876039] [2022-11-25 23:37:08,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845876039] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:08,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:08,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 23:37:08,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756704672] [2022-11-25 23:37:08,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:08,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 23:37:08,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:08,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 23:37:08,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:37:08,362 INFO L87 Difference]: Start difference. First operand 2042 states and 5588 transitions. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:09,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:09,256 INFO L93 Difference]: Finished difference Result 2138 states and 5748 transitions. [2022-11-25 23:37:09,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 23:37:09,257 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-25 23:37:09,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:09,263 INFO L225 Difference]: With dead ends: 2138 [2022-11-25 23:37:09,263 INFO L226 Difference]: Without dead ends: 2138 [2022-11-25 23:37:09,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-11-25 23:37:09,265 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 195 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:09,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 90 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:37:09,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2022-11-25 23:37:09,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 2017. [2022-11-25 23:37:09,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 1965 states have (on average 2.7918575063613233) internal successors, (5486), 2016 states have internal predecessors, (5486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 5486 transitions. [2022-11-25 23:37:09,311 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 5486 transitions. Word has length 19 [2022-11-25 23:37:09,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:09,311 INFO L495 AbstractCegarLoop]: Abstraction has 2017 states and 5486 transitions. [2022-11-25 23:37:09,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:09,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 5486 transitions. [2022-11-25 23:37:09,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:37:09,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:09,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:09,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 23:37:09,313 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:37:09,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:09,313 INFO L85 PathProgramCache]: Analyzing trace with hash -721372742, now seen corresponding path program 4 times [2022-11-25 23:37:09,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:09,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122863602] [2022-11-25 23:37:09,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:09,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:10,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:10,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122863602] [2022-11-25 23:37:10,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122863602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:10,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:10,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 23:37:10,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116531978] [2022-11-25 23:37:10,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:10,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 23:37:10,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:10,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 23:37:10,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:37:10,429 INFO L87 Difference]: Start difference. First operand 2017 states and 5486 transitions. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:11,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:11,113 INFO L93 Difference]: Finished difference Result 2093 states and 5586 transitions. [2022-11-25 23:37:11,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 23:37:11,114 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-25 23:37:11,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:11,120 INFO L225 Difference]: With dead ends: 2093 [2022-11-25 23:37:11,120 INFO L226 Difference]: Without dead ends: 2093 [2022-11-25 23:37:11,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-11-25 23:37:11,121 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 262 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:11,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 63 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:37:11,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2022-11-25 23:37:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1952. [2022-11-25 23:37:11,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1900 states have (on average 2.784736842105263) internal successors, (5291), 1951 states have internal predecessors, (5291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:11,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 5291 transitions. [2022-11-25 23:37:11,166 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 5291 transitions. Word has length 19 [2022-11-25 23:37:11,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:11,167 INFO L495 AbstractCegarLoop]: Abstraction has 1952 states and 5291 transitions. [2022-11-25 23:37:11,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:11,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 5291 transitions. [2022-11-25 23:37:11,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:37:11,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:11,168 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:11,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 23:37:11,169 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:37:11,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:11,169 INFO L85 PathProgramCache]: Analyzing trace with hash 599696313, now seen corresponding path program 1 times [2022-11-25 23:37:11,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:11,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405416016] [2022-11-25 23:37:11,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:11,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:37:11,218 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:11,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405416016] [2022-11-25 23:37:11,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405416016] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:11,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:11,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:37:11,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114032970] [2022-11-25 23:37:11,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:11,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:37:11,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:11,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:37:11,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:37:11,220 INFO L87 Difference]: Start difference. First operand 1952 states and 5291 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:11,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:11,352 INFO L93 Difference]: Finished difference Result 1832 states and 4965 transitions. [2022-11-25 23:37:11,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:37:11,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-11-25 23:37:11,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:11,358 INFO L225 Difference]: With dead ends: 1832 [2022-11-25 23:37:11,358 INFO L226 Difference]: Without dead ends: 1832 [2022-11-25 23:37:11,359 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 [2022-11-25 23:37:11,359 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 44 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:11,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 11 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:37:11,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2022-11-25 23:37:11,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1832. [2022-11-25 23:37:11,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1832 states, 1792 states have (on average 2.7706473214285716) internal successors, (4965), 1831 states have internal predecessors, (4965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 4965 transitions. [2022-11-25 23:37:11,404 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 4965 transitions. Word has length 20 [2022-11-25 23:37:11,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:11,405 INFO L495 AbstractCegarLoop]: Abstraction has 1832 states and 4965 transitions. [2022-11-25 23:37:11,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 4965 transitions. [2022-11-25 23:37:11,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:37:11,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:11,407 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:11,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 23:37:11,407 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:37:11,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:11,408 INFO L85 PathProgramCache]: Analyzing trace with hash 599696270, now seen corresponding path program 1 times [2022-11-25 23:37:11,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:11,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84443621] [2022-11-25 23:37:11,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:11,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:11,459 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:11,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84443621] [2022-11-25 23:37:11,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84443621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:11,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:11,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:37:11,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731739011] [2022-11-25 23:37:11,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:11,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:37:11,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:11,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:37:11,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:37:11,462 INFO L87 Difference]: Start difference. First operand 1832 states and 4965 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:11,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:11,554 INFO L93 Difference]: Finished difference Result 1712 states and 4639 transitions. [2022-11-25 23:37:11,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:37:11,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-11-25 23:37:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:11,565 INFO L225 Difference]: With dead ends: 1712 [2022-11-25 23:37:11,565 INFO L226 Difference]: Without dead ends: 1712 [2022-11-25 23:37:11,568 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 [2022-11-25 23:37:11,568 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 45 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:11,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 10 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:37:11,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-11-25 23:37:11,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1384. [2022-11-25 23:37:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1356 states have (on average 2.7485250737463125) internal successors, (3727), 1383 states have internal predecessors, (3727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:11,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 3727 transitions. [2022-11-25 23:37:11,601 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 3727 transitions. Word has length 20 [2022-11-25 23:37:11,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:11,602 INFO L495 AbstractCegarLoop]: Abstraction has 1384 states and 3727 transitions. [2022-11-25 23:37:11,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 3727 transitions. [2022-11-25 23:37:11,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:37:11,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:11,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:11,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 23:37:11,604 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:37:11,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:11,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1750122606, now seen corresponding path program 1 times [2022-11-25 23:37:11,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:11,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695105242] [2022-11-25 23:37:11,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:11,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:12,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:12,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695105242] [2022-11-25 23:37:12,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695105242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:12,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:12,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 23:37:12,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570749827] [2022-11-25 23:37:12,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:12,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:37:12,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:12,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:37:12,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:37:12,162 INFO L87 Difference]: Start difference. First operand 1384 states and 3727 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:12,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:12,992 INFO L93 Difference]: Finished difference Result 3684 states and 10100 transitions. [2022-11-25 23:37:12,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 23:37:12,992 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:37:12,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:13,004 INFO L225 Difference]: With dead ends: 3684 [2022-11-25 23:37:13,004 INFO L226 Difference]: Without dead ends: 3684 [2022-11-25 23:37:13,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:37:13,005 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 488 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:13,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 59 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:37:13,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3684 states. [2022-11-25 23:37:13,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3684 to 2192. [2022-11-25 23:37:13,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2192 states, 2164 states have (on average 2.858133086876155) internal successors, (6185), 2191 states have internal predecessors, (6185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 6185 transitions. [2022-11-25 23:37:13,092 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 6185 transitions. Word has length 21 [2022-11-25 23:37:13,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:13,092 INFO L495 AbstractCegarLoop]: Abstraction has 2192 states and 6185 transitions. [2022-11-25 23:37:13,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:13,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 6185 transitions. [2022-11-25 23:37:13,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:37:13,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:13,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:13,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 23:37:13,094 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:37:13,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:13,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1750122605, now seen corresponding path program 1 times [2022-11-25 23:37:13,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:13,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132514357] [2022-11-25 23:37:13,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:13,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:13,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:13,861 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:13,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132514357] [2022-11-25 23:37:13,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132514357] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:13,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:13,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 23:37:13,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372078658] [2022-11-25 23:37:13,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:13,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 23:37:13,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:13,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 23:37:13,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:37:13,863 INFO L87 Difference]: Start difference. First operand 2192 states and 6185 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:14,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:14,418 INFO L93 Difference]: Finished difference Result 2502 states and 6980 transitions. [2022-11-25 23:37:14,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 23:37:14,419 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:37:14,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:14,425 INFO L225 Difference]: With dead ends: 2502 [2022-11-25 23:37:14,425 INFO L226 Difference]: Without dead ends: 2502 [2022-11-25 23:37:14,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:37:14,426 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 96 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:14,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 63 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:37:14,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2022-11-25 23:37:14,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 2400. [2022-11-25 23:37:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 2372 states have (on average 2.8419055649241147) internal successors, (6741), 2399 states have internal predecessors, (6741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:14,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 6741 transitions. [2022-11-25 23:37:14,523 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 6741 transitions. Word has length 21 [2022-11-25 23:37:14,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:14,523 INFO L495 AbstractCegarLoop]: Abstraction has 2400 states and 6741 transitions. [2022-11-25 23:37:14,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 6741 transitions. [2022-11-25 23:37:14,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:37:14,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:14,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:14,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 23:37:14,528 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:37:14,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:14,528 INFO L85 PathProgramCache]: Analyzing trace with hash 240443134, now seen corresponding path program 1 times [2022-11-25 23:37:14,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:14,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562956599] [2022-11-25 23:37:14,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:14,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:15,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:15,377 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:15,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562956599] [2022-11-25 23:37:15,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562956599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:15,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:15,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 23:37:15,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210796135] [2022-11-25 23:37:15,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:15,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 23:37:15,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:15,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 23:37:15,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:37:15,379 INFO L87 Difference]: Start difference. First operand 2400 states and 6741 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:16,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:16,023 INFO L93 Difference]: Finished difference Result 2532 states and 7045 transitions. [2022-11-25 23:37:16,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 23:37:16,024 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-25 23:37:16,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:16,030 INFO L225 Difference]: With dead ends: 2532 [2022-11-25 23:37:16,030 INFO L226 Difference]: Without dead ends: 2532 [2022-11-25 23:37:16,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:37:16,036 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 140 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:16,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 66 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:37:16,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2022-11-25 23:37:16,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2220. [2022-11-25 23:37:16,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2220 states, 2192 states have (on average 2.8489963503649633) internal successors, (6245), 2219 states have internal predecessors, (6245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 6245 transitions. [2022-11-25 23:37:16,111 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 6245 transitions. Word has length 22 [2022-11-25 23:37:16,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:16,111 INFO L495 AbstractCegarLoop]: Abstraction has 2220 states and 6245 transitions. [2022-11-25 23:37:16,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:16,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 6245 transitions. [2022-11-25 23:37:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:37:16,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:16,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:16,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 23:37:16,114 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:37:16,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:16,115 INFO L85 PathProgramCache]: Analyzing trace with hash 793719677, now seen corresponding path program 1 times [2022-11-25 23:37:16,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:16,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936930174] [2022-11-25 23:37:16,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:16,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:30,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:30,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:30,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936930174] [2022-11-25 23:37:30,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936930174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:30,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:30,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 23:37:30,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229404891] [2022-11-25 23:37:30,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:30,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:37:30,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:30,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:37:30,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:37:30,573 INFO L87 Difference]: Start difference. First operand 2220 states and 6245 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:56,529 INFO L93 Difference]: Finished difference Result 2471 states and 6884 transitions. [2022-11-25 23:37:56,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 23:37:56,530 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-25 23:37:56,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:56,536 INFO L225 Difference]: With dead ends: 2471 [2022-11-25 23:37:56,536 INFO L226 Difference]: Without dead ends: 2471 [2022-11-25 23:37:56,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:37:56,537 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 137 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:56,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 108 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 20.5s Time] [2022-11-25 23:37:56,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2022-11-25 23:37:56,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2265. [2022-11-25 23:37:56,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2265 states, 2237 states have (on average 2.8497988377291015) internal successors, (6375), 2264 states have internal predecessors, (6375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:56,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 6375 transitions. [2022-11-25 23:37:56,592 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 6375 transitions. Word has length 22 [2022-11-25 23:37:56,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:56,592 INFO L495 AbstractCegarLoop]: Abstraction has 2265 states and 6375 transitions. [2022-11-25 23:37:56,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:56,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 6375 transitions. [2022-11-25 23:37:56,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:37:56,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:56,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:56,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 23:37:56,595 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:37:56,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:56,595 INFO L85 PathProgramCache]: Analyzing trace with hash 793719678, now seen corresponding path program 2 times [2022-11-25 23:37:56,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:56,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662082354] [2022-11-25 23:37:56,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:56,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:57,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:57,398 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:57,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662082354] [2022-11-25 23:37:57,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662082354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:57,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:57,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 23:37:57,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067788070] [2022-11-25 23:37:57,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:57,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 23:37:57,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:57,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 23:37:57,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:37:57,400 INFO L87 Difference]: Start difference. First operand 2265 states and 6375 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:58,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:58,038 INFO L93 Difference]: Finished difference Result 2397 states and 6679 transitions. [2022-11-25 23:37:58,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 23:37:58,039 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-25 23:37:58,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:58,042 INFO L225 Difference]: With dead ends: 2397 [2022-11-25 23:37:58,043 INFO L226 Difference]: Without dead ends: 2397 [2022-11-25 23:37:58,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:37:58,043 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 143 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:58,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 73 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:37:58,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2022-11-25 23:37:58,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 2100. [2022-11-25 23:37:58,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2072 states have (on average 2.856177606177606) internal successors, (5918), 2099 states have internal predecessors, (5918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 5918 transitions. [2022-11-25 23:37:58,096 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 5918 transitions. Word has length 22 [2022-11-25 23:37:58,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:58,096 INFO L495 AbstractCegarLoop]: Abstraction has 2100 states and 5918 transitions. [2022-11-25 23:37:58,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:58,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 5918 transitions. [2022-11-25 23:37:58,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:37:58,098 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:58,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:58,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-25 23:37:58,098 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:37:58,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:58,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1601888233, now seen corresponding path program 2 times [2022-11-25 23:37:58,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:58,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125388357] [2022-11-25 23:37:58,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:58,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:58,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:58,954 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:58,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125388357] [2022-11-25 23:37:58,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125388357] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:58,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:58,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 23:37:58,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208645947] [2022-11-25 23:37:58,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:58,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 23:37:58,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:58,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 23:37:58,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:37:58,956 INFO L87 Difference]: Start difference. First operand 2100 states and 5918 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:59,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:59,780 INFO L93 Difference]: Finished difference Result 2326 states and 6464 transitions. [2022-11-25 23:37:59,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 23:37:59,780 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-25 23:37:59,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:59,786 INFO L225 Difference]: With dead ends: 2326 [2022-11-25 23:37:59,786 INFO L226 Difference]: Without dead ends: 2326 [2022-11-25 23:37:59,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:37:59,787 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 139 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:59,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 98 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:37:59,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2326 states. [2022-11-25 23:37:59,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2326 to 2095. [2022-11-25 23:37:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2095 states, 2067 states have (on average 2.856313497822932) internal successors, (5904), 2094 states have internal predecessors, (5904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:59,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 2095 states and 5904 transitions. [2022-11-25 23:37:59,837 INFO L78 Accepts]: Start accepts. Automaton has 2095 states and 5904 transitions. Word has length 22 [2022-11-25 23:37:59,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:59,837 INFO L495 AbstractCegarLoop]: Abstraction has 2095 states and 5904 transitions. [2022-11-25 23:37:59,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:59,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 5904 transitions. [2022-11-25 23:37:59,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:37:59,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:59,839 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:59,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-25 23:37:59,839 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:37:59,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:59,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1601888234, now seen corresponding path program 3 times [2022-11-25 23:37:59,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:59,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205170238] [2022-11-25 23:37:59,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:59,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:00,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:38:00,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:00,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205170238] [2022-11-25 23:38:00,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205170238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:00,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:00,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 23:38:00,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986026100] [2022-11-25 23:38:00,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:00,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 23:38:00,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:00,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 23:38:00,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:38:00,724 INFO L87 Difference]: Start difference. First operand 2095 states and 5904 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:01,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:01,225 INFO L93 Difference]: Finished difference Result 2207 states and 6157 transitions. [2022-11-25 23:38:01,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 23:38:01,225 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-25 23:38:01,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:01,229 INFO L225 Difference]: With dead ends: 2207 [2022-11-25 23:38:01,229 INFO L226 Difference]: Without dead ends: 2207 [2022-11-25 23:38:01,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:38:01,230 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 221 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:01,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 50 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:38:01,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2022-11-25 23:38:01,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 2040. [2022-11-25 23:38:01,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2040 states, 2012 states have (on average 2.8583499005964215) internal successors, (5751), 2039 states have internal predecessors, (5751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:01,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 5751 transitions. [2022-11-25 23:38:01,276 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 5751 transitions. Word has length 22 [2022-11-25 23:38:01,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:01,277 INFO L495 AbstractCegarLoop]: Abstraction has 2040 states and 5751 transitions. [2022-11-25 23:38:01,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:01,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 5751 transitions. [2022-11-25 23:38:01,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 23:38:01,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:01,279 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:01,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-25 23:38:01,279 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:38:01,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:01,280 INFO L85 PathProgramCache]: Analyzing trace with hash 255882460, now seen corresponding path program 1 times [2022-11-25 23:38:01,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:01,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839103866] [2022-11-25 23:38:01,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:01,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:01,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:38:01,352 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:01,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839103866] [2022-11-25 23:38:01,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839103866] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:01,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:01,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:38:01,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957663210] [2022-11-25 23:38:01,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:01,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:38:01,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:01,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:38:01,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:38:01,354 INFO L87 Difference]: Start difference. First operand 2040 states and 5751 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:01,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:01,449 INFO L93 Difference]: Finished difference Result 1083 states and 2880 transitions. [2022-11-25 23:38:01,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:38:01,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-25 23:38:01,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:01,452 INFO L225 Difference]: With dead ends: 1083 [2022-11-25 23:38:01,452 INFO L226 Difference]: Without dead ends: 1009 [2022-11-25 23:38:01,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:38:01,454 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:01,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 13 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:38:01,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2022-11-25 23:38:01,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 905. [2022-11-25 23:38:01,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 889 states have (on average 2.6670416197975255) internal successors, (2371), 904 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:01,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 2371 transitions. [2022-11-25 23:38:01,473 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 2371 transitions. Word has length 31 [2022-11-25 23:38:01,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:01,473 INFO L495 AbstractCegarLoop]: Abstraction has 905 states and 2371 transitions. [2022-11-25 23:38:01,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:01,473 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 2371 transitions. [2022-11-25 23:38:01,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 23:38:01,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:01,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:01,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-25 23:38:01,475 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:38:01,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:01,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1615156689, now seen corresponding path program 1 times [2022-11-25 23:38:01,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:01,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504241329] [2022-11-25 23:38:01,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:01,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:38:01,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:01,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504241329] [2022-11-25 23:38:01,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504241329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:01,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:01,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:38:01,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701597448] [2022-11-25 23:38:01,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:01,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:38:01,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:01,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:38:01,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:38:01,551 INFO L87 Difference]: Start difference. First operand 905 states and 2371 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:01,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:01,636 INFO L93 Difference]: Finished difference Result 611 states and 1404 transitions. [2022-11-25 23:38:01,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:38:01,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-11-25 23:38:01,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:01,637 INFO L225 Difference]: With dead ends: 611 [2022-11-25 23:38:01,638 INFO L226 Difference]: Without dead ends: 582 [2022-11-25 23:38:01,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:38:01,639 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:01,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 5 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:38:01,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-11-25 23:38:01,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2022-11-25 23:38:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 574 states have (on average 2.343205574912892) internal successors, (1345), 581 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:01,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1345 transitions. [2022-11-25 23:38:01,650 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 1345 transitions. Word has length 32 [2022-11-25 23:38:01,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:01,651 INFO L495 AbstractCegarLoop]: Abstraction has 582 states and 1345 transitions. [2022-11-25 23:38:01,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:01,651 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1345 transitions. [2022-11-25 23:38:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 23:38:01,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:01,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:01,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-25 23:38:01,652 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:38:01,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:01,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1666610047, now seen corresponding path program 1 times [2022-11-25 23:38:01,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:01,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525748008] [2022-11-25 23:38:01,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:01,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:38:02,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:02,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525748008] [2022-11-25 23:38:02,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525748008] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:02,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:02,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 23:38:02,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173391039] [2022-11-25 23:38:02,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:02,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:38:02,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:02,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:38:02,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:38:02,160 INFO L87 Difference]: Start difference. First operand 582 states and 1345 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:02,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:02,546 INFO L93 Difference]: Finished difference Result 864 states and 1968 transitions. [2022-11-25 23:38:02,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:38:02,546 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-11-25 23:38:02,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:02,548 INFO L225 Difference]: With dead ends: 864 [2022-11-25 23:38:02,548 INFO L226 Difference]: Without dead ends: 864 [2022-11-25 23:38:02,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:38:02,548 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 244 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:02,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 30 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:38:02,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2022-11-25 23:38:02,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 678. [2022-11-25 23:38:02,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 670 states have (on average 2.3388059701492536) internal successors, (1567), 677 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:02,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1567 transitions. [2022-11-25 23:38:02,563 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1567 transitions. Word has length 33 [2022-11-25 23:38:02,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:02,563 INFO L495 AbstractCegarLoop]: Abstraction has 678 states and 1567 transitions. [2022-11-25 23:38:02,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:02,568 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1567 transitions. [2022-11-25 23:38:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 23:38:02,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:02,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:02,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-25 23:38:02,571 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:38:02,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:02,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1666610046, now seen corresponding path program 1 times [2022-11-25 23:38:02,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:02,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843717693] [2022-11-25 23:38:02,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:02,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:38:04,028 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:04,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843717693] [2022-11-25 23:38:04,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843717693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:04,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:04,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-25 23:38:04,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548195691] [2022-11-25 23:38:04,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:04,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 23:38:04,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:04,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 23:38:04,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:38:04,030 INFO L87 Difference]: Start difference. First operand 678 states and 1567 transitions. Second operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:05,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:05,259 INFO L93 Difference]: Finished difference Result 887 states and 2032 transitions. [2022-11-25 23:38:05,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 23:38:05,259 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-11-25 23:38:05,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:05,261 INFO L225 Difference]: With dead ends: 887 [2022-11-25 23:38:05,261 INFO L226 Difference]: Without dead ends: 887 [2022-11-25 23:38:05,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2022-11-25 23:38:05,261 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 161 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:05,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 102 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 23:38:05,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2022-11-25 23:38:05,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 874. [2022-11-25 23:38:05,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 866 states have (on average 2.315242494226328) internal successors, (2005), 873 states have internal predecessors, (2005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:05,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 2005 transitions. [2022-11-25 23:38:05,278 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 2005 transitions. Word has length 33 [2022-11-25 23:38:05,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:05,279 INFO L495 AbstractCegarLoop]: Abstraction has 874 states and 2005 transitions. [2022-11-25 23:38:05,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:05,279 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 2005 transitions. [2022-11-25 23:38:05,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 23:38:05,280 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:05,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:05,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-25 23:38:05,281 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:38:05,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:05,281 INFO L85 PathProgramCache]: Analyzing trace with hash -974063474, now seen corresponding path program 2 times [2022-11-25 23:38:05,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:05,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966567646] [2022-11-25 23:38:05,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:05,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:06,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:38:06,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:06,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966567646] [2022-11-25 23:38:06,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966567646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:06,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:06,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-25 23:38:06,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281637611] [2022-11-25 23:38:06,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:06,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 23:38:06,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:06,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 23:38:06,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:38:06,876 INFO L87 Difference]: Start difference. First operand 874 states and 2005 transitions. Second operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:07,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:07,943 INFO L93 Difference]: Finished difference Result 1068 states and 2440 transitions. [2022-11-25 23:38:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 23:38:07,944 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-11-25 23:38:07,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:07,945 INFO L225 Difference]: With dead ends: 1068 [2022-11-25 23:38:07,945 INFO L226 Difference]: Without dead ends: 1068 [2022-11-25 23:38:07,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2022-11-25 23:38:07,946 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 136 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:07,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 91 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 23:38:07,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2022-11-25 23:38:07,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 859. [2022-11-25 23:38:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 851 states have (on average 2.3207990599294948) internal successors, (1975), 858 states have internal predecessors, (1975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1975 transitions. [2022-11-25 23:38:07,963 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1975 transitions. Word has length 33 [2022-11-25 23:38:07,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:07,963 INFO L495 AbstractCegarLoop]: Abstraction has 859 states and 1975 transitions. [2022-11-25 23:38:07,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:07,964 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1975 transitions. [2022-11-25 23:38:07,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 23:38:07,965 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:07,965 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:07,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-25 23:38:07,966 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:38:07,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:07,966 INFO L85 PathProgramCache]: Analyzing trace with hash 769036888, now seen corresponding path program 3 times [2022-11-25 23:38:07,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:07,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100936903] [2022-11-25 23:38:07,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:07,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:38:09,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:09,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100936903] [2022-11-25 23:38:09,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100936903] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:09,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:09,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-25 23:38:09,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540517647] [2022-11-25 23:38:09,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:09,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 23:38:09,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:09,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 23:38:09,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:38:09,223 INFO L87 Difference]: Start difference. First operand 859 states and 1975 transitions. Second operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:10,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:10,320 INFO L93 Difference]: Finished difference Result 986 states and 2256 transitions. [2022-11-25 23:38:10,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 23:38:10,320 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-11-25 23:38:10,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:10,325 INFO L225 Difference]: With dead ends: 986 [2022-11-25 23:38:10,325 INFO L226 Difference]: Without dead ends: 986 [2022-11-25 23:38:10,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2022-11-25 23:38:10,326 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 193 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:10,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 82 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:38:10,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2022-11-25 23:38:10,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 792. [2022-11-25 23:38:10,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 784 states have (on average 2.322704081632653) internal successors, (1821), 791 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:10,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1821 transitions. [2022-11-25 23:38:10,342 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1821 transitions. Word has length 33 [2022-11-25 23:38:10,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:10,343 INFO L495 AbstractCegarLoop]: Abstraction has 792 states and 1821 transitions. [2022-11-25 23:38:10,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:10,343 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1821 transitions. [2022-11-25 23:38:10,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 23:38:10,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:10,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:10,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-25 23:38:10,345 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:38:10,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:10,346 INFO L85 PathProgramCache]: Analyzing trace with hash -455872970, now seen corresponding path program 4 times [2022-11-25 23:38:10,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:10,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222523959] [2022-11-25 23:38:10,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:10,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:11,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:38:11,807 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:11,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222523959] [2022-11-25 23:38:11,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222523959] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:11,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:11,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-25 23:38:11,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949116292] [2022-11-25 23:38:11,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:11,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 23:38:11,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:11,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 23:38:11,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:38:11,809 INFO L87 Difference]: Start difference. First operand 792 states and 1821 transitions. Second operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:13,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:13,128 INFO L93 Difference]: Finished difference Result 860 states and 1960 transitions. [2022-11-25 23:38:13,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 23:38:13,128 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-11-25 23:38:13,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:13,129 INFO L225 Difference]: With dead ends: 860 [2022-11-25 23:38:13,129 INFO L226 Difference]: Without dead ends: 860 [2022-11-25 23:38:13,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2022-11-25 23:38:13,130 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 167 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:13,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 98 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 23:38:13,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-11-25 23:38:13,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 746. [2022-11-25 23:38:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 738 states have (on average 2.3157181571815717) internal successors, (1709), 745 states have internal predecessors, (1709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:13,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1709 transitions. [2022-11-25 23:38:13,143 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1709 transitions. Word has length 33 [2022-11-25 23:38:13,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:13,143 INFO L495 AbstractCegarLoop]: Abstraction has 746 states and 1709 transitions. [2022-11-25 23:38:13,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:13,144 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1709 transitions. [2022-11-25 23:38:13,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 23:38:13,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:13,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:13,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-25 23:38:13,145 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:38:13,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:13,146 INFO L85 PathProgramCache]: Analyzing trace with hash -627670577, now seen corresponding path program 2 times [2022-11-25 23:38:13,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:13,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009744063] [2022-11-25 23:38:13,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:13,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:14,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:38:14,247 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:14,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009744063] [2022-11-25 23:38:14,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009744063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:14,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:14,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-25 23:38:14,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807290847] [2022-11-25 23:38:14,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:14,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 23:38:14,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:14,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 23:38:14,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:38:14,248 INFO L87 Difference]: Start difference. First operand 746 states and 1709 transitions. Second operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:15,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:15,198 INFO L93 Difference]: Finished difference Result 746 states and 1705 transitions. [2022-11-25 23:38:15,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 23:38:15,198 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-11-25 23:38:15,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:15,199 INFO L225 Difference]: With dead ends: 746 [2022-11-25 23:38:15,199 INFO L226 Difference]: Without dead ends: 746 [2022-11-25 23:38:15,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2022-11-25 23:38:15,200 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 194 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:15,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 62 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:38:15,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-11-25 23:38:15,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 642. [2022-11-25 23:38:15,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 635 states have (on average 2.321259842519685) internal successors, (1474), 641 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:15,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1474 transitions. [2022-11-25 23:38:15,210 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1474 transitions. Word has length 33 [2022-11-25 23:38:15,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:15,210 INFO L495 AbstractCegarLoop]: Abstraction has 642 states and 1474 transitions. [2022-11-25 23:38:15,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:15,210 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1474 transitions. [2022-11-25 23:38:15,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 23:38:15,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:15,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:15,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-25 23:38:15,212 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:38:15,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:15,213 INFO L85 PathProgramCache]: Analyzing trace with hash -159784471, now seen corresponding path program 1 times [2022-11-25 23:38:15,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:15,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121078195] [2022-11-25 23:38:15,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:15,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:38:16,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:16,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121078195] [2022-11-25 23:38:16,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121078195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:16,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:16,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-25 23:38:16,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713483637] [2022-11-25 23:38:16,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:16,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 23:38:16,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:16,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 23:38:16,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:38:16,260 INFO L87 Difference]: Start difference. First operand 642 states and 1474 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:16,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:16,900 INFO L93 Difference]: Finished difference Result 851 states and 1937 transitions. [2022-11-25 23:38:16,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 23:38:16,900 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2022-11-25 23:38:16,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:16,901 INFO L225 Difference]: With dead ends: 851 [2022-11-25 23:38:16,901 INFO L226 Difference]: Without dead ends: 810 [2022-11-25 23:38:16,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2022-11-25 23:38:16,902 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 187 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:16,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 45 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:38:16,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2022-11-25 23:38:16,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 806. [2022-11-25 23:38:16,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 799 states have (on average 2.2991239048811014) internal successors, (1837), 805 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:16,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1837 transitions. [2022-11-25 23:38:16,914 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1837 transitions. Word has length 36 [2022-11-25 23:38:16,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:16,914 INFO L495 AbstractCegarLoop]: Abstraction has 806 states and 1837 transitions. [2022-11-25 23:38:16,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:16,914 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1837 transitions. [2022-11-25 23:38:16,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 23:38:16,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:16,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:16,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-25 23:38:16,916 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:38:16,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:16,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1020527699, now seen corresponding path program 2 times [2022-11-25 23:38:16,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:16,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428828627] [2022-11-25 23:38:16,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:16,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:18,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:38:18,085 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:18,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428828627] [2022-11-25 23:38:18,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428828627] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:18,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:18,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-25 23:38:18,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372431705] [2022-11-25 23:38:18,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:18,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 23:38:18,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:18,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 23:38:18,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:38:18,091 INFO L87 Difference]: Start difference. First operand 806 states and 1837 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:18,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:18,807 INFO L93 Difference]: Finished difference Result 940 states and 2126 transitions. [2022-11-25 23:38:18,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 23:38:18,808 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2022-11-25 23:38:18,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:18,809 INFO L225 Difference]: With dead ends: 940 [2022-11-25 23:38:18,809 INFO L226 Difference]: Without dead ends: 899 [2022-11-25 23:38:18,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2022-11-25 23:38:18,810 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 129 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:18,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 49 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:38:18,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2022-11-25 23:38:18,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 731. [2022-11-25 23:38:18,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 724 states have (on average 2.296961325966851) internal successors, (1663), 730 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1663 transitions. [2022-11-25 23:38:18,825 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1663 transitions. Word has length 36 [2022-11-25 23:38:18,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:18,825 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 1663 transitions. [2022-11-25 23:38:18,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:18,826 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1663 transitions. [2022-11-25 23:38:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 23:38:18,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:18,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:18,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-25 23:38:18,828 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:38:18,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:18,828 INFO L85 PathProgramCache]: Analyzing trace with hash -226905163, now seen corresponding path program 3 times [2022-11-25 23:38:18,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:18,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378816760] [2022-11-25 23:38:18,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:18,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:20,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:38:20,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:20,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378816760] [2022-11-25 23:38:20,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378816760] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:20,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:20,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-25 23:38:20,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350773148] [2022-11-25 23:38:20,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:20,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 23:38:20,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:20,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 23:38:20,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:38:20,266 INFO L87 Difference]: Start difference. First operand 731 states and 1663 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:21,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:21,019 INFO L93 Difference]: Finished difference Result 817 states and 1850 transitions. [2022-11-25 23:38:21,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 23:38:21,019 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2022-11-25 23:38:21,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:21,021 INFO L225 Difference]: With dead ends: 817 [2022-11-25 23:38:21,021 INFO L226 Difference]: Without dead ends: 817 [2022-11-25 23:38:21,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2022-11-25 23:38:21,021 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 205 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:21,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 64 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:38:21,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2022-11-25 23:38:21,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 755. [2022-11-25 23:38:21,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 748 states have (on average 2.2967914438502675) internal successors, (1718), 754 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1718 transitions. [2022-11-25 23:38:21,033 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1718 transitions. Word has length 36 [2022-11-25 23:38:21,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:21,033 INFO L495 AbstractCegarLoop]: Abstraction has 755 states and 1718 transitions. [2022-11-25 23:38:21,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:21,034 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1718 transitions. [2022-11-25 23:38:21,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 23:38:21,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:21,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:21,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-25 23:38:21,035 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:38:21,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:21,036 INFO L85 PathProgramCache]: Analyzing trace with hash -226905162, now seen corresponding path program 1 times [2022-11-25 23:38:21,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:21,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621216216] [2022-11-25 23:38:21,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:21,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:22,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:38:22,244 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:22,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621216216] [2022-11-25 23:38:22,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621216216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:22,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:22,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 23:38:22,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550776420] [2022-11-25 23:38:22,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:22,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 23:38:22,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:22,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 23:38:22,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:38:22,246 INFO L87 Difference]: Start difference. First operand 755 states and 1718 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:22,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:22,940 INFO L93 Difference]: Finished difference Result 755 states and 1698 transitions. [2022-11-25 23:38:22,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 23:38:22,940 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2022-11-25 23:38:22,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:22,941 INFO L225 Difference]: With dead ends: 755 [2022-11-25 23:38:22,941 INFO L226 Difference]: Without dead ends: 713 [2022-11-25 23:38:22,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2022-11-25 23:38:22,942 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 131 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:22,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 48 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:38:22,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2022-11-25 23:38:22,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 620. [2022-11-25 23:38:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 613 states have (on average 2.2610114192495923) internal successors, (1386), 619 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:22,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1386 transitions. [2022-11-25 23:38:22,951 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 1386 transitions. Word has length 36 [2022-11-25 23:38:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:22,952 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 1386 transitions. [2022-11-25 23:38:22,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1386 transitions. [2022-11-25 23:38:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-25 23:38:22,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:22,953 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:22,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-25 23:38:22,954 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:38:22,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:22,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1255829940, now seen corresponding path program 1 times [2022-11-25 23:38:22,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:22,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155983123] [2022-11-25 23:38:22,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:22,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:38:23,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:23,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155983123] [2022-11-25 23:38:23,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155983123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:23,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:23,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 23:38:23,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392536559] [2022-11-25 23:38:23,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:23,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:38:23,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:23,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:38:23,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:38:23,489 INFO L87 Difference]: Start difference. First operand 620 states and 1386 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:23,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:23,811 INFO L93 Difference]: Finished difference Result 614 states and 1367 transitions. [2022-11-25 23:38:23,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:38:23,811 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-11-25 23:38:23,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:23,813 INFO L225 Difference]: With dead ends: 614 [2022-11-25 23:38:23,813 INFO L226 Difference]: Without dead ends: 614 [2022-11-25 23:38:23,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:38:23,820 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 86 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:23,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 45 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:38:23,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-11-25 23:38:23,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2022-11-25 23:38:23,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 608 states have (on average 2.2483552631578947) internal successors, (1367), 613 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:23,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1367 transitions. [2022-11-25 23:38:23,836 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 1367 transitions. Word has length 46 [2022-11-25 23:38:23,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:23,837 INFO L495 AbstractCegarLoop]: Abstraction has 614 states and 1367 transitions. [2022-11-25 23:38:23,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:23,837 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1367 transitions. [2022-11-25 23:38:23,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-25 23:38:23,838 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:23,838 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:23,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-25 23:38:23,839 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:38:23,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:23,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1255829919, now seen corresponding path program 1 times [2022-11-25 23:38:23,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:23,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072517316] [2022-11-25 23:38:23,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:23,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:26,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:38:26,032 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:26,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072517316] [2022-11-25 23:38:26,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072517316] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:38:26,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118521745] [2022-11-25 23:38:26,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:26,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:38:26,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:38:26,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:38:26,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:38:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:26,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-25 23:38:26,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:26,610 INFO L350 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 32 treesize of output 16 [2022-11-25 23:38:26,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:26,667 INFO L350 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 17 treesize of output 19 [2022-11-25 23:38:26,798 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:26,809 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 23:38:26,810 INFO L350 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 28 [2022-11-25 23:38:26,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:26,950 INFO L350 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 24 treesize of output 23 [2022-11-25 23:38:27,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 28 [2022-11-25 23:38:27,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:27,206 INFO L350 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 26 treesize of output 26 [2022-11-25 23:38:27,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:27,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:27,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 44 treesize of output 31 [2022-11-25 23:38:27,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2022-11-25 23:38:27,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:27,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:27,780 INFO L321 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2022-11-25 23:38:27,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 37 treesize of output 44 [2022-11-25 23:38:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:38:27,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:38:38,141 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2020 Int) (v_ArrVal_2022 Int) (v_ArrVal_2025 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2019) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_2020) (+ |c_~#queue~0.offset| 80) v_ArrVal_2022) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_2025) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_2020 1))))) is different from false [2022-11-25 23:38:38,189 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2020 Int) (v_ArrVal_2022 Int) (v_ArrVal_2025 Int) (v_ArrVal_2015 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2015) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2019) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_2020 1)) (not (<= v_ArrVal_2015 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2020) (+ |c_~#queue~0.offset| 80) v_ArrVal_2022) (+ (* 4 (select .cse0 (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|) v_ArrVal_2025) .cse1) 2147483647)))) is different from false [2022-11-25 23:38:38,215 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2020 Int) (v_ArrVal_2022 Int) (v_ArrVal_2025 Int) (v_ArrVal_2015 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2015) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2019) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_2020 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2020) (+ |c_~#queue~0.offset| 80) v_ArrVal_2022) (+ (* 4 (select .cse0 (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|) v_ArrVal_2025) .cse1) 2147483647) (< 2147483647 v_ArrVal_2015)))) is different from false [2022-11-25 23:38:38,244 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2020 Int) (v_ArrVal_2022 Int) (v_ArrVal_2014 Int) (v_ArrVal_2025 Int) (v_ArrVal_2015 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (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_2014)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2015) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2019) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_2020 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2020) (+ |c_~#queue~0.offset| 80) v_ArrVal_2022) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_2025) .cse1) 2147483647) (< 2147483647 v_ArrVal_2015)))) is different from false [2022-11-25 23:38:39,751 INFO L321 Elim1Store]: treesize reduction 323, result has 42.5 percent of original size [2022-11-25 23:38:39,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 772 treesize of output 449 [2022-11-25 23:38:39,851 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-25 23:38:39,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 428 treesize of output 412 [2022-11-25 23:38:39,914 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:38:39,915 INFO L350 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 265 treesize of output 251 [2022-11-25 23:38:39,957 INFO L350 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 223 treesize of output 199 [2022-11-25 23:38:40,049 INFO L350 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 12 treesize of output 8 [2022-11-25 23:38:40,079 INFO L350 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 12 treesize of output 8 [2022-11-25 23:38:40,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:40,160 INFO L350 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 71 treesize of output 59 [2022-11-25 23:38:40,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:40,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:38:40,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 416 treesize of output 424 [2022-11-25 23:38:42,880 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:38:42,881 INFO L350 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 1261 treesize of output 1153 [2022-11-25 23:38:45,889 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:38:45,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 1227 treesize of output 923 [2022-11-25 23:38:46,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 23:38:46,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118521745] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:38:46,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1676853474] [2022-11-25 23:38:46,793 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-25 23:38:46,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:38:46,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 58 [2022-11-25 23:38:46,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684285593] [2022-11-25 23:38:46,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:38:46,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-25 23:38:46,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:46,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-25 23:38:46,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2702, Unknown=20, NotChecked=444, Total=3540 [2022-11-25 23:38:46,801 INFO L87 Difference]: Start difference. First operand 614 states and 1367 transitions. Second operand has 60 states, 59 states have (on average 2.3389830508474576) internal successors, (138), 59 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:39:07,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:39:09,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:39:09,608 INFO L93 Difference]: Finished difference Result 1918 states and 4266 transitions. [2022-11-25 23:39:09,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-25 23:39:09,609 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 2.3389830508474576) internal successors, (138), 59 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-11-25 23:39:09,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:39:09,611 INFO L225 Difference]: With dead ends: 1918 [2022-11-25 23:39:09,611 INFO L226 Difference]: Without dead ends: 1918 [2022-11-25 23:39:09,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 57 SyntacticMatches, 23 SemanticMatches, 117 ConstructedPredicates, 4 IntricatePredicates, 4 DeprecatedPredicates, 3975 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=2326, Invalid=10780, Unknown=20, NotChecked=916, Total=14042 [2022-11-25 23:39:09,616 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1666 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 4747 mSolverCounterSat, 333 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1666 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 6037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 4747 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 956 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:39:09,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1666 Valid, 498 Invalid, 6037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 4747 Invalid, 1 Unknown, 956 Unchecked, 7.8s Time] [2022-11-25 23:39:09,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2022-11-25 23:39:09,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1028. [2022-11-25 23:39:09,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1022 states have (on average 2.3170254403131114) internal successors, (2368), 1027 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:39:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 2368 transitions. [2022-11-25 23:39:09,634 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 2368 transitions. Word has length 46 [2022-11-25 23:39:09,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:39:09,634 INFO L495 AbstractCegarLoop]: Abstraction has 1028 states and 2368 transitions. [2022-11-25 23:39:09,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 2.3389830508474576) internal successors, (138), 59 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:39:09,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 2368 transitions. [2022-11-25 23:39:09,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-25 23:39:09,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:39:09,636 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:39:09,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:39:09,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:09,843 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-25 23:39:09,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:39:09,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1051923925, now seen corresponding path program 2 times [2022-11-25 23:39:09,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:39:09,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299187581] [2022-11-25 23:39:09,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:09,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:39:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:39:11,933 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:39:11,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299187581] [2022-11-25 23:39:11,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299187581] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:39:11,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197267027] [2022-11-25 23:39:11,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:39:11,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:11,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:39:11,938 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:39:11,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc79e245-6756-426a-b7d3-0f8a191ee444/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:39:12,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 23:39:12,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:39:12,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 117 conjunts are in the unsatisfiable core [2022-11-25 23:39:12,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:39:12,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:12,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:12,331 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:39:12,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 23:39:12,355 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 23:39:12,356 INFO L350 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 20 treesize of output 22 [2022-11-25 23:39:12,525 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 23:39:12,626 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-25 23:39:12,750 INFO L350 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 40 treesize of output 42 [2022-11-25 23:39:12,953 INFO L350 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 58 treesize of output 51 [2022-11-25 23:39:13,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:13,045 INFO L350 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 45 treesize of output 47 [2022-11-25 23:39:13,285 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 23:39:13,763 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-11-25 23:39:14,223 INFO L350 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 75 treesize of output 68 [2022-11-25 23:39:14,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:14,433 INFO L350 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 62 treesize of output 64 [2022-11-25 23:39:15,235 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 73 [2022-11-25 23:39:15,814 INFO L350 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 74 treesize of output 69 [2022-11-25 23:39:39,670 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61 [2022-11-25 23:39:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:39:52,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:39:57,989 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2184 Int) (v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2186 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2182 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2181) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select .cse0 .cse1) (+ v_ArrVal_2182 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2182) (+ |c_~#queue~0.offset| 80) v_ArrVal_2184) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2186) .cse1) 2147483647)))) is different from false [2022-11-25 23:39:58,012 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2184 Int) (v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2186 Int) (v_ArrVal_2179 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2182 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2179)) |c_~#stored_elements~0.base| v_ArrVal_2181) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_2182) (+ |c_~#queue~0.offset| 80) v_ArrVal_2184) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2186) .cse1) 2147483647) (not (<= v_ArrVal_2179 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select .cse0 .cse1) (+ v_ArrVal_2182 1))))) is different from false [2022-11-25 23:39:58,037 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2184 Int) (v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2186 Int) (v_ArrVal_2179 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2182 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_2179)) |c_~#stored_elements~0.base| v_ArrVal_2181) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_2182) (+ |c_~#queue~0.offset| 80) v_ArrVal_2184) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2186) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2179) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select .cse0 .cse1) (+ v_ArrVal_2182 1)))))) is different from false [2022-11-25 23:39:58,083 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2184 Int) (v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2186 Int) (v_ArrVal_2177 Int) (v_ArrVal_2179 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2182 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2177) .cse2 v_ArrVal_2179)) |c_~#stored_elements~0.base| v_ArrVal_2181) |c_~#queue~0.base|)) (.cse3 (+ 88 |c_~#queue~0.offset|))) (or (not (<= v_ArrVal_2177 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2179) (< (select .cse0 .cse3) (+ v_ArrVal_2182 1)) (< (select (store (store (store .cse0 .cse3 v_ArrVal_2182) (+ |c_~#queue~0.offset| 80) v_ArrVal_2184) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2186) .cse3) 2147483647))))) is different from false [2022-11-25 23:39:58,113 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2184 Int) (v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2186 Int) (v_ArrVal_2177 Int) (v_ArrVal_2179 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2182 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2177) .cse2 v_ArrVal_2179)) |c_~#stored_elements~0.base| v_ArrVal_2181) |c_~#queue~0.base|)) (.cse3 (+ 88 |c_~#queue~0.offset|))) (or (< 2147483647 v_ArrVal_2177) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2179) (< (select .cse0 .cse3) (+ v_ArrVal_2182 1)) (< (select (store (store (store .cse0 .cse3 v_ArrVal_2182) (+ |c_~#queue~0.offset| 80) v_ArrVal_2184) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2186) .cse3) 2147483647))))) is different from false [2022-11-25 23:39:58,149 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2184 Int) (v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2175 Int) (v_ArrVal_2186 Int) (v_ArrVal_2177 Int) (v_ArrVal_2179 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2182 Int)) (let ((.cse2 (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_2175)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2177) .cse3 v_ArrVal_2179)) |c_~#stored_elements~0.base| v_ArrVal_2181) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< 2147483647 v_ArrVal_2177) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select .cse0 .cse1) (+ v_ArrVal_2182 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2182) (+ |c_~#queue~0.offset| 80) v_ArrVal_2184) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2186) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2179))))) is different from false [2022-11-25 23:39:58,818 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2184 Int) (v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2175 Int) (v_ArrVal_2186 Int) (v_ArrVal_2177 Int) (v_ArrVal_2179 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_217| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2174))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_217| 4) |c_~#queue~0.offset|) v_ArrVal_2175)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse2 v_ArrVal_2177) .cse1 v_ArrVal_2179)) |c_~#stored_elements~0.base| v_ArrVal_2181) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_2177) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse0 .cse1))) (< (select (store (store (store .cse0 .cse2 v_ArrVal_2182) (+ |c_~#queue~0.offset| 80) v_ArrVal_2184) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2186) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_217| (select .cse3 .cse1))) (< (select .cse0 .cse2) (+ v_ArrVal_2182 1)) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2179))))))) is different from false [2022-11-25 23:39:58,875 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2184 Int) (v_ArrVal_2172 Int) (v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2175 Int) (v_ArrVal_2186 Int) (v_ArrVal_2177 Int) (v_ArrVal_2179 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_217| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2172)) |c_~#stored_elements~0.base| v_ArrVal_2174))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_217| 4) |c_~#queue~0.offset|) v_ArrVal_2175)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_2177) .cse1 v_ArrVal_2179)) |c_~#stored_elements~0.base| v_ArrVal_2181) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_217| (select .cse0 .cse1))) (< 2147483647 v_ArrVal_2177) (< (select (store (store (store .cse2 .cse3 v_ArrVal_2182) (+ |c_~#queue~0.offset| 80) v_ArrVal_2184) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2186) .cse3) 2147483647) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2179) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse2 .cse1))) (< (select .cse2 .cse3) (+ v_ArrVal_2182 1)) (not (<= v_ArrVal_2172 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))))))) is different from false [2022-11-25 23:40:01,315 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2182 Int) (v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2184 Int) (v_ArrVal_2172 Int) (v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2175 Int) (v_ArrVal_2186 Int) (v_ArrVal_2177 Int) (v_ArrVal_2179 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_217| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2171))) (let ((.cse5 (select .cse8 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store .cse8 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_2172)) |c_~#stored_elements~0.base| v_ArrVal_2174))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_217| 4) |c_~#queue~0.offset|) v_ArrVal_2175)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_2177) .cse1 v_ArrVal_2179)) |c_~#stored_elements~0.base| v_ArrVal_2181) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_2177) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_217| (select .cse0 .cse1))) (< (select .cse2 .cse3) (+ v_ArrVal_2182 1)) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2179) (< (+ (select .cse5 .cse6) 1) v_ArrVal_2172) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse2 .cse1))) (< (select (store (store (store .cse2 .cse3 v_ArrVal_2182) (+ |c_~#queue~0.offset| 80) v_ArrVal_2184) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2186) .cse3) 2147483647))))))))) is different from false [2022-11-25 23:40:01,423 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2182 Int) (v_ArrVal_2170 Int) (v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2184 Int) (v_ArrVal_2172 Int) (v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2175 Int) (v_ArrVal_2186 Int) (v_ArrVal_2177 Int) (v_ArrVal_2179 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_217| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2170)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2171))) (let ((.cse2 (select .cse8 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store .cse8 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_2172)) |c_~#stored_elements~0.base| v_ArrVal_2174))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_217| 4) |c_~#queue~0.offset|) v_ArrVal_2175)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse6 v_ArrVal_2177) .cse1 v_ArrVal_2179)) |c_~#stored_elements~0.base| v_ArrVal_2181) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_2177) (< (+ (select .cse0 .cse1) 1) v_ArrVal_2179) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2172) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_217| (select .cse4 .cse1))) (< (select (store (store (store .cse5 .cse6 v_ArrVal_2182) (+ |c_~#queue~0.offset| 80) v_ArrVal_2184) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2186) .cse6) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse5 .cse1))) (< (select .cse5 .cse6) (+ v_ArrVal_2182 1)))))))))) is different from false [2022-11-25 23:40:01,545 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2182 Int) (v_ArrVal_2170 Int) (v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2184 Int) (v_ArrVal_2172 Int) (v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2175 Int) (v_ArrVal_2186 Int) (v_ArrVal_2177 Int) (v_ArrVal_2168 Int) (v_ArrVal_2179 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_217| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (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_2168) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2170)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2171))) (let ((.cse2 (select .cse8 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store .cse8 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_2172)) |c_~#stored_elements~0.base| v_ArrVal_2174))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_217| 4) |c_~#queue~0.offset|) v_ArrVal_2175)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_2177) .cse4 v_ArrVal_2179)) |c_~#stored_elements~0.base| v_ArrVal_2181) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_2182) (+ |c_~#queue~0.offset| 80) v_ArrVal_2184) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2186) .cse1) 2147483647) (< 2147483647 v_ArrVal_2177) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2172) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse0 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_217| (select .cse5 .cse4))) (< (select .cse0 .cse1) (+ v_ArrVal_2182 1)) (< (+ (select .cse6 .cse4) 1) v_ArrVal_2179))))))))) is different from false [2022-11-25 23:40:04,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 23:40:04,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197267027] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:40:04,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1779124686] [2022-11-25 23:40:04,052 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-25 23:40:04,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:40:04,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 21] total 62 [2022-11-25 23:40:04,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468517154] [2022-11-25 23:40:04,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:40:04,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-25 23:40:04,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:40:04,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-25 23:40:04,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=2360, Unknown=34, NotChecked=1232, Total=4032 [2022-11-25 23:40:04,064 INFO L87 Difference]: Start difference. First operand 1028 states and 2368 transitions. Second operand has 64 states, 63 states have (on average 2.1904761904761907) internal successors, (138), 63 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:40:13,107 WARN L233 SmtUtils]: Spent 6.82s on a formula simplification. DAG size of input: 172 DAG size of output: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:40:22,504 WARN L233 SmtUtils]: Spent 6.67s on a formula simplification. DAG size of input: 165 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:41:05,975 WARN L233 SmtUtils]: Spent 17.46s on a formula simplification. DAG size of input: 199 DAG size of output: 160 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:41:22,759 WARN L233 SmtUtils]: Spent 9.55s on a formula simplification. DAG size of input: 173 DAG size of output: 160 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:41:24,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:41:26,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:41:27,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:41:30,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:41:32,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:41:34,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:41:53,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:41:55,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:42:11,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:42:15,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:42:17,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:42:39,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:42:42,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:43:00,764 WARN L233 SmtUtils]: Spent 10.87s on a formula simplification. DAG size of input: 182 DAG size of output: 162 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:43:03,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:43:05,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:43:07,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:43:09,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:43:11,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:43:13,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:43:16,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:43:35,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:43:40,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:43:55,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:44:10,465 WARN L233 SmtUtils]: Spent 9.35s on a formula simplification. DAG size of input: 197 DAG size of output: 153 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:44:34,217 WARN L233 SmtUtils]: Spent 9.25s on a formula simplification. DAG size of input: 181 DAG size of output: 148 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:44:36,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:44:38,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:44:41,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:44:44,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:44:46,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:44:49,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:45:09,980 WARN L233 SmtUtils]: Spent 10.81s on a formula simplification. DAG size of input: 201 DAG size of output: 160 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:45:31,192 WARN L233 SmtUtils]: Spent 9.49s on a formula simplification. DAG size of input: 178 DAG size of output: 153 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:45:33,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:45:35,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:46:00,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:46:04,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:46:06,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:46:14,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:46:16,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:46:18,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:46:20,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:46:23,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:46:25,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:46:26,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:46:28,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:46:30,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:46:32,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:46:42,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:46:44,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:46:46,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:47:16,723 WARN L233 SmtUtils]: Spent 17.77s on a formula simplification. DAG size of input: 179 DAG size of output: 165 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:47:22,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:47:24,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:47:26,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:47:28,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:47:30,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:47:34,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:47:49,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:47:51,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:48:00,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:48:22,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:48:24,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:48:40,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:48:42,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:48:47,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:48:58,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:49:00,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:49:05,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:49:07,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:49:09,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:49:11,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:49:14,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:49:15,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:49:17,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:49:19,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:49:22,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:49:24,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:49:26,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:49:28,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:49:33,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:49:55,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:50:29,549 WARN L233 SmtUtils]: Spent 17.50s on a formula simplification. DAG size of input: 171 DAG size of output: 163 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:50:31,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:50:33,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:50:37,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:50:39,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:50:41,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]