./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba --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 c870162e8691a06e8bb6a8083be9eaf3f7ddc94357fb302a6e1fdd1b7aa873f8 --- 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-b5237d8 [2022-11-22 01:38:31,695 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:38:31,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:38:31,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:38:31,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:38:31,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:38:31,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:38:31,749 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:38:31,751 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:38:31,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:38:31,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:38:31,755 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:38:31,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:38:31,756 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:38:31,757 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:38:31,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:38:31,759 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:38:31,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:38:31,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:38:31,764 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:38:31,766 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:38:31,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:38:31,769 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:38:31,770 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:38:31,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:38:31,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:38:31,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:38:31,776 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:38:31,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:38:31,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:38:31,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:38:31,780 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:38:31,781 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:38:31,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:38:31,783 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:38:31,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:38:31,784 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:38:31,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:38:31,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:38:31,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:38:31,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:38:31,788 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-22 01:38:31,834 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:38:31,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:38:31,835 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:38:31,835 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:38:31,836 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:38:31,837 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:38:31,837 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:38:31,837 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:38:31,838 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:38:31,838 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:38:31,838 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:38:31,839 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:38:31,839 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:38:31,839 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:38:31,839 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:38:31,840 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:38:31,840 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:38:31,840 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:38:31,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:38:31,841 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:38:31,842 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 01:38:31,842 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:38:31,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:38:31,843 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:38:31,843 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 01:38:31,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:38:31,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 01:38:31,844 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 01:38:31,844 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:38:31,844 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 01:38:31,844 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:38:31,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 01:38:31,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:38:31,845 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:38:31,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:38:31,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:38:31,846 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:38:31,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:38:31,847 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 01:38:31,847 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:38:31,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:38:31,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 01:38:31,848 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:38:31,848 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_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/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_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba 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 -> c870162e8691a06e8bb6a8083be9eaf3f7ddc94357fb302a6e1fdd1b7aa873f8 [2022-11-22 01:38:32,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:38:32,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:38:32,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:38:32,208 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:38:32,208 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:38:32,209 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2022-11-22 01:38:35,792 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:38:36,068 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:38:36,069 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2022-11-22 01:38:36,078 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/data/f0e2e9c77/750cd09614cf4b3a99d82b2bb462239c/FLAG8df7ed8be [2022-11-22 01:38:36,095 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/data/f0e2e9c77/750cd09614cf4b3a99d82b2bb462239c [2022-11-22 01:38:36,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:38:36,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:38:36,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:38:36,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:38:36,107 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:38:36,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:38:36" (1/1) ... [2022-11-22 01:38:36,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27b15327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:38:36, skipping insertion in model container [2022-11-22 01:38:36,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:38:36" (1/1) ... [2022-11-22 01:38:36,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:38:36,140 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:38:36,313 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_0386adeb-506e-46fe-abf6-27840459478a/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-11-22 01:38:36,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:38:36,331 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:38:36,355 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_0386adeb-506e-46fe-abf6-27840459478a/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-11-22 01:38:36,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:38:36,380 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:38:36,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:38:36 WrapperNode [2022-11-22 01:38:36,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:38:36,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:38:36,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:38:36,382 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:38:36,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:38:36" (1/1) ... [2022-11-22 01:38:36,399 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:38:36" (1/1) ... [2022-11-22 01:38:36,435 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 395 [2022-11-22 01:38:36,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:38:36,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:38:36,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:38:36,436 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:38:36,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:38:36" (1/1) ... [2022-11-22 01:38:36,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:38:36" (1/1) ... [2022-11-22 01:38:36,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:38:36" (1/1) ... [2022-11-22 01:38:36,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:38:36" (1/1) ... [2022-11-22 01:38:36,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:38:36" (1/1) ... [2022-11-22 01:38:36,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:38:36" (1/1) ... [2022-11-22 01:38:36,482 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:38:36" (1/1) ... [2022-11-22 01:38:36,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:38:36" (1/1) ... [2022-11-22 01:38:36,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:38:36,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:38:36,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:38:36,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:38:36,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:38:36" (1/1) ... [2022-11-22 01:38:36,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:38:36,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:38:36,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:38:36,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:38:36,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:38:36,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-22 01:38:36,594 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-22 01:38:36,594 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-22 01:38:36,594 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-22 01:38:36,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 01:38:36,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 01:38:36,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 01:38:36,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-22 01:38:36,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:38:36,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:38:36,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 01:38:36,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 01:38:36,598 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 01:38:36,747 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:38:36,749 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:38:37,616 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:38:37,635 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:38:37,635 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-22 01:38:37,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:38:37 BoogieIcfgContainer [2022-11-22 01:38:37,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:38:37,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:38:37,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:38:37,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:38:37,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:38:36" (1/3) ... [2022-11-22 01:38:37,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a746bf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:38:37, skipping insertion in model container [2022-11-22 01:38:37,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:38:36" (2/3) ... [2022-11-22 01:38:37,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a746bf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:38:37, skipping insertion in model container [2022-11-22 01:38:37,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:38:37" (3/3) ... [2022-11-22 01:38:37,649 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2022-11-22 01:38:37,658 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-22 01:38:37,670 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:38:37,671 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2022-11-22 01:38:37,671 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 01:38:37,902 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-22 01:38:37,945 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 01:38:37,959 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 546 places, 583 transitions, 1182 flow [2022-11-22 01:38:37,962 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 546 places, 583 transitions, 1182 flow [2022-11-22 01:38:37,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 546 places, 583 transitions, 1182 flow [2022-11-22 01:38:38,318 INFO L130 PetriNetUnfolder]: 44/581 cut-off events. [2022-11-22 01:38:38,319 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-22 01:38:38,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 581 events. 44/581 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1853 event pairs, 0 based on Foata normal form. 0/483 useless extension candidates. Maximal degree in co-relation 455. Up to 2 conditions per place. [2022-11-22 01:38:38,380 INFO L119 LiptonReduction]: Number of co-enabled transitions 105228 [2022-11-22 01:39:39,162 INFO L134 LiptonReduction]: Checked pairs total: 104764 [2022-11-22 01:39:39,162 INFO L136 LiptonReduction]: Total number of compositions: 844 [2022-11-22 01:39:39,169 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 75 transitions, 166 flow [2022-11-22 01:39:39,274 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1855 states, 1125 states have (on average 4.116444444444444) internal successors, (4631), 1854 states have internal predecessors, (4631), 0 states have call successors, (0), 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-22 01:39:39,293 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:39:39,300 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;@31ed7958, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:39:39,300 INFO L358 AbstractCegarLoop]: Starting to check reachability of 108 error locations. [2022-11-22 01:39:39,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 1855 states, 1125 states have (on average 4.116444444444444) internal successors, (4631), 1854 states have internal predecessors, (4631), 0 states have call successors, (0), 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-22 01:39:39,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-22 01:39:39,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:39,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-22 01:39:39,313 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:39:39,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:39,318 INFO L85 PathProgramCache]: Analyzing trace with hash 83853, now seen corresponding path program 1 times [2022-11-22 01:39:39,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:39,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841529491] [2022-11-22 01:39:39,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:39,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:39,651 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-22 01:39:39,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:39,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841529491] [2022-11-22 01:39:39,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841529491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:39:39,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:39:39,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:39:39,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237366585] [2022-11-22 01:39:39,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:39:39,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:39:39,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:39,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:39:39,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:39:39,695 INFO L87 Difference]: Start difference. First operand has 1855 states, 1125 states have (on average 4.116444444444444) internal successors, (4631), 1854 states have internal predecessors, (4631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:39,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:39:39,980 INFO L93 Difference]: Finished difference Result 1467 states and 3652 transitions. [2022-11-22 01:39:39,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:39:39,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-22 01:39:39,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:39:40,028 INFO L225 Difference]: With dead ends: 1467 [2022-11-22 01:39:40,029 INFO L226 Difference]: Without dead ends: 1467 [2022-11-22 01:39:40,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:39:40,035 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 46 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:39:40,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 2 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:39:40,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2022-11-22 01:39:40,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 736. [2022-11-22 01:39:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 483 states have (on average 3.7888198757763973) internal successors, (1830), 735 states have internal predecessors, (1830), 0 states have call successors, (0), 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-22 01:39:40,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1830 transitions. [2022-11-22 01:39:40,144 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1830 transitions. Word has length 2 [2022-11-22 01:39:40,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:39:40,145 INFO L495 AbstractCegarLoop]: Abstraction has 736 states and 1830 transitions. [2022-11-22 01:39:40,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:40,146 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1830 transitions. [2022-11-22 01:39:40,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-22 01:39:40,146 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:40,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-22 01:39:40,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:39:40,148 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:39:40,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:40,148 INFO L85 PathProgramCache]: Analyzing trace with hash 83921, now seen corresponding path program 1 times [2022-11-22 01:39:40,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:40,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285756226] [2022-11-22 01:39:40,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:40,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:40,226 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-22 01:39:40,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:40,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285756226] [2022-11-22 01:39:40,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285756226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:39:40,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:39:40,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:39:40,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668694230] [2022-11-22 01:39:40,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:39:40,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:39:40,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:40,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:39:40,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:39:40,230 INFO L87 Difference]: Start difference. First operand 736 states and 1830 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:40,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:39:40,335 INFO L93 Difference]: Finished difference Result 735 states and 1828 transitions. [2022-11-22 01:39:40,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:39:40,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-22 01:39:40,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:39:40,340 INFO L225 Difference]: With dead ends: 735 [2022-11-22 01:39:40,340 INFO L226 Difference]: Without dead ends: 735 [2022-11-22 01:39:40,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:39:40,341 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:39:40,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:39:40,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2022-11-22 01:39:40,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2022-11-22 01:39:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 483 states have (on average 3.7846790890269153) internal successors, (1828), 734 states have internal predecessors, (1828), 0 states have call successors, (0), 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-22 01:39:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1828 transitions. [2022-11-22 01:39:40,391 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1828 transitions. Word has length 2 [2022-11-22 01:39:40,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:39:40,391 INFO L495 AbstractCegarLoop]: Abstraction has 735 states and 1828 transitions. [2022-11-22 01:39:40,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1828 transitions. [2022-11-22 01:39:40,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-22 01:39:40,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:40,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-22 01:39:40,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 01:39:40,393 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:39:40,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:40,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2607625, now seen corresponding path program 1 times [2022-11-22 01:39:40,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:40,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021172685] [2022-11-22 01:39:40,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:40,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:40,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:39:40,504 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:40,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021172685] [2022-11-22 01:39:40,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021172685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:39:40,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592555488] [2022-11-22 01:39:40,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:40,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:39:40,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:39:40,511 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:39:40,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 01:39:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:40,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 01:39:40,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:39:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:39:40,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:39:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:39:40,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592555488] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:39:40,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2130659820] [2022-11-22 01:39:40,743 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java: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:336) 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-22 01:39:40,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:39:40,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2022-11-22 01:39:40,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601589139] [2022-11-22 01:39:40,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:39:40,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:39:40,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:40,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:39:40,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:39:40,747 INFO L87 Difference]: Start difference. First operand 735 states and 1828 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:41,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:39:41,391 INFO L93 Difference]: Finished difference Result 3662 states and 9122 transitions. [2022-11-22 01:39:41,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:39:41,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-22 01:39:41,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:39:41,414 INFO L225 Difference]: With dead ends: 3662 [2022-11-22 01:39:41,415 INFO L226 Difference]: Without dead ends: 3662 [2022-11-22 01:39:41,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:39:41,416 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 270 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:39:41,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 5 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 01:39:41,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2022-11-22 01:39:41,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 738. [2022-11-22 01:39:41,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 486 states have (on average 3.7736625514403292) internal successors, (1834), 737 states have internal predecessors, (1834), 0 states have call successors, (0), 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-22 01:39:41,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1834 transitions. [2022-11-22 01:39:41,468 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1834 transitions. Word has length 3 [2022-11-22 01:39:41,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:39:41,469 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1834 transitions. [2022-11-22 01:39:41,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:41,469 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1834 transitions. [2022-11-22 01:39:41,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-22 01:39:41,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:41,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-22 01:39:41,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 01:39:41,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:39:41,677 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:39:41,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:41,677 INFO L85 PathProgramCache]: Analyzing trace with hash 80833240, now seen corresponding path program 1 times [2022-11-22 01:39:41,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:41,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989437255] [2022-11-22 01:39:41,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:41,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:41,783 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-22 01:39:41,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:41,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989437255] [2022-11-22 01:39:41,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989437255] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:39:41,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:39:41,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:39:41,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914336529] [2022-11-22 01:39:41,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:39:41,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:39:41,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:41,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:39:41,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:39:41,786 INFO L87 Difference]: Start difference. First operand 738 states and 1834 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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-22 01:39:41,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:39:41,989 INFO L93 Difference]: Finished difference Result 1180 states and 3104 transitions. [2022-11-22 01:39:41,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:39:41,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-22 01:39:41,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:39:41,997 INFO L225 Difference]: With dead ends: 1180 [2022-11-22 01:39:41,997 INFO L226 Difference]: Without dead ends: 1180 [2022-11-22 01:39:41,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:39:41,998 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 39 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:39:41,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:39:42,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2022-11-22 01:39:42,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 834. [2022-11-22 01:39:42,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 582 states have (on average 4.379725085910653) internal successors, (2549), 833 states have internal predecessors, (2549), 0 states have call successors, (0), 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-22 01:39:42,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 2549 transitions. [2022-11-22 01:39:42,031 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 2549 transitions. Word has length 4 [2022-11-22 01:39:42,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:39:42,032 INFO L495 AbstractCegarLoop]: Abstraction has 834 states and 2549 transitions. [2022-11-22 01:39:42,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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-22 01:39:42,033 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 2549 transitions. [2022-11-22 01:39:42,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-22 01:39:42,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:42,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-22 01:39:42,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 01:39:42,033 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:39:42,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:42,034 INFO L85 PathProgramCache]: Analyzing trace with hash 80833280, now seen corresponding path program 1 times [2022-11-22 01:39:42,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:42,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817908350] [2022-11-22 01:39:42,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:42,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:42,223 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-22 01:39:42,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:42,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817908350] [2022-11-22 01:39:42,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817908350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:39:42,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:39:42,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:39:42,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918734342] [2022-11-22 01:39:42,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:39:42,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:39:42,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:42,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:39:42,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:39:42,225 INFO L87 Difference]: Start difference. First operand 834 states and 2549 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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-22 01:39:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:39:42,331 INFO L93 Difference]: Finished difference Result 770 states and 2327 transitions. [2022-11-22 01:39:42,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:39:42,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-22 01:39:42,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:39:42,337 INFO L225 Difference]: With dead ends: 770 [2022-11-22 01:39:42,338 INFO L226 Difference]: Without dead ends: 770 [2022-11-22 01:39:42,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:39:42,339 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:39:42,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:39:42,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-11-22 01:39:42,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2022-11-22 01:39:42,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 546 states have (on average 4.261904761904762) internal successors, (2327), 769 states have internal predecessors, (2327), 0 states have call successors, (0), 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-22 01:39:42,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 2327 transitions. [2022-11-22 01:39:42,367 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 2327 transitions. Word has length 4 [2022-11-22 01:39:42,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:39:42,368 INFO L495 AbstractCegarLoop]: Abstraction has 770 states and 2327 transitions. [2022-11-22 01:39:42,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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-22 01:39:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 2327 transitions. [2022-11-22 01:39:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-22 01:39:42,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:42,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-22 01:39:42,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 01:39:42,369 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:39:42,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:42,370 INFO L85 PathProgramCache]: Analyzing trace with hash 80833056, now seen corresponding path program 1 times [2022-11-22 01:39:42,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:42,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298229228] [2022-11-22 01:39:42,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:42,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:42,413 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-22 01:39:42,414 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:42,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298229228] [2022-11-22 01:39:42,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298229228] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:39:42,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:39:42,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:39:42,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102291799] [2022-11-22 01:39:42,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:39:42,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:39:42,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:42,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:39:42,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:39:42,416 INFO L87 Difference]: Start difference. First operand 770 states and 2327 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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-22 01:39:42,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:39:42,598 INFO L93 Difference]: Finished difference Result 1116 states and 2786 transitions. [2022-11-22 01:39:42,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:39:42,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-22 01:39:42,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:39:42,605 INFO L225 Difference]: With dead ends: 1116 [2022-11-22 01:39:42,605 INFO L226 Difference]: Without dead ends: 1116 [2022-11-22 01:39:42,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:39:42,607 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 34 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:39:42,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 2 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:39:42,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2022-11-22 01:39:42,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 770. [2022-11-22 01:39:42,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 546 states have (on average 4.086080586080586) internal successors, (2231), 769 states have internal predecessors, (2231), 0 states have call successors, (0), 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-22 01:39:42,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 2231 transitions. [2022-11-22 01:39:42,636 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 2231 transitions. Word has length 4 [2022-11-22 01:39:42,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:39:42,637 INFO L495 AbstractCegarLoop]: Abstraction has 770 states and 2231 transitions. [2022-11-22 01:39:42,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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-22 01:39:42,637 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 2231 transitions. [2022-11-22 01:39:42,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-22 01:39:42,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:42,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-22 01:39:42,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 01:39:42,638 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:39:42,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:42,639 INFO L85 PathProgramCache]: Analyzing trace with hash 80833220, now seen corresponding path program 1 times [2022-11-22 01:39:42,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:42,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142246460] [2022-11-22 01:39:42,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:42,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:42,742 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-22 01:39:42,743 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:42,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142246460] [2022-11-22 01:39:42,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142246460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:39:42,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:39:42,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:39:42,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781322714] [2022-11-22 01:39:42,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:39:42,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:39:42,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:42,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:39:42,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:39:42,745 INFO L87 Difference]: Start difference. First operand 770 states and 2231 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-22 01:39:42,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:39:42,999 INFO L93 Difference]: Finished difference Result 893 states and 2488 transitions. [2022-11-22 01:39:43,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:39:43,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-22 01:39:43,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:39:43,005 INFO L225 Difference]: With dead ends: 893 [2022-11-22 01:39:43,006 INFO L226 Difference]: Without dead ends: 893 [2022-11-22 01:39:43,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:39:43,007 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 66 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:39:43,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 3 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:39:43,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2022-11-22 01:39:43,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 803. [2022-11-22 01:39:43,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 579 states have (on average 4.043177892918825) internal successors, (2341), 802 states have internal predecessors, (2341), 0 states have call successors, (0), 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-22 01:39:43,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 2341 transitions. [2022-11-22 01:39:43,033 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 2341 transitions. Word has length 4 [2022-11-22 01:39:43,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:39:43,034 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 2341 transitions. [2022-11-22 01:39:43,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-22 01:39:43,034 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 2341 transitions. [2022-11-22 01:39:43,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-22 01:39:43,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:43,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-22 01:39:43,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 01:39:43,036 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err24ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:39:43,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:43,036 INFO L85 PathProgramCache]: Analyzing trace with hash 80833214, now seen corresponding path program 1 times [2022-11-22 01:39:43,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:43,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254451814] [2022-11-22 01:39:43,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:43,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:43,097 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-22 01:39:43,097 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:43,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254451814] [2022-11-22 01:39:43,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254451814] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:39:43,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:39:43,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:39:43,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3352987] [2022-11-22 01:39:43,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:39:43,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:39:43,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:43,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:39:43,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:39:43,100 INFO L87 Difference]: Start difference. First operand 803 states and 2341 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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-22 01:39:43,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:39:43,222 INFO L93 Difference]: Finished difference Result 739 states and 2087 transitions. [2022-11-22 01:39:43,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:39:43,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-22 01:39:43,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:39:43,227 INFO L225 Difference]: With dead ends: 739 [2022-11-22 01:39:43,227 INFO L226 Difference]: Without dead ends: 737 [2022-11-22 01:39:43,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:39:43,230 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:39:43,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:39:43,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2022-11-22 01:39:43,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2022-11-22 01:39:43,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 541 states have (on average 3.852125693160813) internal successors, (2084), 736 states have internal predecessors, (2084), 0 states have call successors, (0), 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-22 01:39:43,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 2084 transitions. [2022-11-22 01:39:43,254 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 2084 transitions. Word has length 4 [2022-11-22 01:39:43,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:39:43,255 INFO L495 AbstractCegarLoop]: Abstraction has 737 states and 2084 transitions. [2022-11-22 01:39:43,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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-22 01:39:43,255 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 2084 transitions. [2022-11-22 01:39:43,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 01:39:43,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:43,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 01:39:43,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 01:39:43,256 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:39:43,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:43,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1788789184, now seen corresponding path program 1 times [2022-11-22 01:39:43,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:43,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865846629] [2022-11-22 01:39:43,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:43,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:43,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:39:43,795 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:43,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865846629] [2022-11-22 01:39:43,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865846629] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:39:43,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255638282] [2022-11-22 01:39:43,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:43,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:39:43,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:39:43,799 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:39:43,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 01:39:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:43,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-22 01:39:43,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:39:44,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:39:44,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:39:44,077 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 14 treesize of output 16 [2022-11-22 01:39:44,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:39:44,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:39:44,153 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_132 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_132) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) is different from false [2022-11-22 01:39:44,171 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:39:44,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-22 01:39:44,181 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:39:44,181 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 33 treesize of output 31 [2022-11-22 01:39:44,187 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 5 treesize of output 3 [2022-11-22 01:39:44,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-22 01:39:44,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255638282] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:39:44,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [193582046] [2022-11-22 01:39:44,225 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:336) 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-22 01:39:44,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:39:44,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-11-22 01:39:44,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656132117] [2022-11-22 01:39:44,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:39:44,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 01:39:44,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:44,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 01:39:44,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2022-11-22 01:39:44,231 INFO L87 Difference]: Start difference. First operand 737 states and 2084 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:45,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:39:45,047 INFO L93 Difference]: Finished difference Result 1269 states and 3323 transitions. [2022-11-22 01:39:45,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 01:39:45,048 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-22 01:39:45,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:39:45,056 INFO L225 Difference]: With dead ends: 1269 [2022-11-22 01:39:45,056 INFO L226 Difference]: Without dead ends: 1269 [2022-11-22 01:39:45,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=182, Unknown=1, NotChecked=28, Total=272 [2022-11-22 01:39:45,058 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 193 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:39:45,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 11 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 488 Invalid, 0 Unknown, 81 Unchecked, 0.6s Time] [2022-11-22 01:39:45,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2022-11-22 01:39:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 799. [2022-11-22 01:39:45,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 603 states have (on average 3.9203980099502487) internal successors, (2364), 798 states have internal predecessors, (2364), 0 states have call successors, (0), 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-22 01:39:45,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 2364 transitions. [2022-11-22 01:39:45,090 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 2364 transitions. Word has length 5 [2022-11-22 01:39:45,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:39:45,090 INFO L495 AbstractCegarLoop]: Abstraction has 799 states and 2364 transitions. [2022-11-22 01:39:45,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:45,091 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 2364 transitions. [2022-11-22 01:39:45,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 01:39:45,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:45,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 01:39:45,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 01:39:45,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:39:45,297 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:39:45,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:45,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1788789340, now seen corresponding path program 1 times [2022-11-22 01:39:45,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:45,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158249761] [2022-11-22 01:39:45,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:45,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:45,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:39:45,751 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:45,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158249761] [2022-11-22 01:39:45,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158249761] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:39:45,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347631856] [2022-11-22 01:39:45,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:45,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:39:45,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:39:45,753 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:39:45,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 01:39:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:45,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-22 01:39:45,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:39:45,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:39:46,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:39:46,004 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 16 treesize of output 18 [2022-11-22 01:39:46,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:39:46,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:39:46,145 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:39:46,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-22 01:39:46,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:39:46,154 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 39 treesize of output 37 [2022-11-22 01:39:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:39:46,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347631856] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:39:46,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1897762339] [2022-11-22 01:39:46,190 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:336) 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-22 01:39:46,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:39:46,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-11-22 01:39:46,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580261444] [2022-11-22 01:39:46,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:39:46,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 01:39:46,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:46,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 01:39:46,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=84, Unknown=2, NotChecked=0, Total=110 [2022-11-22 01:39:46,194 INFO L87 Difference]: Start difference. First operand 799 states and 2364 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:47,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:39:47,030 INFO L93 Difference]: Finished difference Result 1232 states and 3201 transitions. [2022-11-22 01:39:47,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 01:39:47,031 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-22 01:39:47,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:39:47,039 INFO L225 Difference]: With dead ends: 1232 [2022-11-22 01:39:47,039 INFO L226 Difference]: Without dead ends: 1232 [2022-11-22 01:39:47,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=204, Unknown=2, NotChecked=0, Total=272 [2022-11-22 01:39:47,041 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 169 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:39:47,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 14 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 01:39:47,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2022-11-22 01:39:47,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 798. [2022-11-22 01:39:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 602 states have (on average 3.8172757475083055) internal successors, (2298), 797 states have internal predecessors, (2298), 0 states have call successors, (0), 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-22 01:39:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 2298 transitions. [2022-11-22 01:39:47,076 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 2298 transitions. Word has length 5 [2022-11-22 01:39:47,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:39:47,077 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 2298 transitions. [2022-11-22 01:39:47,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:47,077 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 2298 transitions. [2022-11-22 01:39:47,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 01:39:47,078 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:47,078 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1] [2022-11-22 01:39:47,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 01:39:47,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-22 01:39:47,285 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:39:47,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:47,286 INFO L85 PathProgramCache]: Analyzing trace with hash 382469773, now seen corresponding path program 2 times [2022-11-22 01:39:47,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:47,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242349153] [2022-11-22 01:39:47,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:47,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:47,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:39:47,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:47,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242349153] [2022-11-22 01:39:47,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242349153] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:39:47,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781941822] [2022-11-22 01:39:47,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:39:47,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:39:47,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:39:47,374 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:39:47,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 01:39:47,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 01:39:47,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:39:47,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 01:39:47,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:39:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-22 01:39:47,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:39:47,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781941822] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:39:47,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:39:47,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2022-11-22 01:39:47,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017511230] [2022-11-22 01:39:47,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:39:47,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:39:47,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:47,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:39:47,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:39:47,554 INFO L87 Difference]: Start difference. First operand 798 states and 2298 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:47,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:39:47,643 INFO L93 Difference]: Finished difference Result 797 states and 2297 transitions. [2022-11-22 01:39:47,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:39:47,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-22 01:39:47,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:39:47,653 INFO L225 Difference]: With dead ends: 797 [2022-11-22 01:39:47,658 INFO L226 Difference]: Without dead ends: 797 [2022-11-22 01:39:47,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:39:47,659 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:39:47,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:39:47,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2022-11-22 01:39:47,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 794. [2022-11-22 01:39:47,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 599 states have (on average 3.8247078464106843) internal successors, (2291), 793 states have internal predecessors, (2291), 0 states have call successors, (0), 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-22 01:39:47,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 2291 transitions. [2022-11-22 01:39:47,686 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 2291 transitions. Word has length 6 [2022-11-22 01:39:47,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:39:47,687 INFO L495 AbstractCegarLoop]: Abstraction has 794 states and 2291 transitions. [2022-11-22 01:39:47,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:47,687 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 2291 transitions. [2022-11-22 01:39:47,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 01:39:47,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:47,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 01:39:47,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 01:39:47,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:39:47,901 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:39:47,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:47,902 INFO L85 PathProgramCache]: Analyzing trace with hash 382105997, now seen corresponding path program 1 times [2022-11-22 01:39:47,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:47,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948793086] [2022-11-22 01:39:47,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:47,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:39:48,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:48,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948793086] [2022-11-22 01:39:48,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948793086] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:39:48,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952842028] [2022-11-22 01:39:48,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:48,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:39:48,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:39:48,405 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:39:48,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 01:39:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:48,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-22 01:39:48,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:39:48,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:39:48,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:39:48,669 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 14 treesize of output 16 [2022-11-22 01:39:48,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:39:48,710 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 14 treesize of output 16 [2022-11-22 01:39:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:39:48,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:39:48,803 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_232 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) is different from false [2022-11-22 01:39:48,816 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:39:48,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-22 01:39:48,825 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:39:48,826 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 63 treesize of output 61 [2022-11-22 01:39:48,831 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 48 treesize of output 44 [2022-11-22 01:39:48,837 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 22 treesize of output 20 [2022-11-22 01:39:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-22 01:39:48,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952842028] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:39:48,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1465188055] [2022-11-22 01:39:48,904 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:336) 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-22 01:39:48,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:39:48,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-11-22 01:39:48,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150634621] [2022-11-22 01:39:48,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:39:48,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-22 01:39:48,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:48,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-22 01:39:48,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=4, NotChecked=22, Total=182 [2022-11-22 01:39:48,907 INFO L87 Difference]: Start difference. First operand 794 states and 2291 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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-22 01:39:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:39:49,987 INFO L93 Difference]: Finished difference Result 3043 states and 8062 transitions. [2022-11-22 01:39:49,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 01:39:49,991 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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 6 [2022-11-22 01:39:49,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:39:50,019 INFO L225 Difference]: With dead ends: 3043 [2022-11-22 01:39:50,019 INFO L226 Difference]: Without dead ends: 3043 [2022-11-22 01:39:50,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=4, NotChecked=34, Total=380 [2022-11-22 01:39:50,020 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 507 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-22 01:39:50,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 8 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 572 Invalid, 0 Unknown, 115 Unchecked, 0.8s Time] [2022-11-22 01:39:50,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2022-11-22 01:39:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 857. [2022-11-22 01:39:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 662 states have (on average 3.880664652567976) internal successors, (2569), 856 states have internal predecessors, (2569), 0 states have call successors, (0), 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-22 01:39:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 2569 transitions. [2022-11-22 01:39:50,073 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 2569 transitions. Word has length 6 [2022-11-22 01:39:50,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:39:50,073 INFO L495 AbstractCegarLoop]: Abstraction has 857 states and 2569 transitions. [2022-11-22 01:39:50,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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-22 01:39:50,074 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 2569 transitions. [2022-11-22 01:39:50,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 01:39:50,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:50,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 01:39:50,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 01:39:50,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-22 01:39:50,281 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:39:50,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:50,282 INFO L85 PathProgramCache]: Analyzing trace with hash 382105841, now seen corresponding path program 1 times [2022-11-22 01:39:50,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:50,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255830927] [2022-11-22 01:39:50,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:50,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:50,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:39:50,904 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:50,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255830927] [2022-11-22 01:39:50,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255830927] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:39:50,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647350196] [2022-11-22 01:39:50,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:50,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:39:50,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:39:50,907 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:39:50,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 01:39:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:51,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-22 01:39:51,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:39:51,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:39:51,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:39:51,173 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 16 treesize of output 18 [2022-11-22 01:39:51,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:39:51,216 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 16 treesize of output 18 [2022-11-22 01:39:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:39:51,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:39:51,264 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_267 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_267) c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) 9223372039002259456))) is different from false [2022-11-22 01:39:51,329 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:39:51,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-22 01:39:51,339 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:39:51,340 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 73 treesize of output 71 [2022-11-22 01:39:51,345 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 56 treesize of output 52 [2022-11-22 01:39:51,359 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 26 treesize of output 24 [2022-11-22 01:39:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:39:51,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647350196] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:39:51,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1342156614] [2022-11-22 01:39:51,432 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java: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:336) 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-22 01:39:51,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:39:51,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-11-22 01:39:51,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325187313] [2022-11-22 01:39:51,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:39:51,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-22 01:39:51,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:51,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-22 01:39:51,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=4, NotChecked=22, Total=182 [2022-11-22 01:39:51,434 INFO L87 Difference]: Start difference. First operand 857 states and 2569 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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-22 01:39:53,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:39:53,464 INFO L93 Difference]: Finished difference Result 2128 states and 5806 transitions. [2022-11-22 01:39:53,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-22 01:39:53,465 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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 6 [2022-11-22 01:39:53,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:39:53,475 INFO L225 Difference]: With dead ends: 2128 [2022-11-22 01:39:53,475 INFO L226 Difference]: Without dead ends: 2128 [2022-11-22 01:39:53,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=4, NotChecked=40, Total=506 [2022-11-22 01:39:53,476 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 596 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:39:53,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 12 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 649 Invalid, 0 Unknown, 117 Unchecked, 1.2s Time] [2022-11-22 01:39:53,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2022-11-22 01:39:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 826. [2022-11-22 01:39:53,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 631 states have (on average 3.8510301109350236) internal successors, (2430), 825 states have internal predecessors, (2430), 0 states have call successors, (0), 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-22 01:39:53,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 2430 transitions. [2022-11-22 01:39:53,516 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 2430 transitions. Word has length 6 [2022-11-22 01:39:53,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:39:53,516 INFO L495 AbstractCegarLoop]: Abstraction has 826 states and 2430 transitions. [2022-11-22 01:39:53,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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-22 01:39:53,517 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 2430 transitions. [2022-11-22 01:39:53,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 01:39:53,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:53,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 01:39:53,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 01:39:53,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:39:53,723 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err24ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:39:53,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:53,724 INFO L85 PathProgramCache]: Analyzing trace with hash 371162792, now seen corresponding path program 1 times [2022-11-22 01:39:53,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:53,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778190550] [2022-11-22 01:39:53,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:53,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:53,792 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-22 01:39:53,793 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:53,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778190550] [2022-11-22 01:39:53,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778190550] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:39:53,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:39:53,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:39:53,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982836775] [2022-11-22 01:39:53,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:39:53,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:39:53,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:53,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:39:53,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:39:53,795 INFO L87 Difference]: Start difference. First operand 826 states and 2430 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:53,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:39:53,894 INFO L93 Difference]: Finished difference Result 722 states and 2120 transitions. [2022-11-22 01:39:53,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:39:53,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-22 01:39:53,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:39:53,899 INFO L225 Difference]: With dead ends: 722 [2022-11-22 01:39:53,899 INFO L226 Difference]: Without dead ends: 722 [2022-11-22 01:39:53,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:39:53,900 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:39:53,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:39:53,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2022-11-22 01:39:53,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2022-11-22 01:39:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 555 states have (on average 3.81981981981982) internal successors, (2120), 721 states have internal predecessors, (2120), 0 states have call successors, (0), 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-22 01:39:53,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 2120 transitions. [2022-11-22 01:39:53,925 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 2120 transitions. Word has length 6 [2022-11-22 01:39:53,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:39:53,925 INFO L495 AbstractCegarLoop]: Abstraction has 722 states and 2120 transitions. [2022-11-22 01:39:53,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:53,926 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 2120 transitions. [2022-11-22 01:39:53,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 01:39:53,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:53,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 01:39:53,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-22 01:39:53,927 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err25ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:39:53,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:53,928 INFO L85 PathProgramCache]: Analyzing trace with hash 371162793, now seen corresponding path program 1 times [2022-11-22 01:39:53,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:53,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482077394] [2022-11-22 01:39:53,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:53,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:53,976 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-22 01:39:53,976 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:53,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482077394] [2022-11-22 01:39:53,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482077394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:39:53,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:39:53,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:39:53,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057813652] [2022-11-22 01:39:53,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:39:53,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:39:53,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:53,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:39:53,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:39:53,979 INFO L87 Difference]: Start difference. First operand 722 states and 2120 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:54,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:39:54,076 INFO L93 Difference]: Finished difference Result 618 states and 1810 transitions. [2022-11-22 01:39:54,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:39:54,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-22 01:39:54,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:39:54,080 INFO L225 Difference]: With dead ends: 618 [2022-11-22 01:39:54,080 INFO L226 Difference]: Without dead ends: 618 [2022-11-22 01:39:54,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:39:54,081 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:39:54,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:39:54,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-11-22 01:39:54,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2022-11-22 01:39:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 479 states have (on average 3.778705636743215) internal successors, (1810), 617 states have internal predecessors, (1810), 0 states have call successors, (0), 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-22 01:39:54,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 1810 transitions. [2022-11-22 01:39:54,103 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 1810 transitions. Word has length 6 [2022-11-22 01:39:54,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:39:54,103 INFO L495 AbstractCegarLoop]: Abstraction has 618 states and 1810 transitions. [2022-11-22 01:39:54,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:54,104 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1810 transitions. [2022-11-22 01:39:54,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 01:39:54,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:54,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 01:39:54,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-22 01:39:54,105 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:39:54,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:54,106 INFO L85 PathProgramCache]: Analyzing trace with hash 371162841, now seen corresponding path program 1 times [2022-11-22 01:39:54,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:54,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017919673] [2022-11-22 01:39:54,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:54,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:54,289 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-22 01:39:54,289 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:54,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017919673] [2022-11-22 01:39:54,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017919673] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:39:54,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:39:54,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:39:54,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488876504] [2022-11-22 01:39:54,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:39:54,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:39:54,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:54,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:39:54,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:39:54,293 INFO L87 Difference]: Start difference. First operand 618 states and 1810 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:54,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:39:54,444 INFO L93 Difference]: Finished difference Result 654 states and 1870 transitions. [2022-11-22 01:39:54,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:39:54,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-22 01:39:54,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:39:54,450 INFO L225 Difference]: With dead ends: 654 [2022-11-22 01:39:54,450 INFO L226 Difference]: Without dead ends: 654 [2022-11-22 01:39:54,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:39:54,451 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:39:54,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:39:54,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2022-11-22 01:39:54,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 622. [2022-11-22 01:39:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 483 states have (on average 3.8219461697722568) internal successors, (1846), 621 states have internal predecessors, (1846), 0 states have call successors, (0), 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-22 01:39:54,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1846 transitions. [2022-11-22 01:39:54,479 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1846 transitions. Word has length 6 [2022-11-22 01:39:54,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:39:54,479 INFO L495 AbstractCegarLoop]: Abstraction has 622 states and 1846 transitions. [2022-11-22 01:39:54,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:54,480 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1846 transitions. [2022-11-22 01:39:54,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 01:39:54,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:54,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 01:39:54,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-22 01:39:54,481 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:39:54,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:54,481 INFO L85 PathProgramCache]: Analyzing trace with hash 371162730, now seen corresponding path program 1 times [2022-11-22 01:39:54,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:54,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770657238] [2022-11-22 01:39:54,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:54,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:54,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-22 01:39:54,577 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:54,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770657238] [2022-11-22 01:39:54,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770657238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:39:54,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:39:54,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:39:54,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347906479] [2022-11-22 01:39:54,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:39:54,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:39:54,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:54,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:39:54,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:39:54,580 INFO L87 Difference]: Start difference. First operand 622 states and 1846 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:54,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:39:54,789 INFO L93 Difference]: Finished difference Result 618 states and 1792 transitions. [2022-11-22 01:39:54,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:39:54,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-22 01:39:54,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:39:54,792 INFO L225 Difference]: With dead ends: 618 [2022-11-22 01:39:54,793 INFO L226 Difference]: Without dead ends: 618 [2022-11-22 01:39:54,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:39:54,794 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 38 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:39:54,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 5 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:39:54,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-11-22 01:39:54,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 610. [2022-11-22 01:39:54,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 471 states have (on average 3.791932059447983) internal successors, (1786), 609 states have internal predecessors, (1786), 0 states have call successors, (0), 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-22 01:39:54,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1786 transitions. [2022-11-22 01:39:54,811 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 1786 transitions. Word has length 6 [2022-11-22 01:39:54,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:39:54,812 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 1786 transitions. [2022-11-22 01:39:54,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:54,812 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1786 transitions. [2022-11-22 01:39:54,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 01:39:54,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:54,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 01:39:54,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-22 01:39:54,813 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err20ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:39:54,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:54,814 INFO L85 PathProgramCache]: Analyzing trace with hash 371162640, now seen corresponding path program 1 times [2022-11-22 01:39:54,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:54,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393807862] [2022-11-22 01:39:54,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:54,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:54,857 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-22 01:39:54,858 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:54,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393807862] [2022-11-22 01:39:54,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393807862] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:39:54,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:39:54,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:39:54,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541720253] [2022-11-22 01:39:54,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:39:54,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:39:54,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:54,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:39:54,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:39:54,860 INFO L87 Difference]: Start difference. First operand 610 states and 1786 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:54,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:39:54,992 INFO L93 Difference]: Finished difference Result 804 states and 2614 transitions. [2022-11-22 01:39:54,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:39:54,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-22 01:39:54,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:39:54,997 INFO L225 Difference]: With dead ends: 804 [2022-11-22 01:39:54,997 INFO L226 Difference]: Without dead ends: 804 [2022-11-22 01:39:54,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:39:54,998 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 29 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:39:54,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:39:55,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-11-22 01:39:55,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 658. [2022-11-22 01:39:55,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 519 states have (on average 4.475915221579961) internal successors, (2323), 657 states have internal predecessors, (2323), 0 states have call successors, (0), 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-22 01:39:55,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 2323 transitions. [2022-11-22 01:39:55,018 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 2323 transitions. Word has length 6 [2022-11-22 01:39:55,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:39:55,019 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 2323 transitions. [2022-11-22 01:39:55,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:55,019 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 2323 transitions. [2022-11-22 01:39:55,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 01:39:55,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:55,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 01:39:55,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-22 01:39:55,023 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:39:55,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:55,024 INFO L85 PathProgramCache]: Analyzing trace with hash 371162790, now seen corresponding path program 1 times [2022-11-22 01:39:55,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:55,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756843185] [2022-11-22 01:39:55,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:55,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:55,063 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-22 01:39:55,064 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:55,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756843185] [2022-11-22 01:39:55,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756843185] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:39:55,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:39:55,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:39:55,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000883320] [2022-11-22 01:39:55,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:39:55,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:39:55,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:55,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:39:55,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:39:55,068 INFO L87 Difference]: Start difference. First operand 658 states and 2323 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:55,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:39:55,190 INFO L93 Difference]: Finished difference Result 802 states and 2455 transitions. [2022-11-22 01:39:55,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:39:55,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-22 01:39:55,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:39:55,194 INFO L225 Difference]: With dead ends: 802 [2022-11-22 01:39:55,195 INFO L226 Difference]: Without dead ends: 791 [2022-11-22 01:39:55,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:39:55,195 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 26 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:39:55,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:39:55,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-11-22 01:39:55,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 645. [2022-11-22 01:39:55,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 506 states have (on average 4.24901185770751) internal successors, (2150), 644 states have internal predecessors, (2150), 0 states have call successors, (0), 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-22 01:39:55,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 2150 transitions. [2022-11-22 01:39:55,217 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 2150 transitions. Word has length 6 [2022-11-22 01:39:55,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:39:55,217 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 2150 transitions. [2022-11-22 01:39:55,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:55,218 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 2150 transitions. [2022-11-22 01:39:55,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 01:39:55,218 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:55,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:39:55,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-22 01:39:55,219 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:39:55,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:55,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1039405134, now seen corresponding path program 1 times [2022-11-22 01:39:55,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:55,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946624295] [2022-11-22 01:39:55,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:55,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:55,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:39:55,350 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:55,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946624295] [2022-11-22 01:39:55,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946624295] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:39:55,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426655508] [2022-11-22 01:39:55,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:55,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:39:55,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:39:55,355 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:39:55,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 01:39:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:55,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 01:39:55,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:39:55,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 53 [2022-11-22 01:39:55,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:39:55,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:39:55,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426655508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:39:55,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:39:55,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2022-11-22 01:39:55,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570847435] [2022-11-22 01:39:55,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:39:55,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:39:55,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:55,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:39:55,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-22 01:39:55,607 INFO L87 Difference]: Start difference. First operand 645 states and 2150 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:55,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:39:55,809 INFO L93 Difference]: Finished difference Result 613 states and 1943 transitions. [2022-11-22 01:39:55,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:39:55,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-22 01:39:55,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:39:55,812 INFO L225 Difference]: With dead ends: 613 [2022-11-22 01:39:55,812 INFO L226 Difference]: Without dead ends: 613 [2022-11-22 01:39:55,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-22 01:39:55,814 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 90 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:39:55,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 0 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:39:55,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2022-11-22 01:39:55,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 571. [2022-11-22 01:39:55,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 455 states have (on average 4.085714285714285) internal successors, (1859), 570 states have internal predecessors, (1859), 0 states have call successors, (0), 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-22 01:39:55,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 1859 transitions. [2022-11-22 01:39:55,836 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 1859 transitions. Word has length 7 [2022-11-22 01:39:55,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:39:55,837 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 1859 transitions. [2022-11-22 01:39:55,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:55,837 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1859 transitions. [2022-11-22 01:39:55,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 01:39:55,838 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:55,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:39:55,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-22 01:39:56,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:39:56,050 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:39:56,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:56,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1039404669, now seen corresponding path program 1 times [2022-11-22 01:39:56,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:56,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702384967] [2022-11-22 01:39:56,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:56,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:39:56,113 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:56,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702384967] [2022-11-22 01:39:56,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702384967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:39:56,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:39:56,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:39:56,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098788246] [2022-11-22 01:39:56,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:39:56,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:39:56,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:56,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:39:56,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:39:56,115 INFO L87 Difference]: Start difference. First operand 571 states and 1859 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:56,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:39:56,241 INFO L93 Difference]: Finished difference Result 547 states and 1768 transitions. [2022-11-22 01:39:56,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:39:56,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-22 01:39:56,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:39:56,245 INFO L225 Difference]: With dead ends: 547 [2022-11-22 01:39:56,245 INFO L226 Difference]: Without dead ends: 547 [2022-11-22 01:39:56,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:39:56,245 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 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-22 01:39:56,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:39:56,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-11-22 01:39:56,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2022-11-22 01:39:56,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 440 states have (on average 4.0181818181818185) internal successors, (1768), 546 states have internal predecessors, (1768), 0 states have call successors, (0), 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-22 01:39:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1768 transitions. [2022-11-22 01:39:56,261 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1768 transitions. Word has length 7 [2022-11-22 01:39:56,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:39:56,263 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 1768 transitions. [2022-11-22 01:39:56,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:39:56,263 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1768 transitions. [2022-11-22 01:39:56,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 01:39:56,264 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:56,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:39:56,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-22 01:39:56,264 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:39:56,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:56,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1039637786, now seen corresponding path program 1 times [2022-11-22 01:39:56,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:56,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214977893] [2022-11-22 01:39:56,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:56,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:39:56,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:56,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214977893] [2022-11-22 01:39:56,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214977893] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:39:56,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268302202] [2022-11-22 01:39:56,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:56,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:39:56,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:39:56,704 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:39:56,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 01:39:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:56,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-22 01:39:56,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:39:56,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:39:57,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:39:57,004 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 14 treesize of output 16 [2022-11-22 01:39:57,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:39:57,047 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 14 treesize of output 16 [2022-11-22 01:39:57,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:39:57,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:39:57,192 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:39:57,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-22 01:39:57,201 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:39:57,202 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 125 treesize of output 119 [2022-11-22 01:39:57,208 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 106 treesize of output 102 [2022-11-22 01:39:57,213 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 102 treesize of output 94 [2022-11-22 01:39:57,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:39:57,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268302202] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:39:57,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [592397093] [2022-11-22 01:39:57,296 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:336) 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-22 01:39:57,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:39:57,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-11-22 01:39:57,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431729926] [2022-11-22 01:39:57,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:39:57,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-22 01:39:57,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:39:57,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-22 01:39:57,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=141, Unknown=6, NotChecked=0, Total=182 [2022-11-22 01:39:57,299 INFO L87 Difference]: Start difference. First operand 547 states and 1768 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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-22 01:39:58,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:39:58,053 INFO L93 Difference]: Finished difference Result 1268 states and 3692 transitions. [2022-11-22 01:39:58,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 01:39:58,054 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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 7 [2022-11-22 01:39:58,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:39:58,059 INFO L225 Difference]: With dead ends: 1268 [2022-11-22 01:39:58,059 INFO L226 Difference]: Without dead ends: 1268 [2022-11-22 01:39:58,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=292, Unknown=6, NotChecked=0, Total=380 [2022-11-22 01:39:58,060 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 279 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:39:58,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 0 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 01:39:58,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2022-11-22 01:39:58,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 547. [2022-11-22 01:39:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 440 states have (on average 3.809090909090909) internal successors, (1676), 546 states have internal predecessors, (1676), 0 states have call successors, (0), 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-22 01:39:58,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1676 transitions. [2022-11-22 01:39:58,081 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1676 transitions. Word has length 7 [2022-11-22 01:39:58,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:39:58,081 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 1676 transitions. [2022-11-22 01:39:58,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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-22 01:39:58,082 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1676 transitions. [2022-11-22 01:39:58,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 01:39:58,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:39:58,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:39:58,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-22 01:39:58,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-22 01:39:58,293 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:39:58,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:39:58,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1039637807, now seen corresponding path program 1 times [2022-11-22 01:39:58,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:39:58,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444774202] [2022-11-22 01:39:58,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:58,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:39:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:58,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:39:58,685 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:39:58,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444774202] [2022-11-22 01:39:58,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444774202] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:39:58,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795309327] [2022-11-22 01:39:58,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:39:58,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:39:58,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:39:58,688 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:39:58,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-22 01:39:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:39:58,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-22 01:39:58,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:39:58,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:39:58,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:39:58,966 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 16 treesize of output 18 [2022-11-22 01:39:59,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:39:59,002 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 16 treesize of output 18 [2022-11-22 01:39:59,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:39:59,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:01,206 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:40:01,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-22 01:40:01,217 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:40:01,217 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 143 treesize of output 137 [2022-11-22 01:40:01,226 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 122 treesize of output 114 [2022-11-22 01:40:01,233 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 114 treesize of output 110 [2022-11-22 01:40:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:40:01,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795309327] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:40:01,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [29884585] [2022-11-22 01:40:01,324 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:336) 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-22 01:40:01,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:40:01,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-11-22 01:40:01,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595074166] [2022-11-22 01:40:01,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:40:01,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-22 01:40:01,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:01,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-22 01:40:01,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=139, Unknown=5, NotChecked=0, Total=182 [2022-11-22 01:40:01,328 INFO L87 Difference]: Start difference. First operand 547 states and 1676 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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-22 01:40:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:01,877 INFO L93 Difference]: Finished difference Result 589 states and 1711 transitions. [2022-11-22 01:40:01,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:40:01,878 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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 7 [2022-11-22 01:40:01,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:01,881 INFO L225 Difference]: With dead ends: 589 [2022-11-22 01:40:01,881 INFO L226 Difference]: Without dead ends: 589 [2022-11-22 01:40:01,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=68, Invalid=233, Unknown=5, NotChecked=0, Total=306 [2022-11-22 01:40:01,882 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 260 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:01,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 0 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:40:01,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-11-22 01:40:01,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 547. [2022-11-22 01:40:01,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 440 states have (on average 3.7045454545454546) internal successors, (1630), 546 states have internal predecessors, (1630), 0 states have call successors, (0), 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-22 01:40:01,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1630 transitions. [2022-11-22 01:40:01,898 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1630 transitions. Word has length 7 [2022-11-22 01:40:01,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:01,898 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 1630 transitions. [2022-11-22 01:40:01,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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-22 01:40:01,899 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1630 transitions. [2022-11-22 01:40:01,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 01:40:01,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:01,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:01,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:02,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:02,106 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:40:02,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:02,106 INFO L85 PathProgramCache]: Analyzing trace with hash 2138206098, now seen corresponding path program 1 times [2022-11-22 01:40:02,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:02,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559890424] [2022-11-22 01:40:02,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:02,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:02,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:40:02,267 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:02,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559890424] [2022-11-22 01:40:02,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559890424] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:02,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330572352] [2022-11-22 01:40:02,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:02,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:02,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:02,271 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:02,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-22 01:40:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:02,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-22 01:40:02,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:40:02,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:02,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:40:02,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330572352] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:40:02,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1560888885] [2022-11-22 01:40:02,751 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:336) 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-22 01:40:02,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:40:02,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-11-22 01:40:02,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407114579] [2022-11-22 01:40:02,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:40:02,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-22 01:40:02,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:02,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-22 01:40:02,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-11-22 01:40:02,754 INFO L87 Difference]: Start difference. First operand 547 states and 1630 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-22 01:40:03,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:03,406 INFO L93 Difference]: Finished difference Result 849 states and 2368 transitions. [2022-11-22 01:40:03,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 01:40:03,406 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 8 [2022-11-22 01:40:03,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:03,410 INFO L225 Difference]: With dead ends: 849 [2022-11-22 01:40:03,410 INFO L226 Difference]: Without dead ends: 843 [2022-11-22 01:40:03,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-11-22 01:40:03,411 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 245 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:03,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 0 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 01:40:03,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-11-22 01:40:03,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 711. [2022-11-22 01:40:03,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 604 states have (on average 3.524834437086093) internal successors, (2129), 710 states have internal predecessors, (2129), 0 states have call successors, (0), 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-22 01:40:03,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 2129 transitions. [2022-11-22 01:40:03,435 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 2129 transitions. Word has length 8 [2022-11-22 01:40:03,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:03,435 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 2129 transitions. [2022-11-22 01:40:03,435 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-22 01:40:03,436 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 2129 transitions. [2022-11-22 01:40:03,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 01:40:03,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:03,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:03,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:03,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:03,642 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:40:03,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:03,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2130973035, now seen corresponding path program 1 times [2022-11-22 01:40:03,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:03,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44521644] [2022-11-22 01:40:03,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:03,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:03,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:40:03,890 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:03,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44521644] [2022-11-22 01:40:03,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44521644] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:03,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731511332] [2022-11-22 01:40:03,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:03,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:03,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:03,892 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:03,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-22 01:40:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:04,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-22 01:40:04,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:04,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 133 [2022-11-22 01:40:04,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2022-11-22 01:40:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:40:04,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:05,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 552 treesize of output 504 [2022-11-22 01:40:05,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:40:05,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731511332] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:40:05,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [426158550] [2022-11-22 01:40:05,736 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java: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:336) 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-22 01:40:05,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:40:05,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-11-22 01:40:05,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442729906] [2022-11-22 01:40:05,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:40:05,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 01:40:05,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:05,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 01:40:05,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-11-22 01:40:05,739 INFO L87 Difference]: Start difference. First operand 711 states and 2129 transitions. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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-22 01:40:06,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:06,226 INFO L93 Difference]: Finished difference Result 681 states and 1933 transitions. [2022-11-22 01:40:06,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 01:40:06,227 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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-22 01:40:06,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:06,231 INFO L225 Difference]: With dead ends: 681 [2022-11-22 01:40:06,231 INFO L226 Difference]: Without dead ends: 681 [2022-11-22 01:40:06,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-11-22 01:40:06,232 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 130 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:06,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 0 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:40:06,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-11-22 01:40:06,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 649. [2022-11-22 01:40:06,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 542 states have (on average 3.514760147601476) internal successors, (1905), 648 states have internal predecessors, (1905), 0 states have call successors, (0), 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-22 01:40:06,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1905 transitions. [2022-11-22 01:40:06,250 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1905 transitions. Word has length 8 [2022-11-22 01:40:06,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:06,251 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 1905 transitions. [2022-11-22 01:40:06,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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-22 01:40:06,251 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1905 transitions. [2022-11-22 01:40:06,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 01:40:06,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:06,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:06,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:06,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-22 01:40:06,458 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err20ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:40:06,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:06,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2130972945, now seen corresponding path program 1 times [2022-11-22 01:40:06,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:06,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039420578] [2022-11-22 01:40:06,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:06,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:40:06,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:06,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039420578] [2022-11-22 01:40:06,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039420578] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:06,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679581239] [2022-11-22 01:40:06,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:06,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:06,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:06,711 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:06,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-22 01:40:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:06,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 01:40:06,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:07,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 464 treesize of output 416 [2022-11-22 01:40:07,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:40:07,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:08,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 546 treesize of output 498 [2022-11-22 01:40:08,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:40:08,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679581239] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:08,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 01:40:08,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2022-11-22 01:40:08,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198303292] [2022-11-22 01:40:08,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:40:08,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:40:08,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:08,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:40:08,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:40:08,257 INFO L87 Difference]: Start difference. First operand 649 states and 1905 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-22 01:40:08,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:08,336 INFO L93 Difference]: Finished difference Result 589 states and 1718 transitions. [2022-11-22 01:40:08,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:40:08,336 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-22 01:40:08,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:08,339 INFO L225 Difference]: With dead ends: 589 [2022-11-22 01:40:08,339 INFO L226 Difference]: Without dead ends: 589 [2022-11-22 01:40:08,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:40:08,340 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:08,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:40:08,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-11-22 01:40:08,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2022-11-22 01:40:08,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 494 states have (on average 3.477732793522267) internal successors, (1718), 588 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-22 01:40:08,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1718 transitions. [2022-11-22 01:40:08,355 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 1718 transitions. Word has length 8 [2022-11-22 01:40:08,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:08,356 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 1718 transitions. [2022-11-22 01:40:08,356 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-22 01:40:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 1718 transitions. [2022-11-22 01:40:08,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 01:40:08,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:08,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:08,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:08,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-22 01:40:08,571 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:40:08,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:08,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2130973095, now seen corresponding path program 1 times [2022-11-22 01:40:08,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:08,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228907874] [2022-11-22 01:40:08,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:08,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:08,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:40:08,766 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:08,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228907874] [2022-11-22 01:40:08,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228907874] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:08,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532635141] [2022-11-22 01:40:08,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:08,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:08,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:08,768 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:08,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-22 01:40:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:08,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 01:40:08,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:09,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 464 treesize of output 416 [2022-11-22 01:40:09,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:40:09,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:09,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 123 [2022-11-22 01:40:09,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:40:09,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532635141] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:09,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 01:40:09,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2022-11-22 01:40:09,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852335617] [2022-11-22 01:40:09,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:40:09,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:40:09,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:09,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:40:09,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:40:09,847 INFO L87 Difference]: Start difference. First operand 589 states and 1718 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-22 01:40:09,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:09,923 INFO L93 Difference]: Finished difference Result 483 states and 1395 transitions. [2022-11-22 01:40:09,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:40:09,924 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-22 01:40:09,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:09,926 INFO L225 Difference]: With dead ends: 483 [2022-11-22 01:40:09,926 INFO L226 Difference]: Without dead ends: 455 [2022-11-22 01:40:09,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:40:09,926 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:09,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:40:09,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-11-22 01:40:09,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2022-11-22 01:40:09,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 384 states have (on average 3.4609375) internal successors, (1329), 454 states have internal predecessors, (1329), 0 states have call successors, (0), 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-22 01:40:09,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1329 transitions. [2022-11-22 01:40:09,938 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1329 transitions. Word has length 8 [2022-11-22 01:40:09,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:09,939 INFO L495 AbstractCegarLoop]: Abstraction has 455 states and 1329 transitions. [2022-11-22 01:40:09,939 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-22 01:40:09,939 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1329 transitions. [2022-11-22 01:40:09,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 01:40:09,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:09,939 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:09,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:10,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:10,146 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:40:10,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:10,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2139748339, now seen corresponding path program 1 times [2022-11-22 01:40:10,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:10,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573661104] [2022-11-22 01:40:10,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:10,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:10,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:40:10,399 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:10,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573661104] [2022-11-22 01:40:10,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573661104] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:10,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62116485] [2022-11-22 01:40:10,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:10,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:10,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:10,401 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:10,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-22 01:40:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:10,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-22 01:40:10,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:10,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 12 [2022-11-22 01:40:10,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:40:10,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:11,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 307 treesize of output 267 [2022-11-22 01:40:11,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:40:11,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62116485] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:11,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 01:40:11,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2022-11-22 01:40:11,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319142505] [2022-11-22 01:40:11,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:40:11,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:40:11,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:11,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:40:11,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-22 01:40:11,273 INFO L87 Difference]: Start difference. First operand 455 states and 1329 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:40:11,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:11,485 INFO L93 Difference]: Finished difference Result 770 states and 2139 transitions. [2022-11-22 01:40:11,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:40:11,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-22 01:40:11,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:11,489 INFO L225 Difference]: With dead ends: 770 [2022-11-22 01:40:11,489 INFO L226 Difference]: Without dead ends: 770 [2022-11-22 01:40:11,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-22 01:40:11,490 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:11,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:40:11,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-11-22 01:40:11,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 525. [2022-11-22 01:40:11,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 454 states have (on average 3.616740088105727) internal successors, (1642), 524 states have internal predecessors, (1642), 0 states have call successors, (0), 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-22 01:40:11,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 1642 transitions. [2022-11-22 01:40:11,505 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 1642 transitions. Word has length 8 [2022-11-22 01:40:11,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:11,506 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 1642 transitions. [2022-11-22 01:40:11,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:40:11,506 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 1642 transitions. [2022-11-22 01:40:11,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 01:40:11,506 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:11,507 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:11,518 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-22 01:40:11,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-22 01:40:11,714 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:40:11,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:11,717 INFO L85 PathProgramCache]: Analyzing trace with hash 2139748500, now seen corresponding path program 1 times [2022-11-22 01:40:11,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:11,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804447194] [2022-11-22 01:40:11,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:11,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:12,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:40:12,025 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:12,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804447194] [2022-11-22 01:40:12,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804447194] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:12,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073281442] [2022-11-22 01:40:12,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:12,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:12,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:12,028 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:12,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-22 01:40:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:12,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 01:40:12,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:12,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-11-22 01:40:12,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:40:12,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:40:12,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073281442] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:40:12,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:40:12,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-11-22 01:40:12,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183934154] [2022-11-22 01:40:12,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:40:12,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:40:12,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:12,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:40:12,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:40:12,507 INFO L87 Difference]: Start difference. First operand 525 states and 1642 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:40:12,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:12,735 INFO L93 Difference]: Finished difference Result 733 states and 2038 transitions. [2022-11-22 01:40:12,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:40:12,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-22 01:40:12,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:12,739 INFO L225 Difference]: With dead ends: 733 [2022-11-22 01:40:12,739 INFO L226 Difference]: Without dead ends: 696 [2022-11-22 01:40:12,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:40:12,740 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:12,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:40:12,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-11-22 01:40:12,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 492. [2022-11-22 01:40:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 421 states have (on average 3.6318289786223277) internal successors, (1529), 491 states have internal predecessors, (1529), 0 states have call successors, (0), 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-22 01:40:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1529 transitions. [2022-11-22 01:40:12,755 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1529 transitions. Word has length 8 [2022-11-22 01:40:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:12,755 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 1529 transitions. [2022-11-22 01:40:12,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:40:12,756 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1529 transitions. [2022-11-22 01:40:12,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 01:40:12,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:12,756 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:12,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:12,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-22 01:40:12,963 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:40:12,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:12,964 INFO L85 PathProgramCache]: Analyzing trace with hash -726391538, now seen corresponding path program 2 times [2022-11-22 01:40:12,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:12,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130007032] [2022-11-22 01:40:12,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:12,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:13,551 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-22 01:40:13,551 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:13,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130007032] [2022-11-22 01:40:13,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130007032] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:13,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936282745] [2022-11-22 01:40:13,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:40:13,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:13,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:13,553 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:13,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-22 01:40:13,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 01:40:13,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:40:13,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-22 01:40:13,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:13,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:40:13,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:40:13,954 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 18 treesize of output 20 [2022-11-22 01:40:14,113 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-22 01:40:14,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:14,363 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:40:14,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-22 01:40:14,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:40:14,377 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 41 treesize of output 37 [2022-11-22 01:40:14,384 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 13 treesize of output 7 [2022-11-22 01:40:14,583 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-22 01:40:14,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936282745] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:40:14,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [637281729] [2022-11-22 01:40:14,584 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:336) 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-22 01:40:14,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:40:14,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-22 01:40:14,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505379077] [2022-11-22 01:40:14,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:40:14,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-22 01:40:14,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:14,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-22 01:40:14,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-11-22 01:40:14,586 INFO L87 Difference]: Start difference. First operand 492 states and 1529 transitions. Second operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:40:18,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:18,411 INFO L93 Difference]: Finished difference Result 1448 states and 4094 transitions. [2022-11-22 01:40:18,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-22 01:40:18,411 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-22 01:40:18,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:18,414 INFO L225 Difference]: With dead ends: 1448 [2022-11-22 01:40:18,415 INFO L226 Difference]: Without dead ends: 1448 [2022-11-22 01:40:18,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=297, Invalid=1263, Unknown=0, NotChecked=0, Total=1560 [2022-11-22 01:40:18,418 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 280 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1686 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1686 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:18,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 0 Invalid, 1751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1686 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-22 01:40:18,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2022-11-22 01:40:18,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 753. [2022-11-22 01:40:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 682 states have (on average 4.077712609970675) internal successors, (2781), 752 states have internal predecessors, (2781), 0 states have call successors, (0), 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-22 01:40:18,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 2781 transitions. [2022-11-22 01:40:18,442 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 2781 transitions. Word has length 9 [2022-11-22 01:40:18,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:18,443 INFO L495 AbstractCegarLoop]: Abstraction has 753 states and 2781 transitions. [2022-11-22 01:40:18,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:40:18,443 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 2781 transitions. [2022-11-22 01:40:18,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 01:40:18,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:18,444 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:18,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:18,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:18,650 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:40:18,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:18,651 INFO L85 PathProgramCache]: Analyzing trace with hash -726391694, now seen corresponding path program 1 times [2022-11-22 01:40:18,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:18,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884516855] [2022-11-22 01:40:18,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:18,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:19,056 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-22 01:40:19,056 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:19,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884516855] [2022-11-22 01:40:19,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884516855] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:19,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994146889] [2022-11-22 01:40:19,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:19,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:19,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:19,058 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:19,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-22 01:40:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:19,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-22 01:40:19,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:19,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:40:19,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:40:19,400 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 18 treesize of output 20 [2022-11-22 01:40:19,497 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-22 01:40:19,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:19,595 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_686 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-22 01:40:19,607 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:40:19,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-22 01:40:19,618 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:40:19,618 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 43 treesize of output 39 [2022-11-22 01:40:19,694 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-22 01:40:19,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994146889] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:40:19,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [826682781] [2022-11-22 01:40:19,694 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:336) 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-22 01:40:19,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:40:19,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-22 01:40:19,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321148222] [2022-11-22 01:40:19,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:40:19,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-22 01:40:19,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:19,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-22 01:40:19,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=297, Unknown=1, NotChecked=34, Total=380 [2022-11-22 01:40:19,696 INFO L87 Difference]: Start difference. First operand 753 states and 2781 transitions. Second operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:40:21,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:21,015 INFO L93 Difference]: Finished difference Result 929 states and 3141 transitions. [2022-11-22 01:40:21,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 01:40:21,016 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-22 01:40:21,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:21,018 INFO L225 Difference]: With dead ends: 929 [2022-11-22 01:40:21,018 INFO L226 Difference]: Without dead ends: 929 [2022-11-22 01:40:21,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=127, Invalid=688, Unknown=1, NotChecked=54, Total=870 [2022-11-22 01:40:21,019 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:21,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1065 Invalid, 0 Unknown, 92 Unchecked, 0.9s Time] [2022-11-22 01:40:21,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2022-11-22 01:40:21,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 767. [2022-11-22 01:40:21,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 696 states have (on average 4.064655172413793) internal successors, (2829), 766 states have internal predecessors, (2829), 0 states have call successors, (0), 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-22 01:40:21,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 2829 transitions. [2022-11-22 01:40:21,042 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 2829 transitions. Word has length 9 [2022-11-22 01:40:21,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:21,042 INFO L495 AbstractCegarLoop]: Abstraction has 767 states and 2829 transitions. [2022-11-22 01:40:21,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:40:21,042 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 2829 transitions. [2022-11-22 01:40:21,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 01:40:21,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:21,043 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:21,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:21,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-22 01:40:21,249 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:40:21,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:21,250 INFO L85 PathProgramCache]: Analyzing trace with hash -733624601, now seen corresponding path program 2 times [2022-11-22 01:40:21,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:21,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870708186] [2022-11-22 01:40:21,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:21,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:21,868 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-22 01:40:21,868 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:21,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870708186] [2022-11-22 01:40:21,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870708186] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:21,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989195131] [2022-11-22 01:40:21,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:40:21,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:21,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:21,870 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:21,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-22 01:40:22,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 01:40:22,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:40:22,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-22 01:40:22,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:22,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:40:22,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:40:22,284 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 18 treesize of output 20 [2022-11-22 01:40:22,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:40:22,359 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 18 treesize of output 20 [2022-11-22 01:40:22,853 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-22 01:40:22,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:23,863 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:40:23,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 56 [2022-11-22 01:40:23,882 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:40:23,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 179 [2022-11-22 01:40:23,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:40:23,894 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 156 treesize of output 140 [2022-11-22 01:40:23,917 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:40:23,917 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 73 treesize of output 65 [2022-11-22 01:40:24,157 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-22 01:40:24,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989195131] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:40:24,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1678631411] [2022-11-22 01:40:24,158 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java: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:336) 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-22 01:40:24,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:40:24,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-22 01:40:24,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610220603] [2022-11-22 01:40:24,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:40:24,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-22 01:40:24,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:24,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-22 01:40:24,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=309, Unknown=4, NotChecked=0, Total=380 [2022-11-22 01:40:24,161 INFO L87 Difference]: Start difference. First operand 767 states and 2829 transitions. Second operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:40:26,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:40:30,732 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-22 01:40:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:31,345 INFO L93 Difference]: Finished difference Result 1697 states and 6040 transitions. [2022-11-22 01:40:31,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-22 01:40:31,346 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-22 01:40:31,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:31,350 INFO L225 Difference]: With dead ends: 1697 [2022-11-22 01:40:31,350 INFO L226 Difference]: Without dead ends: 1697 [2022-11-22 01:40:31,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=271, Invalid=847, Unknown=4, NotChecked=0, Total=1122 [2022-11-22 01:40:31,351 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 707 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 48 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:31,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 0 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 955 Invalid, 15 Unknown, 0 Unchecked, 5.7s Time] [2022-11-22 01:40:31,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2022-11-22 01:40:31,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1075. [2022-11-22 01:40:31,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 1004 states have (on average 4.579681274900398) internal successors, (4598), 1074 states have internal predecessors, (4598), 0 states have call successors, (0), 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-22 01:40:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 4598 transitions. [2022-11-22 01:40:31,394 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 4598 transitions. Word has length 9 [2022-11-22 01:40:31,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:31,397 INFO L495 AbstractCegarLoop]: Abstraction has 1075 states and 4598 transitions. [2022-11-22 01:40:31,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:40:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 4598 transitions. [2022-11-22 01:40:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 01:40:31,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:31,398 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:31,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:31,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-22 01:40:31,610 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:40:31,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:31,610 INFO L85 PathProgramCache]: Analyzing trace with hash -733624518, now seen corresponding path program 1 times [2022-11-22 01:40:31,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:31,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780794619] [2022-11-22 01:40:31,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:31,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:31,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:40:31,816 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:31,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780794619] [2022-11-22 01:40:31,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780794619] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:31,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719809160] [2022-11-22 01:40:31,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:31,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:31,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:31,833 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:31,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-22 01:40:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:32,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-22 01:40:32,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:32,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 133 [2022-11-22 01:40:32,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 102 [2022-11-22 01:40:32,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:40:32,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:32,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 123 [2022-11-22 01:40:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:40:32,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719809160] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:40:32,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [482874064] [2022-11-22 01:40:32,753 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:336) 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-22 01:40:32,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:40:32,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-11-22 01:40:32,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344309202] [2022-11-22 01:40:32,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:40:32,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 01:40:32,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:32,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 01:40:32,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:40:32,756 INFO L87 Difference]: Start difference. First operand 1075 states and 4598 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 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-22 01:40:33,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:33,062 INFO L93 Difference]: Finished difference Result 1417 states and 5452 transitions. [2022-11-22 01:40:33,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:40:33,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 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 9 [2022-11-22 01:40:33,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:33,068 INFO L225 Difference]: With dead ends: 1417 [2022-11-22 01:40:33,068 INFO L226 Difference]: Without dead ends: 1417 [2022-11-22 01:40:33,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:40:33,069 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 136 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:33,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 0 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:40:33,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2022-11-22 01:40:33,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 1127. [2022-11-22 01:40:33,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 1056 states have (on average 4.459280303030303) internal successors, (4709), 1126 states have internal predecessors, (4709), 0 states have call successors, (0), 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-22 01:40:33,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 4709 transitions. [2022-11-22 01:40:33,106 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 4709 transitions. Word has length 9 [2022-11-22 01:40:33,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:33,106 INFO L495 AbstractCegarLoop]: Abstraction has 1127 states and 4709 transitions. [2022-11-22 01:40:33,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 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-22 01:40:33,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 4709 transitions. [2022-11-22 01:40:33,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 01:40:33,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:33,108 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:33,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:33,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-22 01:40:33,313 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:40:33,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:33,313 INFO L85 PathProgramCache]: Analyzing trace with hash -733624622, now seen corresponding path program 1 times [2022-11-22 01:40:33,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:33,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845938472] [2022-11-22 01:40:33,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:33,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:33,805 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-22 01:40:33,805 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:33,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845938472] [2022-11-22 01:40:33,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845938472] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:33,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004081120] [2022-11-22 01:40:33,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:33,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:33,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:33,807 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:33,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-22 01:40:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:34,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-22 01:40:34,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:34,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:40:34,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:40:34,237 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 18 treesize of output 20 [2022-11-22 01:40:34,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:40:34,304 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 18 treesize of output 20 [2022-11-22 01:40:34,700 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-22 01:40:34,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:35,620 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_796) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< (+ .cse1 2147483648) 0) (< 2147483647 .cse1))))) is different from false [2022-11-22 01:40:35,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:40:35,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 58 [2022-11-22 01:40:35,656 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:40:35,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 401 treesize of output 385 [2022-11-22 01:40:35,670 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 182 treesize of output 166 [2022-11-22 01:40:35,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:40:35,684 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 344 treesize of output 312 [2022-11-22 01:40:35,920 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-22 01:40:35,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004081120] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:40:35,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [420776753] [2022-11-22 01:40:35,920 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java: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:336) 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-22 01:40:35,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:40:35,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-22 01:40:35,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914603702] [2022-11-22 01:40:35,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:40:35,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-22 01:40:35,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:35,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-22 01:40:35,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=4, NotChecked=34, Total=380 [2022-11-22 01:40:35,922 INFO L87 Difference]: Start difference. First operand 1127 states and 4709 transitions. Second operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:40:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:37,065 INFO L93 Difference]: Finished difference Result 1335 states and 4938 transitions. [2022-11-22 01:40:37,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 01:40:37,067 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-22 01:40:37,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:37,070 INFO L225 Difference]: With dead ends: 1335 [2022-11-22 01:40:37,070 INFO L226 Difference]: Without dead ends: 1335 [2022-11-22 01:40:37,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=4, NotChecked=46, Total=650 [2022-11-22 01:40:37,071 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 288 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:37,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 0 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 779 Invalid, 0 Unknown, 68 Unchecked, 0.8s Time] [2022-11-22 01:40:37,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2022-11-22 01:40:37,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1127. [2022-11-22 01:40:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 1056 states have (on average 4.190340909090909) internal successors, (4425), 1126 states have internal predecessors, (4425), 0 states have call successors, (0), 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-22 01:40:37,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 4425 transitions. [2022-11-22 01:40:37,101 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 4425 transitions. Word has length 9 [2022-11-22 01:40:37,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:37,101 INFO L495 AbstractCegarLoop]: Abstraction has 1127 states and 4425 transitions. [2022-11-22 01:40:37,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:40:37,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 4425 transitions. [2022-11-22 01:40:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 01:40:37,102 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:37,102 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:37,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:37,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:37,309 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:40:37,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:37,309 INFO L85 PathProgramCache]: Analyzing trace with hash -724849112, now seen corresponding path program 1 times [2022-11-22 01:40:37,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:37,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313364361] [2022-11-22 01:40:37,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:37,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:40:37,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:37,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313364361] [2022-11-22 01:40:37,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313364361] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:37,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519332759] [2022-11-22 01:40:37,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:37,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:37,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:37,507 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:37,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-22 01:40:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:37,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-22 01:40:37,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:37,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-22 01:40:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:40:37,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:38,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 307 treesize of output 267 [2022-11-22 01:40:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:40:38,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519332759] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:40:38,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1833313921] [2022-11-22 01:40:38,251 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:336) 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-22 01:40:38,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:40:38,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-22 01:40:38,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057106163] [2022-11-22 01:40:38,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:40:38,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 01:40:38,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:38,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 01:40:38,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:40:38,255 INFO L87 Difference]: Start difference. First operand 1127 states and 4425 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:40:38,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:38,727 INFO L93 Difference]: Finished difference Result 1913 states and 6901 transitions. [2022-11-22 01:40:38,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 01:40:38,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-22 01:40:38,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:38,747 INFO L225 Difference]: With dead ends: 1913 [2022-11-22 01:40:38,747 INFO L226 Difference]: Without dead ends: 1913 [2022-11-22 01:40:38,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-11-22 01:40:38,748 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 159 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:38,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 0 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:40:38,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2022-11-22 01:40:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1329. [2022-11-22 01:40:38,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 1258 states have (on average 4.328298887122417) internal successors, (5445), 1328 states have internal predecessors, (5445), 0 states have call successors, (0), 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-22 01:40:38,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 5445 transitions. [2022-11-22 01:40:38,787 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 5445 transitions. Word has length 9 [2022-11-22 01:40:38,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:38,788 INFO L495 AbstractCegarLoop]: Abstraction has 1329 states and 5445 transitions. [2022-11-22 01:40:38,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:40:38,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 5445 transitions. [2022-11-22 01:40:38,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 01:40:38,789 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:38,789 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:38,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:38,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:38,996 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:40:38,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:38,996 INFO L85 PathProgramCache]: Analyzing trace with hash -724849107, now seen corresponding path program 1 times [2022-11-22 01:40:38,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:38,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935269414] [2022-11-22 01:40:38,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:38,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:40:39,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:39,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935269414] [2022-11-22 01:40:39,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935269414] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:39,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102593184] [2022-11-22 01:40:39,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:39,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:39,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:39,229 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:39,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-22 01:40:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:39,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-22 01:40:39,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:39,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:40:39,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:40,076 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-22 01:40:40,076 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 341 treesize of output 284 [2022-11-22 01:40:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:40:40,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102593184] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:40:40,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1962274731] [2022-11-22 01:40:40,260 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:336) 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-22 01:40:40,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:40:40,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-11-22 01:40:40,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784859480] [2022-11-22 01:40:40,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:40:40,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 01:40:40,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:40,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 01:40:40,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-22 01:40:40,262 INFO L87 Difference]: Start difference. First operand 1329 states and 5445 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 11 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-22 01:40:41,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:41,010 INFO L93 Difference]: Finished difference Result 2250 states and 7940 transitions. [2022-11-22 01:40:41,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-22 01:40:41,011 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 11 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 9 [2022-11-22 01:40:41,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:41,016 INFO L225 Difference]: With dead ends: 2250 [2022-11-22 01:40:41,016 INFO L226 Difference]: Without dead ends: 2250 [2022-11-22 01:40:41,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-11-22 01:40:41,017 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 163 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:41,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 0 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 01:40:41,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2022-11-22 01:40:41,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 1152. [2022-11-22 01:40:41,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1081 states have (on average 4.162812210915819) internal successors, (4500), 1151 states have internal predecessors, (4500), 0 states have call successors, (0), 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-22 01:40:41,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 4500 transitions. [2022-11-22 01:40:41,054 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 4500 transitions. Word has length 9 [2022-11-22 01:40:41,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:41,054 INFO L495 AbstractCegarLoop]: Abstraction has 1152 states and 4500 transitions. [2022-11-22 01:40:41,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 11 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-22 01:40:41,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 4500 transitions. [2022-11-22 01:40:41,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 01:40:41,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:41,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:41,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:41,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-22 01:40:41,267 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:40:41,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:41,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1904530632, now seen corresponding path program 1 times [2022-11-22 01:40:41,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:41,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496772647] [2022-11-22 01:40:41,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:41,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:41,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:40:41,610 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:41,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496772647] [2022-11-22 01:40:41,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496772647] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:41,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729952055] [2022-11-22 01:40:41,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:41,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:41,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:41,612 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:41,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-22 01:40:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:41,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-22 01:40:41,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:42,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:40:42,219 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 58 treesize of output 54 [2022-11-22 01:40:42,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-11-22 01:40:42,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:40:42,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:42,299 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_887) c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) 9223372039002259456))) is different from false [2022-11-22 01:40:42,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 327 treesize of output 287 [2022-11-22 01:40:42,454 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 15 treesize of output 9 [2022-11-22 01:40:42,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:40:42,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729952055] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:40:42,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1499332463] [2022-11-22 01:40:42,723 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:336) 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-22 01:40:42,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:40:42,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-11-22 01:40:42,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318438686] [2022-11-22 01:40:42,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:40:42,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-22 01:40:42,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:42,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-22 01:40:42,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=193, Unknown=1, NotChecked=28, Total=272 [2022-11-22 01:40:42,726 INFO L87 Difference]: Start difference. First operand 1152 states and 4500 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:40:43,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:43,972 INFO L93 Difference]: Finished difference Result 2612 states and 9607 transitions. [2022-11-22 01:40:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-22 01:40:43,973 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-22 01:40:43,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:43,979 INFO L225 Difference]: With dead ends: 2612 [2022-11-22 01:40:43,979 INFO L226 Difference]: Without dead ends: 2612 [2022-11-22 01:40:43,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=291, Invalid=642, Unknown=1, NotChecked=58, Total=992 [2022-11-22 01:40:43,979 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 568 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:43,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 0 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 305 Invalid, 0 Unknown, 88 Unchecked, 0.5s Time] [2022-11-22 01:40:43,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2612 states. [2022-11-22 01:40:44,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2612 to 1100. [2022-11-22 01:40:44,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 1041 states have (on average 4.095100864553314) internal successors, (4263), 1099 states have internal predecessors, (4263), 0 states have call successors, (0), 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-22 01:40:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 4263 transitions. [2022-11-22 01:40:44,009 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 4263 transitions. Word has length 9 [2022-11-22 01:40:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:44,009 INFO L495 AbstractCegarLoop]: Abstraction has 1100 states and 4263 transitions. [2022-11-22 01:40:44,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:40:44,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 4263 transitions. [2022-11-22 01:40:44,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 01:40:44,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:44,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:44,016 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:44,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-22 01:40:44,217 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:40:44,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:44,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1904530793, now seen corresponding path program 1 times [2022-11-22 01:40:44,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:44,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636710728] [2022-11-22 01:40:44,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:44,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:44,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:40:44,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:44,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636710728] [2022-11-22 01:40:44,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636710728] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:44,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214697990] [2022-11-22 01:40:44,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:44,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:44,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:44,528 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:44,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-22 01:40:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:44,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-22 01:40:44,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:45,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:40:45,154 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 58 treesize of output 54 [2022-11-22 01:40:45,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-11-22 01:40:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:40:45,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:45,231 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_918 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_918) c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) 4294967295)) is different from false [2022-11-22 01:40:45,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 323 treesize of output 283 [2022-11-22 01:40:45,407 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 13 treesize of output 7 [2022-11-22 01:40:45,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:40:45,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214697990] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:40:45,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1672611105] [2022-11-22 01:40:45,560 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:336) 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-22 01:40:45,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:40:45,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-11-22 01:40:45,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587739946] [2022-11-22 01:40:45,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:40:45,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-22 01:40:45,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:45,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-22 01:40:45,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2022-11-22 01:40:45,563 INFO L87 Difference]: Start difference. First operand 1100 states and 4263 transitions. Second operand has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 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-22 01:40:46,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:46,040 INFO L93 Difference]: Finished difference Result 1461 states and 5321 transitions. [2022-11-22 01:40:46,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 01:40:46,040 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 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 9 [2022-11-22 01:40:46,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:46,044 INFO L225 Difference]: With dead ends: 1461 [2022-11-22 01:40:46,044 INFO L226 Difference]: Without dead ends: 1437 [2022-11-22 01:40:46,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=254, Unknown=1, NotChecked=36, Total=420 [2022-11-22 01:40:46,047 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 365 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:46,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 0 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 110 Invalid, 0 Unknown, 72 Unchecked, 0.2s Time] [2022-11-22 01:40:46,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2022-11-22 01:40:46,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 737. [2022-11-22 01:40:46,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 696 states have (on average 3.9511494252873565) internal successors, (2750), 736 states have internal predecessors, (2750), 0 states have call successors, (0), 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-22 01:40:46,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 2750 transitions. [2022-11-22 01:40:46,074 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 2750 transitions. Word has length 9 [2022-11-22 01:40:46,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:46,074 INFO L495 AbstractCegarLoop]: Abstraction has 737 states and 2750 transitions. [2022-11-22 01:40:46,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 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-22 01:40:46,074 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 2750 transitions. [2022-11-22 01:40:46,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 01:40:46,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:46,075 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:46,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:46,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:46,282 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:40:46,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:46,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1043293255, now seen corresponding path program 1 times [2022-11-22 01:40:46,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:46,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678755305] [2022-11-22 01:40:46,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:46,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:46,759 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-22 01:40:46,759 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:46,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678755305] [2022-11-22 01:40:46,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678755305] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:46,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051104637] [2022-11-22 01:40:46,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:46,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:46,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:46,761 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:46,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-22 01:40:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:47,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-22 01:40:47,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:47,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:40:47,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:40:47,131 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 16 treesize of output 18 [2022-11-22 01:40:47,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:40:47,215 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 16 treesize of output 18 [2022-11-22 01:40:47,275 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-22 01:40:47,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:47,385 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_956 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_956) c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4) 4)) 4294967296)) is different from false [2022-11-22 01:40:47,482 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:40:47,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-22 01:40:47,498 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:40:47,498 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 141 treesize of output 131 [2022-11-22 01:40:47,503 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 118 treesize of output 110 [2022-11-22 01:40:47,508 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 110 treesize of output 94 [2022-11-22 01:40:47,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-22 01:40:47,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051104637] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:40:47,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1972846513] [2022-11-22 01:40:47,633 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:336) 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-22 01:40:47,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:40:47,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-22 01:40:47,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855892865] [2022-11-22 01:40:47,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:40:47,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-22 01:40:47,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:47,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-22 01:40:47,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=400, Unknown=6, NotChecked=40, Total=506 [2022-11-22 01:40:47,636 INFO L87 Difference]: Start difference. First operand 737 states and 2750 transitions. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:40:48,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:48,788 INFO L93 Difference]: Finished difference Result 1718 states and 5776 transitions. [2022-11-22 01:40:48,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 01:40:48,788 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-22 01:40:48,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:48,792 INFO L225 Difference]: With dead ends: 1718 [2022-11-22 01:40:48,792 INFO L226 Difference]: Without dead ends: 1718 [2022-11-22 01:40:48,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=129, Invalid=739, Unknown=6, NotChecked=56, Total=930 [2022-11-22 01:40:48,793 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 266 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:48,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 0 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 638 Invalid, 0 Unknown, 88 Unchecked, 0.6s Time] [2022-11-22 01:40:48,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2022-11-22 01:40:48,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 923. [2022-11-22 01:40:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 882 states have (on average 4.073696145124717) internal successors, (3593), 922 states have internal predecessors, (3593), 0 states have call successors, (0), 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-22 01:40:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 3593 transitions. [2022-11-22 01:40:48,819 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 3593 transitions. Word has length 10 [2022-11-22 01:40:48,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:48,820 INFO L495 AbstractCegarLoop]: Abstraction has 923 states and 3593 transitions. [2022-11-22 01:40:48,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:40:48,820 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 3593 transitions. [2022-11-22 01:40:48,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 01:40:48,821 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:48,821 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:48,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:49,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-22 01:40:49,028 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:40:49,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:49,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1043293411, now seen corresponding path program 1 times [2022-11-22 01:40:49,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:49,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310081709] [2022-11-22 01:40:49,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:49,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:49,504 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-22 01:40:49,504 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:49,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310081709] [2022-11-22 01:40:49,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310081709] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:49,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772346661] [2022-11-22 01:40:49,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:49,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:49,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:49,506 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:49,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-22 01:40:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:49,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-22 01:40:49,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:49,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:40:49,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:40:49,949 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 18 treesize of output 20 [2022-11-22 01:40:50,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:40:50,047 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 18 treesize of output 20 [2022-11-22 01:40:50,102 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-22 01:40:50,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:50,319 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:40:50,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-22 01:40:50,330 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:40:50,330 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 81 treesize of output 77 [2022-11-22 01:40:50,335 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 62 treesize of output 54 [2022-11-22 01:40:50,340 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 28 treesize of output 24 [2022-11-22 01:40:50,450 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-22 01:40:50,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772346661] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:40:50,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2104989634] [2022-11-22 01:40:50,451 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:336) 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-22 01:40:50,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:40:50,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-11-22 01:40:50,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635855669] [2022-11-22 01:40:50,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:40:50,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-22 01:40:50,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:50,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-22 01:40:50,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=389, Unknown=8, NotChecked=0, Total=462 [2022-11-22 01:40:50,453 INFO L87 Difference]: Start difference. First operand 923 states and 3593 transitions. Second operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:40:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:51,408 INFO L93 Difference]: Finished difference Result 1675 states and 5610 transitions. [2022-11-22 01:40:51,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 01:40:51,409 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-22 01:40:51,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:51,415 INFO L225 Difference]: With dead ends: 1675 [2022-11-22 01:40:51,415 INFO L226 Difference]: Without dead ends: 1675 [2022-11-22 01:40:51,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=578, Unknown=8, NotChecked=0, Total=702 [2022-11-22 01:40:51,417 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 306 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:51,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 0 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 01:40:51,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2022-11-22 01:40:51,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 923. [2022-11-22 01:40:51,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 882 states have (on average 4.003401360544218) internal successors, (3531), 922 states have internal predecessors, (3531), 0 states have call successors, (0), 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-22 01:40:51,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 3531 transitions. [2022-11-22 01:40:51,444 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 3531 transitions. Word has length 10 [2022-11-22 01:40:51,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:51,444 INFO L495 AbstractCegarLoop]: Abstraction has 923 states and 3531 transitions. [2022-11-22 01:40:51,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:40:51,445 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 3531 transitions. [2022-11-22 01:40:51,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 01:40:51,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:51,445 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:51,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-11-22 01:40:51,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-22 01:40:51,651 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:40:51,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:51,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1043305345, now seen corresponding path program 2 times [2022-11-22 01:40:51,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:51,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946135336] [2022-11-22 01:40:51,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:51,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:52,080 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-22 01:40:52,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:52,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946135336] [2022-11-22 01:40:52,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946135336] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:52,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337546343] [2022-11-22 01:40:52,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:40:52,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:52,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:52,083 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:52,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-22 01:40:52,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 01:40:52,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:40:52,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-22 01:40:52,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:52,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:40:52,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:40:52,572 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 18 treesize of output 20 [2022-11-22 01:40:52,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:40:52,822 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 18 treesize of output 20 [2022-11-22 01:40:52,869 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-22 01:40:52,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:53,209 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:40:53,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-22 01:40:53,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:40:53,221 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 79 treesize of output 75 [2022-11-22 01:40:53,227 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 60 treesize of output 48 [2022-11-22 01:40:53,235 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 26 treesize of output 20 [2022-11-22 01:40:53,470 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-22 01:40:53,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337546343] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:40:53,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2007681241] [2022-11-22 01:40:53,471 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java: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:336) 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-22 01:40:53,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:40:53,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-22 01:40:53,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236069717] [2022-11-22 01:40:53,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:40:53,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-22 01:40:53,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:53,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-22 01:40:53,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=436, Unknown=5, NotChecked=0, Total=506 [2022-11-22 01:40:53,473 INFO L87 Difference]: Start difference. First operand 923 states and 3531 transitions. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:40:59,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:59,099 INFO L93 Difference]: Finished difference Result 3043 states and 9045 transitions. [2022-11-22 01:40:59,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-22 01:40:59,100 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-22 01:40:59,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:59,107 INFO L225 Difference]: With dead ends: 3043 [2022-11-22 01:40:59,107 INFO L226 Difference]: Without dead ends: 3043 [2022-11-22 01:40:59,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=480, Invalid=2263, Unknown=13, NotChecked=0, Total=2756 [2022-11-22 01:40:59,108 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 896 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 103 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:59,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 0 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1505 Invalid, 14 Unknown, 0 Unchecked, 2.9s Time] [2022-11-22 01:40:59,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2022-11-22 01:40:59,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 1053. [2022-11-22 01:40:59,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 1012 states have (on average 3.91600790513834) internal successors, (3963), 1052 states have internal predecessors, (3963), 0 states have call successors, (0), 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-22 01:40:59,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 3963 transitions. [2022-11-22 01:40:59,141 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 3963 transitions. Word has length 10 [2022-11-22 01:40:59,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:59,141 INFO L495 AbstractCegarLoop]: Abstraction has 1053 states and 3963 transitions. [2022-11-22 01:40:59,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:40:59,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 3963 transitions. [2022-11-22 01:40:59,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 01:40:59,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:59,142 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:59,148 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-11-22 01:40:59,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:59,342 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:40:59,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:59,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1043305501, now seen corresponding path program 2 times [2022-11-22 01:40:59,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:59,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890685667] [2022-11-22 01:40:59,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:59,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:59,771 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-22 01:40:59,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:59,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890685667] [2022-11-22 01:40:59,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890685667] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:59,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698773288] [2022-11-22 01:40:59,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:40:59,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:59,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:59,775 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:59,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-22 01:41:00,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 01:41:00,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:41:00,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-22 01:41:00,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:41:00,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:41:00,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:41:00,270 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 20 treesize of output 22 [2022-11-22 01:41:00,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:41:00,465 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 20 treesize of output 22 [2022-11-22 01:41:00,506 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-22 01:41:00,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:41:00,818 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:41:00,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-11-22 01:41:00,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:41:00,831 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 175 treesize of output 163 [2022-11-22 01:41:00,837 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 146 treesize of output 122 [2022-11-22 01:41:00,843 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 122 treesize of output 110 [2022-11-22 01:41:01,110 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-22 01:41:01,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698773288] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:41:01,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [3579476] [2022-11-22 01:41:01,111 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java: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:336) 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-22 01:41:01,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:41:01,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-22 01:41:01,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813449867] [2022-11-22 01:41:01,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:41:01,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-22 01:41:01,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:41:01,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-22 01:41:01,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=436, Unknown=5, NotChecked=0, Total=506 [2022-11-22 01:41:01,113 INFO L87 Difference]: Start difference. First operand 1053 states and 3963 transitions. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:41:06,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:41:06,305 INFO L93 Difference]: Finished difference Result 2672 states and 7912 transitions. [2022-11-22 01:41:06,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-22 01:41:06,306 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-22 01:41:06,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:41:06,311 INFO L225 Difference]: With dead ends: 2672 [2022-11-22 01:41:06,311 INFO L226 Difference]: Without dead ends: 2672 [2022-11-22 01:41:06,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=439, Invalid=2105, Unknown=6, NotChecked=0, Total=2550 [2022-11-22 01:41:06,312 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 863 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 105 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:41:06,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 0 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1510 Invalid, 6 Unknown, 0 Unchecked, 2.7s Time] [2022-11-22 01:41:06,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2022-11-22 01:41:06,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 987. [2022-11-22 01:41:06,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 946 states have (on average 3.7579281183932345) internal successors, (3555), 986 states have internal predecessors, (3555), 0 states have call successors, (0), 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-22 01:41:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 3555 transitions. [2022-11-22 01:41:06,337 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 3555 transitions. Word has length 10 [2022-11-22 01:41:06,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:41:06,338 INFO L495 AbstractCegarLoop]: Abstraction has 987 states and 3555 transitions. [2022-11-22 01:41:06,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:41:06,338 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 3555 transitions. [2022-11-22 01:41:06,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 01:41:06,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:41:06,339 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 01:41:06,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-22 01:41:06,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-11-22 01:41:06,545 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting thread2Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:41:06,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:41:06,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1267520006, now seen corresponding path program 1 times [2022-11-22 01:41:06,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:41:06,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143024449] [2022-11-22 01:41:06,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:41:06,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:41:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:41:06,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 01:41:06,653 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:41:06,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143024449] [2022-11-22 01:41:06,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143024449] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:41:06,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:41:06,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:41:06,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133219540] [2022-11-22 01:41:06,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:41:06,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:41:06,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:41:06,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:41:06,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:41:06,657 INFO L87 Difference]: Start difference. First operand 987 states and 3555 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-22 01:41:06,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:41:06,718 INFO L93 Difference]: Finished difference Result 909 states and 3265 transitions. [2022-11-22 01:41:06,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:41:06,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 10 [2022-11-22 01:41:06,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:41:06,721 INFO L225 Difference]: With dead ends: 909 [2022-11-22 01:41:06,722 INFO L226 Difference]: Without dead ends: 909 [2022-11-22 01:41:06,723 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-22 01:41:06,725 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:41:06,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:41:06,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2022-11-22 01:41:06,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 909. [2022-11-22 01:41:06,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 875 states have (on average 3.7314285714285713) internal successors, (3265), 908 states have internal predecessors, (3265), 0 states have call successors, (0), 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-22 01:41:06,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 3265 transitions. [2022-11-22 01:41:06,744 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 3265 transitions. Word has length 10 [2022-11-22 01:41:06,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:41:06,745 INFO L495 AbstractCegarLoop]: Abstraction has 909 states and 3265 transitions. [2022-11-22 01:41:06,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-22 01:41:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 3265 transitions. [2022-11-22 01:41:06,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 01:41:06,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:41:06,746 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 01:41:06,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-22 01:41:06,747 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:41:06,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:41:06,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1267520035, now seen corresponding path program 2 times [2022-11-22 01:41:06,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:41:06,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842987021] [2022-11-22 01:41:06,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:41:06,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:41:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:41:07,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:41:07,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:41:07,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842987021] [2022-11-22 01:41:07,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842987021] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:41:07,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872101434] [2022-11-22 01:41:07,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:41:07,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:41:07,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:41:07,022 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:41:07,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-22 01:41:07,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 01:41:07,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:41:07,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-22 01:41:07,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:41:08,196 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:41:08,196 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 478 treesize of output 402 [2022-11-22 01:41:08,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:41:08,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:41:09,517 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-22 01:41:09,518 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 693 treesize of output 581 [2022-11-22 01:41:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:41:10,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872101434] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:41:10,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1831732514] [2022-11-22 01:41:10,015 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:336) 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-22 01:41:10,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:41:10,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-22 01:41:10,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962699490] [2022-11-22 01:41:10,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:41:10,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-22 01:41:10,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:41:10,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-22 01:41:10,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2022-11-22 01:41:10,016 INFO L87 Difference]: Start difference. First operand 909 states and 3265 transitions. Second operand has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:41:10,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:41:10,984 INFO L93 Difference]: Finished difference Result 987 states and 3280 transitions. [2022-11-22 01:41:10,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 01:41:10,985 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-22 01:41:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:41:10,987 INFO L225 Difference]: With dead ends: 987 [2022-11-22 01:41:10,988 INFO L226 Difference]: Without dead ends: 973 [2022-11-22 01:41:10,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2022-11-22 01:41:10,988 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 305 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:41:10,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 0 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 01:41:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2022-11-22 01:41:11,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 895. [2022-11-22 01:41:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 861 states have (on average 3.602787456445993) internal successors, (3102), 894 states have internal predecessors, (3102), 0 states have call successors, (0), 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-22 01:41:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 3102 transitions. [2022-11-22 01:41:11,008 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 3102 transitions. Word has length 10 [2022-11-22 01:41:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:41:11,009 INFO L495 AbstractCegarLoop]: Abstraction has 895 states and 3102 transitions. [2022-11-22 01:41:11,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:41:11,009 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 3102 transitions. [2022-11-22 01:41:11,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 01:41:11,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:41:11,010 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:41:11,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-22 01:41:11,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:41:11,217 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:41:11,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:41:11,217 INFO L85 PathProgramCache]: Analyzing trace with hash -998649979, now seen corresponding path program 1 times [2022-11-22 01:41:11,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:41:11,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299614014] [2022-11-22 01:41:11,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:41:11,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:41:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:41:11,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:41:11,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:41:11,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299614014] [2022-11-22 01:41:11,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299614014] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:41:11,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500828531] [2022-11-22 01:41:11,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:41:11,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:41:11,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:41:11,489 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:41:11,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-22 01:41:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:41:11,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-22 01:41:11,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:41:12,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:41:12,074 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 34 treesize of output 34 [2022-11-22 01:41:12,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-22 01:41:12,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:41:12,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:41:12,128 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1156 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1156) c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) 2147483648))) is different from false [2022-11-22 01:41:12,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 327 treesize of output 287 [2022-11-22 01:41:12,527 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 11 treesize of output 5 [2022-11-22 01:41:12,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:41:12,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500828531] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:41:12,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1252621452] [2022-11-22 01:41:12,694 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:336) 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-22 01:41:12,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:41:12,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-11-22 01:41:12,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282942661] [2022-11-22 01:41:12,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:41:12,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-22 01:41:12,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:41:12,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-22 01:41:12,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2022-11-22 01:41:12,698 INFO L87 Difference]: Start difference. First operand 895 states and 3102 transitions. Second operand has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 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-22 01:41:13,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:41:13,115 INFO L93 Difference]: Finished difference Result 1354 states and 4304 transitions. [2022-11-22 01:41:13,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 01:41:13,115 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 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 10 [2022-11-22 01:41:13,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:41:13,118 INFO L225 Difference]: With dead ends: 1354 [2022-11-22 01:41:13,118 INFO L226 Difference]: Without dead ends: 1354 [2022-11-22 01:41:13,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=246, Unknown=1, NotChecked=34, Total=380 [2022-11-22 01:41:13,119 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 201 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:41:13,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 0 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 178 Invalid, 0 Unknown, 78 Unchecked, 0.3s Time] [2022-11-22 01:41:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2022-11-22 01:41:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1020. [2022-11-22 01:41:13,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 986 states have (on average 3.63184584178499) internal successors, (3581), 1019 states have internal predecessors, (3581), 0 states have call successors, (0), 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-22 01:41:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 3581 transitions. [2022-11-22 01:41:13,136 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 3581 transitions. Word has length 10 [2022-11-22 01:41:13,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:41:13,137 INFO L495 AbstractCegarLoop]: Abstraction has 1020 states and 3581 transitions. [2022-11-22 01:41:13,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 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-22 01:41:13,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 3581 transitions. [2022-11-22 01:41:13,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 01:41:13,137 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:41:13,138 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:41:13,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-22 01:41:13,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-11-22 01:41:13,340 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:41:13,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:41:13,340 INFO L85 PathProgramCache]: Analyzing trace with hash -998649974, now seen corresponding path program 1 times [2022-11-22 01:41:13,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:41:13,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769141732] [2022-11-22 01:41:13,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:41:13,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:41:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:41:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:41:13,668 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:41:13,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769141732] [2022-11-22 01:41:13,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769141732] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:41:13,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473881538] [2022-11-22 01:41:13,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:41:13,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:41:13,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:41:13,669 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:41:13,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-22 01:41:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:41:13,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-22 01:41:13,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:41:14,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:41:14,185 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 34 treesize of output 34 [2022-11-22 01:41:14,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:41:14,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:41:16,593 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-22 01:41:16,594 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 409 treesize of output 352 [2022-11-22 01:41:16,626 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-22 01:41:16,626 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 74 treesize of output 50 [2022-11-22 01:41:16,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:41:16,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473881538] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:41:16,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [103258064] [2022-11-22 01:41:16,979 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:336) 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-22 01:41:16,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:41:16,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-11-22 01:41:16,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135258637] [2022-11-22 01:41:16,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:41:16,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-22 01:41:16,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:41:16,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-22 01:41:16,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=190, Unknown=1, NotChecked=0, Total=240 [2022-11-22 01:41:16,982 INFO L87 Difference]: Start difference. First operand 1020 states and 3581 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:41:17,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:41:17,655 INFO L93 Difference]: Finished difference Result 1522 states and 4720 transitions. [2022-11-22 01:41:17,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 01:41:17,656 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-22 01:41:17,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:41:17,659 INFO L225 Difference]: With dead ends: 1522 [2022-11-22 01:41:17,659 INFO L226 Difference]: Without dead ends: 1522 [2022-11-22 01:41:17,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=125, Invalid=380, Unknown=1, NotChecked=0, Total=506 [2022-11-22 01:41:17,660 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 239 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:41:17,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 0 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 01:41:17,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2022-11-22 01:41:17,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 856. [2022-11-22 01:41:17,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 822 states have (on average 3.610705596107056) internal successors, (2968), 855 states have internal predecessors, (2968), 0 states have call successors, (0), 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-22 01:41:17,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 2968 transitions. [2022-11-22 01:41:17,682 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 2968 transitions. Word has length 10 [2022-11-22 01:41:17,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:41:17,683 INFO L495 AbstractCegarLoop]: Abstraction has 856 states and 2968 transitions. [2022-11-22 01:41:17,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:41:17,683 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 2968 transitions. [2022-11-22 01:41:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 01:41:17,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:41:17,684 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:41:17,696 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-22 01:41:17,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-11-22 01:41:17,891 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:41:17,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:41:17,891 INFO L85 PathProgramCache]: Analyzing trace with hash 853870439, now seen corresponding path program 3 times [2022-11-22 01:41:17,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:41:17,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203902742] [2022-11-22 01:41:17,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:41:17,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:41:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:41:18,647 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:41:18,648 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:41:18,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203902742] [2022-11-22 01:41:18,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203902742] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:41:18,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609429527] [2022-11-22 01:41:18,648 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:41:18,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:41:18,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:41:18,659 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:41:18,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-22 01:41:18,996 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:41:18,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:41:18,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-22 01:41:19,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:41:19,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:41:19,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:41:19,132 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 25 treesize of output 24 [2022-11-22 01:41:19,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:41:19,194 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 25 treesize of output 24 [2022-11-22 01:41:19,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:41:19,243 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 16 treesize of output 18 [2022-11-22 01:41:19,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:41:19,316 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 16 treesize of output 18 [2022-11-22 01:41:19,626 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:41:19,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:41:20,546 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1240 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1240) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1241) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 .cse0) (< (select .cse1 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (< (+ .cse0 2147483648) 0))))) is different from false [2022-11-22 01:41:20,817 INFO L321 Elim1Store]: treesize reduction 94, result has 28.2 percent of original size [2022-11-22 01:41:20,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 80 [2022-11-22 01:41:20,836 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:41:20,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 383 treesize of output 367 [2022-11-22 01:41:20,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:41:20,848 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 344 treesize of output 328 [2022-11-22 01:41:20,862 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:41:20,862 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 328 treesize of output 296 [2022-11-22 01:41:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-22 01:41:21,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609429527] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:41:21,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1508603181] [2022-11-22 01:41:21,398 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:336) 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-22 01:41:21,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:41:21,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-22 01:41:21,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796934270] [2022-11-22 01:41:21,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:41:21,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-22 01:41:21,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:41:21,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-22 01:41:21,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=506, Unknown=22, NotChecked=46, Total=650 [2022-11-22 01:41:21,400 INFO L87 Difference]: Start difference. First operand 856 states and 2968 transitions. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-22 01:41:24,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:41:24,573 INFO L93 Difference]: Finished difference Result 1746 states and 5240 transitions. [2022-11-22 01:41:24,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-22 01:41:24,574 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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 11 [2022-11-22 01:41:24,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:41:24,577 INFO L225 Difference]: With dead ends: 1746 [2022-11-22 01:41:24,577 INFO L226 Difference]: Without dead ends: 1746 [2022-11-22 01:41:24,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=324, Invalid=1637, Unknown=23, NotChecked=86, Total=2070 [2022-11-22 01:41:24,580 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 975 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:41:24,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 0 Invalid, 1917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1634 Invalid, 0 Unknown, 210 Unchecked, 1.7s Time] [2022-11-22 01:41:24,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2022-11-22 01:41:24,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 772. [2022-11-22 01:41:24,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 738 states have (on average 3.5826558265582658) internal successors, (2644), 771 states have internal predecessors, (2644), 0 states have call successors, (0), 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-22 01:41:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 2644 transitions. [2022-11-22 01:41:24,596 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 2644 transitions. Word has length 11 [2022-11-22 01:41:24,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:41:24,596 INFO L495 AbstractCegarLoop]: Abstraction has 772 states and 2644 transitions. [2022-11-22 01:41:24,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-22 01:41:24,596 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 2644 transitions. [2022-11-22 01:41:24,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 01:41:24,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:41:24,596 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 01:41:24,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-22 01:41:24,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:41:24,797 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:41:24,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:41:24,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1071811578, now seen corresponding path program 4 times [2022-11-22 01:41:24,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:41:24,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919228532] [2022-11-22 01:41:24,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:41:24,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:41:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:41:25,472 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:41:25,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:41:25,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919228532] [2022-11-22 01:41:25,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919228532] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:41:25,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109437751] [2022-11-22 01:41:25,473 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 01:41:25,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:41:25,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:41:25,474 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:41:25,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-22 01:41:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:41:25,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-22 01:41:25,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:41:25,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:41:25,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:41:25,990 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 16 treesize of output 18 [2022-11-22 01:41:26,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:41:26,044 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 16 treesize of output 18 [2022-11-22 01:41:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:41:26,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:41:29,142 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (* c_~j~0 4))) (let ((.cse3 (+ c_~A~0.offset 8 .cse12)) (.cse4 (+ c_~A~0.offset .cse12)) (.cse5 (+ c_~A~0.offset .cse12 4))) (and (or (not (<= c_~bag2~0 4294967295)) (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (forall ((v_ArrVal_1283 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1283) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse5)) (.cse0 (select .cse2 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (not (<= (+ c_~bag2~0 .cse0 c_~sum2~0) 2147483647)) (not (<= .cse1 4294967295)) (not (<= (+ .cse1 .cse0) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse0 c_~sum2~0 2147483648))) (not (<= 0 (+ .cse1 .cse0 2147483648))) (< (select .cse2 .cse3) 4294967296))))) (forall ((v_ArrVal_1283 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1283) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse5)) (.cse6 (select .cse8 .cse4))) (or (not (<= (+ c_~bag2~0 .cse6) 2147483647)) (< c_~bag2~0 (+ .cse7 1)) (not (<= 0 (+ .cse7 .cse6 2147483648))) (not (<= .cse6 4294967295)) (< (select .cse8 .cse3) 4294967296))))))) (forall ((v_ArrVal_1283 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1283) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse5)) (.cse9 (select .cse11 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse9 2147483648))) (not (<= 0 (+ .cse10 c_~bag2~0 .cse9 2147483648))) (not (<= (+ c_~bag2~0 .cse9) 2147483647)) (< 4294967295 .cse9) (not (<= (+ .cse10 c_~bag2~0 .cse9) 2147483647)) (< (select .cse11 .cse3) 4294967296) (< (+ 9223372039002259455 .cse9) 0)))))))) is different from false [2022-11-22 01:41:29,299 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1282) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1283) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (select .cse0 .cse4))) (or (< (select .cse0 .cse1) 4294967296) (< (+ .cse2 2147483648) 0) (< 2147483647 (+ .cse2 .cse3)) (< 2147483647 .cse2) (< (+ .cse2 .cse3 2147483648) 0))))) (forall ((v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1282) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1283) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (select .cse5 .cse4))) (or (< (select .cse5 .cse1) 4294967296) (< 0 (+ .cse6 1)) (< 2147483647 .cse7) (< (+ .cse7 .cse6 2147483648) 0))))) (forall ((v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1282) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1283) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse10 (select .cse8 .cse4)) (.cse9 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select .cse8 .cse1) 4294967296) (not (<= (+ .cse9 .cse10) 2147483647)) (not (<= .cse9 2147483647)) (not (<= 0 (+ .cse9 .cse10 2147483648))) (not (<= 0 (+ .cse9 2147483648))))))))) is different from false [2022-11-22 01:41:29,329 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:41:29,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 505 treesize of output 290 [2022-11-22 01:41:29,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:41:29,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1728 treesize of output 1588 [2022-11-22 01:41:29,405 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:41:29,406 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 1554 treesize of output 1514 [2022-11-22 01:41:29,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:41:29,444 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 1514 treesize of output 1434 [2022-11-22 01:41:29,481 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:41:29,482 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 1434 treesize of output 1402 [2022-11-22 01:41:29,523 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:41:29,524 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 1402 treesize of output 1386 [2022-11-22 01:41:29,593 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:41:29,594 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 1386 treesize of output 1346 [2022-11-22 01:41:29,630 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:41:29,630 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 1346 treesize of output 1266 [2022-11-22 01:41:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-22 01:41:30,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109437751] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:41:30,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [238050948] [2022-11-22 01:41:30,335 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:336) 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-22 01:41:30,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:41:30,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-22 01:41:30,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371376365] [2022-11-22 01:41:30,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:41:30,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-22 01:41:30,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:41:30,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-22 01:41:30,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=492, Unknown=2, NotChecked=90, Total=650 [2022-11-22 01:41:30,337 INFO L87 Difference]: Start difference. First operand 772 states and 2644 transitions. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-22 01:41:36,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:41:36,357 INFO L93 Difference]: Finished difference Result 1624 states and 5172 transitions. [2022-11-22 01:41:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-22 01:41:36,358 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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 11 [2022-11-22 01:41:36,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:41:36,362 INFO L225 Difference]: With dead ends: 1624 [2022-11-22 01:41:36,362 INFO L226 Difference]: Without dead ends: 1624 [2022-11-22 01:41:36,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=340, Invalid=2116, Unknown=2, NotChecked=194, Total=2652 [2022-11-22 01:41:36,364 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 938 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1844 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 530 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:41:36,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 0 Invalid, 2457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1844 Invalid, 0 Unknown, 530 Unchecked, 2.1s Time] [2022-11-22 01:41:36,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2022-11-22 01:41:36,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 894. [2022-11-22 01:41:36,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 860 states have (on average 3.8197674418604652) internal successors, (3285), 893 states have internal predecessors, (3285), 0 states have call successors, (0), 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-22 01:41:36,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 3285 transitions. [2022-11-22 01:41:36,385 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 3285 transitions. Word has length 11 [2022-11-22 01:41:36,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:41:36,385 INFO L495 AbstractCegarLoop]: Abstraction has 894 states and 3285 transitions. [2022-11-22 01:41:36,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-22 01:41:36,385 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 3285 transitions. [2022-11-22 01:41:36,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 01:41:36,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:41:36,386 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 01:41:36,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-22 01:41:36,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-11-22 01:41:36,586 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:41:36,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:41:36,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1071811495, now seen corresponding path program 3 times [2022-11-22 01:41:36,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:41:36,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386749196] [2022-11-22 01:41:36,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:41:36,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:41:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:41:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:41:37,404 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:41:37,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386749196] [2022-11-22 01:41:37,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386749196] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:41:37,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400335417] [2022-11-22 01:41:37,405 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:41:37,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:41:37,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:41:37,406 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:41:37,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-22 01:41:37,756 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:41:37,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:41:37,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-22 01:41:37,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:41:37,775 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 14 treesize of output 12 [2022-11-22 01:41:37,847 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 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-22 01:41:37,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-22 01:41:37,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-22 01:41:38,058 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 19 treesize of output 21 [2022-11-22 01:41:38,806 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:41:38,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 490 treesize of output 425 [2022-11-22 01:41:39,457 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:41:39,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:41:41,049 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_~j~0 4))) (let ((.cse0 (not (< (+ 2 c_~j~0) c_~N~0))) (.cse4 (+ c_~A~0.offset .cse9)) (.cse5 (+ c_~A~0.offset .cse9 4))) (and (or .cse0 (forall ((v_ArrVal_1329 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1329) c_~A~0.base))) (let ((.cse2 (select .cse3 .cse5)) (.cse1 (select .cse3 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse1 2147483648))) (< .cse2 2147483648) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse1) 2147483647)) (not (<= (+ c_~bag2~0 .cse2 .cse1) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse1 2147483648))) (< 4294967295 .cse1) (< (+ 9223372039002259455 .cse1) 0)))))) (or (not (<= c_~bag2~0 4294967295)) .cse0 (forall ((v_ArrVal_1329 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1329) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse5)) (.cse7 (select .cse8 .cse4))) (or (< 4294967295 .cse6) (not (<= 0 (+ c_~bag2~0 .cse7 2147483648))) (< .cse6 2147483648) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse7 2147483648))) (not (<= (+ .cse6 .cse7) 2147483647)) (not (<= (+ c_~bag2~0 .cse7) 2147483647)))))) (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)))))) is different from false [2022-11-22 01:41:41,504 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:41:41,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 287 treesize of output 187 [2022-11-22 01:41:41,516 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 314 treesize of output 293 [2022-11-22 01:41:41,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:41:41,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 650 treesize of output 622 [2022-11-22 01:41:41,559 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 591 treesize of output 543 [2022-11-22 01:41:41,571 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 543 treesize of output 519 [2022-11-22 01:41:41,583 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 519 treesize of output 495 [2022-11-22 01:41:41,608 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:41:41,608 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 537 treesize of output 527 [2022-11-22 01:41:41,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:41:41,628 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 483 treesize of output 471 [2022-11-22 01:41:42,309 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:41:42,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400335417] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:41:42,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [38837625] [2022-11-22 01:41:42,310 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:336) 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-22 01:41:42,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:41:42,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-22 01:41:42,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708475437] [2022-11-22 01:41:42,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:41:42,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-22 01:41:42,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:41:42,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-22 01:41:42,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=501, Unknown=1, NotChecked=46, Total=650 [2022-11-22 01:41:42,312 INFO L87 Difference]: Start difference. First operand 894 states and 3285 transitions. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-22 01:41:48,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:41:48,033 INFO L93 Difference]: Finished difference Result 1650 states and 5365 transitions. [2022-11-22 01:41:48,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-22 01:41:48,034 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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 11 [2022-11-22 01:41:48,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:41:48,039 INFO L225 Difference]: With dead ends: 1650 [2022-11-22 01:41:48,039 INFO L226 Difference]: Without dead ends: 1650 [2022-11-22 01:41:48,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=540, Invalid=1717, Unknown=3, NotChecked=92, Total=2352 [2022-11-22 01:41:48,040 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1263 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 92 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-22 01:41:48,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1263 Valid, 0 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1001 Invalid, 4 Unknown, 79 Unchecked, 1.9s Time] [2022-11-22 01:41:48,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2022-11-22 01:41:48,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1002. [2022-11-22 01:41:48,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 968 states have (on average 3.8357438016528924) internal successors, (3713), 1001 states have internal predecessors, (3713), 0 states have call successors, (0), 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-22 01:41:48,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 3713 transitions. [2022-11-22 01:41:48,070 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 3713 transitions. Word has length 11 [2022-11-22 01:41:48,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:41:48,070 INFO L495 AbstractCegarLoop]: Abstraction has 1002 states and 3713 transitions. [2022-11-22 01:41:48,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-22 01:41:48,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 3713 transitions. [2022-11-22 01:41:48,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 01:41:48,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:41:48,071 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 01:41:48,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-11-22 01:41:48,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-11-22 01:41:48,279 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:41:48,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:41:48,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1071811489, now seen corresponding path program 1 times [2022-11-22 01:41:48,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:41:48,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515449929] [2022-11-22 01:41:48,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:41:48,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:41:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:41:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:41:49,107 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:41:49,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515449929] [2022-11-22 01:41:49,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515449929] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:41:49,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693289417] [2022-11-22 01:41:49,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:41:49,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:41:49,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:41:49,109 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:41:49,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-22 01:41:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:41:49,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-22 01:41:49,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:41:49,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:41:49,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:41:49,647 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 27 treesize of output 26 [2022-11-22 01:41:49,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:41:49,710 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 18 treesize of output 20 [2022-11-22 01:41:49,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:41:49,767 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 18 treesize of output 20 [2022-11-22 01:41:50,687 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:41:50,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:41:52,392 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1372 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1373) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse3 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse0 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (select .cse3 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (<= .cse0 2147483647)) (<= 0 (+ .cse1 .cse2 2147483648)) (< .cse1 0) (not (<= 0 (+ .cse0 .cse2 2147483648))))))) is different from false [2022-11-22 01:41:52,415 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1370 Int) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1372 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1370)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1373) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse3 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse2 (select .cse3 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse0 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse0 .cse1 2147483648))) (< .cse2 0) (<= 0 (+ .cse1 2147483648 .cse2)) (not (<= .cse0 2147483647)))))) is different from false [2022-11-22 01:41:52,445 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-22 01:41:52,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 203 treesize of output 113 [2022-11-22 01:41:52,468 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:41:52,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 304 treesize of output 294 [2022-11-22 01:41:52,481 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:41:52,481 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 259 treesize of output 219 [2022-11-22 01:41:52,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:41:52,496 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 171 treesize of output 151 [2022-11-22 01:41:53,290 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-22 01:41:53,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693289417] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:41:53,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1201864442] [2022-11-22 01:41:53,291 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:336) 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-22 01:41:53,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:41:53,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-22 01:41:53,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328359332] [2022-11-22 01:41:53,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:41:53,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-22 01:41:53,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:41:53,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-22 01:41:53,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=472, Unknown=3, NotChecked=90, Total=650 [2022-11-22 01:41:53,292 INFO L87 Difference]: Start difference. First operand 1002 states and 3713 transitions. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-22 01:42:17,942 WARN L233 SmtUtils]: Spent 20.53s on a formula simplification. DAG size of input: 96 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:42:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:42:18,704 INFO L93 Difference]: Finished difference Result 1392 states and 4699 transitions. [2022-11-22 01:42:18,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-22 01:42:18,704 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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 11 [2022-11-22 01:42:18,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:42:18,707 INFO L225 Difference]: With dead ends: 1392 [2022-11-22 01:42:18,708 INFO L226 Difference]: Without dead ends: 1392 [2022-11-22 01:42:18,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=268, Invalid=1219, Unknown=3, NotChecked=150, Total=1640 [2022-11-22 01:42:18,709 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 433 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 214 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:42:18,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 0 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 827 Invalid, 0 Unknown, 214 Unchecked, 1.3s Time] [2022-11-22 01:42:18,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2022-11-22 01:42:18,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1068. [2022-11-22 01:42:18,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 1034 states have (on average 3.855899419729207) internal successors, (3987), 1067 states have internal predecessors, (3987), 0 states have call successors, (0), 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-22 01:42:18,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 3987 transitions. [2022-11-22 01:42:18,726 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 3987 transitions. Word has length 11 [2022-11-22 01:42:18,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:42:18,726 INFO L495 AbstractCegarLoop]: Abstraction has 1068 states and 3987 transitions. [2022-11-22 01:42:18,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-22 01:42:18,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 3987 transitions. [2022-11-22 01:42:18,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 01:42:18,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:42:18,727 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 01:42:18,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-22 01:42:18,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-11-22 01:42:18,927 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:42:18,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:42:18,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1071811599, now seen corresponding path program 2 times [2022-11-22 01:42:18,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:42:18,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987146862] [2022-11-22 01:42:18,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:42:18,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:42:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:42:19,586 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:42:19,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:42:19,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987146862] [2022-11-22 01:42:19,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987146862] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:42:19,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121339048] [2022-11-22 01:42:19,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:42:19,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:42:19,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:42:19,588 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:42:19,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-22 01:42:19,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-22 01:42:19,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:42:19,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-22 01:42:19,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:42:20,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:42:20,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:42:20,145 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 18 treesize of output 20 [2022-11-22 01:42:20,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:42:20,225 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 18 treesize of output 20 [2022-11-22 01:42:21,229 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:42:21,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:42:23,818 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (* c_~j~0 4))) (let ((.cse3 (+ c_~A~0.offset 8 .cse18)) (.cse4 (+ c_~A~0.offset .cse18)) (.cse5 (+ c_~A~0.offset .cse18 4))) (and (forall ((v_ArrVal_1415 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1415) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse5)) (.cse0 (select .cse2 .cse4))) (or (not (<= .cse0 4294967295)) (< (+ 9223372039002259455 .cse0) 0) (not (<= (+ c_~bag2~0 .cse1 .cse0) 2147483647)) (< 0 (+ (select .cse2 .cse3) 9223372039002259456)) (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse0))) (not (<= 0 (+ c_~bag2~0 .cse1 2147483648 .cse0))))))) (or (not (<= c_~bag2~0 4294967295)) (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (forall ((v_ArrVal_1415 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1415) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse5)) (.cse7 (select .cse8 .cse4))) (or (not (<= 0 (+ .cse6 2147483648 .cse7))) (< 0 (+ (select .cse8 .cse3) 9223372039002259456)) (< c_~bag2~0 (+ .cse6 1)) (not (<= (+ c_~bag2~0 .cse7) 2147483647)) (not (<= .cse7 0)))))) (forall ((v_ArrVal_1415 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1415) c_~A~0.base))) (let ((.cse9 (select .cse11 .cse5)) (.cse10 (select .cse11 .cse4))) (or (not (<= 0 (+ .cse9 2147483648 .cse10))) (< 0 (+ (select .cse11 .cse3) 9223372039002259456)) (not (<= .cse9 4294967295)) (not (<= (+ c_~bag2~0 .cse10) 2147483647)) (not (<= (+ .cse9 .cse10) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse10))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse10))) (not (<= .cse10 0)))))) (forall ((v_ArrVal_1415 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1415) c_~A~0.base))) (let ((.cse13 (select .cse14 .cse5)) (.cse12 (select .cse14 .cse4))) (or (<= .cse12 0) (not (<= 0 (+ .cse13 2147483648 .cse12))) (< 0 (+ (select .cse14 .cse3) 9223372039002259456)) (not (<= (+ c_~bag2~0 .cse12) 2147483647)) (not (<= (+ .cse13 .cse12) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse12) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse12))))))) (forall ((v_ArrVal_1415 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1415) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse5)) (.cse15 (select .cse17 .cse4))) (or (not (<= .cse15 4294967295)) (<= .cse15 0) (not (<= 0 (+ .cse16 2147483648 .cse15))) (< 0 (+ (select .cse17 .cse3) 9223372039002259456)) (< c_~bag2~0 (+ .cse16 1)) (not (<= (+ c_~bag2~0 .cse15) 2147483647))))))))))) is different from false [2022-11-22 01:42:24,112 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1414 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1414) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse2 (select .cse0 .cse4)) (.cse3 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ (select .cse0 .cse1) 9223372039002259456)) (< 0 (+ .cse2 1)) (< (+ .cse2 .cse3 2147483648) 0) (< 2147483647 .cse3) (<= .cse3 0))))) (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1414 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1414) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse7 (select .cse6 .cse4)) (.cse5 (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse5 2147483648) 0) (< 0 (+ (select .cse6 .cse1) 9223372039002259456)) (< 2147483647 (+ .cse7 .cse5)) (< (+ .cse7 .cse5 2147483648) 0) (< 0 .cse5))))) (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1414 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1414) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse10 (select .cse9 .cse4)) (.cse8 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse8 2147483648) 0) (< 0 (+ (select .cse9 .cse1) 9223372039002259456)) (< 2147483647 (+ .cse10 .cse8)) (< (+ .cse10 .cse8 2147483648) 0) (< 2147483647 .cse8))))) (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1414 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1414) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse12 (select .cse11 .cse4)) (.cse13 (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ (select .cse11 .cse1) 9223372039002259456)) (< 2147483647 (+ .cse12 .cse13)) (< (+ .cse12 .cse13 2147483648) 0) (< 2147483647 .cse13) (<= .cse13 0))))) (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1414 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1414) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse15 (select .cse14 .cse4)) (.cse16 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ (select .cse14 .cse1) 9223372039002259456)) (< 0 (+ .cse15 1)) (< (+ .cse15 .cse16 2147483648) 0) (< 0 .cse16))))))) is different from false [2022-11-22 01:42:24,156 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:42:24,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 851 treesize of output 480 [2022-11-22 01:42:24,202 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:42:24,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2300 treesize of output 2104 [2022-11-22 01:42:24,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:42:24,253 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 2068 treesize of output 2028 [2022-11-22 01:42:24,303 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:42:24,304 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 2028 treesize of output 1948 [2022-11-22 01:42:24,353 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:42:24,354 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 1948 treesize of output 1912 [2022-11-22 01:42:24,403 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:42:24,404 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 1912 treesize of output 1894 [2022-11-22 01:42:24,454 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:42:24,455 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 1894 treesize of output 1854 [2022-11-22 01:42:24,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:42:24,507 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 1854 treesize of output 1834 [2022-11-22 01:42:24,556 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:42:24,557 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 1834 treesize of output 1794 [2022-11-22 01:42:24,605 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:42:24,606 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 1794 treesize of output 1774 [2022-11-22 01:42:24,655 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:42:24,656 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 1774 treesize of output 1742 [2022-11-22 01:42:24,705 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:42:24,706 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 1742 treesize of output 1678 [2022-11-22 01:42:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-22 01:42:25,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121339048] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:42:25,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1908158566] [2022-11-22 01:42:25,807 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:336) 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-22 01:42:25,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:42:25,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-22 01:42:25,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94570264] [2022-11-22 01:42:25,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:42:25,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-22 01:42:25,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:42:25,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-22 01:42:25,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=491, Unknown=2, NotChecked=90, Total=650 [2022-11-22 01:42:25,809 INFO L87 Difference]: Start difference. First operand 1068 states and 3987 transitions. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-22 01:42:32,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:42:32,747 INFO L93 Difference]: Finished difference Result 1392 states and 4387 transitions. [2022-11-22 01:42:32,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-22 01:42:32,748 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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 11 [2022-11-22 01:42:32,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:42:32,751 INFO L225 Difference]: With dead ends: 1392 [2022-11-22 01:42:32,751 INFO L226 Difference]: Without dead ends: 1392 [2022-11-22 01:42:32,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=341, Invalid=2115, Unknown=2, NotChecked=194, Total=2652 [2022-11-22 01:42:32,751 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 827 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2307 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 466 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:42:32,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 0 Invalid, 2836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2307 Invalid, 0 Unknown, 466 Unchecked, 2.6s Time] [2022-11-22 01:42:32,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2022-11-22 01:42:32,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1034. [2022-11-22 01:42:32,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1000 states have (on average 3.676) internal successors, (3676), 1033 states have internal predecessors, (3676), 0 states have call successors, (0), 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-22 01:42:32,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 3676 transitions. [2022-11-22 01:42:32,768 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 3676 transitions. Word has length 11 [2022-11-22 01:42:32,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:42:32,769 INFO L495 AbstractCegarLoop]: Abstraction has 1034 states and 3676 transitions. [2022-11-22 01:42:32,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-22 01:42:32,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 3676 transitions. [2022-11-22 01:42:32,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 01:42:32,770 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:42:32,770 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2022-11-22 01:42:32,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-11-22 01:42:32,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:42:32,971 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:42:32,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:42:32,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1133585572, now seen corresponding path program 2 times [2022-11-22 01:42:32,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:42:32,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434965617] [2022-11-22 01:42:32,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:42:32,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:42:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:42:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:42:33,476 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:42:33,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434965617] [2022-11-22 01:42:33,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434965617] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:42:33,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527633069] [2022-11-22 01:42:33,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:42:33,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:42:33,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:42:33,477 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:42:33,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-11-22 01:42:33,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-22 01:42:33,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:42:33,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-22 01:42:33,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:42:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:42:36,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:42:39,530 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-22 01:42:39,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1249 treesize of output 791 [2022-11-22 01:42:40,417 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:42:40,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527633069] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:42:40,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1478747341] [2022-11-22 01:42:40,418 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:336) 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-22 01:42:40,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:42:40,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-22 01:42:40,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685239512] [2022-11-22 01:42:40,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:42:40,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-22 01:42:40,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:42:40,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-22 01:42:40,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2022-11-22 01:42:40,420 INFO L87 Difference]: Start difference. First operand 1034 states and 3676 transitions. Second operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 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-22 01:42:43,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:42:43,765 INFO L93 Difference]: Finished difference Result 1204 states and 3865 transitions. [2022-11-22 01:42:43,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-22 01:42:43,765 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 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 12 [2022-11-22 01:42:43,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:42:43,768 INFO L225 Difference]: With dead ends: 1204 [2022-11-22 01:42:43,768 INFO L226 Difference]: Without dead ends: 1186 [2022-11-22 01:42:43,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=464, Invalid=1516, Unknown=0, NotChecked=0, Total=1980 [2022-11-22 01:42:43,769 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 930 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:42:43,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 0 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-22 01:42:43,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2022-11-22 01:42:43,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 904. [2022-11-22 01:42:43,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 870 states have (on average 3.527586206896552) internal successors, (3069), 903 states have internal predecessors, (3069), 0 states have call successors, (0), 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-22 01:42:43,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 3069 transitions. [2022-11-22 01:42:43,792 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 3069 transitions. Word has length 12 [2022-11-22 01:42:43,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:42:43,792 INFO L495 AbstractCegarLoop]: Abstraction has 904 states and 3069 transitions. [2022-11-22 01:42:43,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 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-22 01:42:43,792 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 3069 transitions. [2022-11-22 01:42:43,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 01:42:43,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:42:43,793 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:42:43,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-11-22 01:42:44,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:42:44,001 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:42:44,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:42:44,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1880951010, now seen corresponding path program 1 times [2022-11-22 01:42:44,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:42:44,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778628870] [2022-11-22 01:42:44,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:42:44,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:42:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:42:44,408 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:42:44,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:42:44,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778628870] [2022-11-22 01:42:44,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778628870] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:42:44,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698282663] [2022-11-22 01:42:44,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:42:44,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:42:44,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:42:44,411 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:42:44,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-22 01:42:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:42:44,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-22 01:42:44,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:42:45,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2022-11-22 01:42:45,446 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:42:45,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:42:45,980 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-22 01:42:45,981 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 167 treesize of output 1 [2022-11-22 01:42:45,982 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:42:45,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698282663] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:42:45,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [197169158] [2022-11-22 01:42:45,982 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:336) 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-22 01:42:45,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:42:45,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-11-22 01:42:45,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082245502] [2022-11-22 01:42:45,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:42:45,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 01:42:45,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:42:45,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 01:42:45,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-22 01:42:45,985 INFO L87 Difference]: Start difference. First operand 904 states and 3069 transitions. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 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-22 01:42:48,378 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] [2022-11-22 01:42:50,710 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] [2022-11-22 01:42:52,745 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] [2022-11-22 01:42:55,562 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-22 01:42:57,801 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] [2022-11-22 01:42:59,812 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] [2022-11-22 01:43:00,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:43:00,345 INFO L93 Difference]: Finished difference Result 2637 states and 8094 transitions. [2022-11-22 01:43:00,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-22 01:43:00,346 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-22 01:43:00,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:43:00,351 INFO L225 Difference]: With dead ends: 2637 [2022-11-22 01:43:00,352 INFO L226 Difference]: Without dead ends: 2637 [2022-11-22 01:43:00,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=368, Invalid=1192, Unknown=0, NotChecked=0, Total=1560 [2022-11-22 01:43:00,352 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 370 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 48 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:43:00,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 0 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 838 Invalid, 6 Unknown, 0 Unchecked, 13.2s Time] [2022-11-22 01:43:00,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2022-11-22 01:43:00,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 1296. [2022-11-22 01:43:00,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1262 states have (on average 3.6632329635499206) internal successors, (4623), 1295 states have internal predecessors, (4623), 0 states have call successors, (0), 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-22 01:43:00,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 4623 transitions. [2022-11-22 01:43:00,381 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 4623 transitions. Word has length 12 [2022-11-22 01:43:00,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:43:00,381 INFO L495 AbstractCegarLoop]: Abstraction has 1296 states and 4623 transitions. [2022-11-22 01:43:00,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 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-22 01:43:00,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 4623 transitions. [2022-11-22 01:43:00,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 01:43:00,382 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:43:00,382 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:43:00,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-11-22 01:43:00,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:43:00,587 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:43:00,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:43:00,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1880951005, now seen corresponding path program 1 times [2022-11-22 01:43:00,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:43:00,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464904447] [2022-11-22 01:43:00,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:43:00,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:43:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:43:00,795 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:43:00,795 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:43:00,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464904447] [2022-11-22 01:43:00,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464904447] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:43:00,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963732459] [2022-11-22 01:43:00,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:43:00,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:43:00,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:43:00,797 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:43:00,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-11-22 01:43:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:43:01,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-22 01:43:01,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:43:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:43:01,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:43:01,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-11-22 01:43:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:43:01,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963732459] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:43:01,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [237520544] [2022-11-22 01:43:01,505 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:336) 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-22 01:43:01,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:43:01,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-11-22 01:43:01,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916289462] [2022-11-22 01:43:01,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:43:01,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-22 01:43:01,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:43:01,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-22 01:43:01,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2022-11-22 01:43:01,507 INFO L87 Difference]: Start difference. First operand 1296 states and 4623 transitions. Second operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:43:02,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:43:02,034 INFO L93 Difference]: Finished difference Result 1439 states and 4971 transitions. [2022-11-22 01:43:02,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 01:43:02,035 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-22 01:43:02,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:43:02,037 INFO L225 Difference]: With dead ends: 1439 [2022-11-22 01:43:02,038 INFO L226 Difference]: Without dead ends: 1242 [2022-11-22 01:43:02,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2022-11-22 01:43:02,038 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 91 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:43:02,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 0 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:43:02,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2022-11-22 01:43:02,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1242. [2022-11-22 01:43:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 1208 states have (on average 3.697019867549669) internal successors, (4466), 1241 states have internal predecessors, (4466), 0 states have call successors, (0), 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-22 01:43:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 4466 transitions. [2022-11-22 01:43:02,067 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 4466 transitions. Word has length 12 [2022-11-22 01:43:02,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:43:02,067 INFO L495 AbstractCegarLoop]: Abstraction has 1242 states and 4466 transitions. [2022-11-22 01:43:02,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:43:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 4466 transitions. [2022-11-22 01:43:02,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 01:43:02,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:43:02,069 INFO L195 NwaCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 01:43:02,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-11-22 01:43:02,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-11-22 01:43:02,276 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:43:02,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:43:02,276 INFO L85 PathProgramCache]: Analyzing trace with hash -202468135, now seen corresponding path program 4 times [2022-11-22 01:43:02,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:43:02,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226133689] [2022-11-22 01:43:02,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:43:02,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:43:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:43:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:43:03,136 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:43:03,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226133689] [2022-11-22 01:43:03,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226133689] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:43:03,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469282631] [2022-11-22 01:43:03,137 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 01:43:03,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:43:03,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:43:03,138 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:43:03,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-11-22 01:43:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:43:03,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-22 01:43:03,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:43:03,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:43:03,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:43:03,728 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 25 treesize of output 24 [2022-11-22 01:43:03,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:43:03,779 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 25 treesize of output 24 [2022-11-22 01:43:03,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:43:03,824 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 25 treesize of output 24 [2022-11-22 01:43:03,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:43:03,888 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 16 treesize of output 18 [2022-11-22 01:43:03,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:43:03,947 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 16 treesize of output 18 [2022-11-22 01:43:04,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:04,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 450 treesize of output 390 [2022-11-22 01:43:05,113 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:43:05,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:43:06,801 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1568 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1568) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1569) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (select .cse2 .cse3))) (or (not (<= 0 (+ .cse0 2147483648))) (not (<= (+ .cse0 .cse1) 2147483647)) (<= .cse1 2147483647))))) (forall ((v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1568 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1568) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1569) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (select .cse6 .cse3))) (or (< 2147483647 (+ .cse4 .cse5)) (< (+ .cse4 2147483648) 0) (<= .cse5 2147483647))))))) is different from false [2022-11-22 01:43:11,535 INFO L321 Elim1Store]: treesize reduction 203, result has 19.4 percent of original size [2022-11-22 01:43:11,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 192 treesize of output 108 [2022-11-22 01:43:11,556 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:11,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 453 treesize of output 425 [2022-11-22 01:43:11,567 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 344 treesize of output 320 [2022-11-22 01:43:11,580 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:11,580 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 378 treesize of output 330 [2022-11-22 01:43:11,925 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 1 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-22 01:43:11,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469282631] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:43:11,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1543072856] [2022-11-22 01:43:11,925 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:336) 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-22 01:43:11,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:43:11,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-11-22 01:43:11,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621986666] [2022-11-22 01:43:11,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:43:11,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-22 01:43:11,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:43:11,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-22 01:43:11,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=722, Unknown=24, NotChecked=56, Total=930 [2022-11-22 01:43:11,927 INFO L87 Difference]: Start difference. First operand 1242 states and 4466 transitions. Second operand has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 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-22 01:43:14,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:43:14,340 INFO L93 Difference]: Finished difference Result 1728 states and 5461 transitions. [2022-11-22 01:43:14,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-22 01:43:14,341 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 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 13 [2022-11-22 01:43:14,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:43:14,344 INFO L225 Difference]: With dead ends: 1728 [2022-11-22 01:43:14,344 INFO L226 Difference]: Without dead ends: 1728 [2022-11-22 01:43:14,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=442, Invalid=1700, Unknown=24, NotChecked=90, Total=2256 [2022-11-22 01:43:14,345 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 629 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:43:14,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 0 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 886 Invalid, 0 Unknown, 107 Unchecked, 1.3s Time] [2022-11-22 01:43:14,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2022-11-22 01:43:14,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1086. [2022-11-22 01:43:14,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1052 states have (on average 3.6102661596958177) internal successors, (3798), 1085 states have internal predecessors, (3798), 0 states have call successors, (0), 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-22 01:43:14,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 3798 transitions. [2022-11-22 01:43:14,364 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 3798 transitions. Word has length 13 [2022-11-22 01:43:14,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:43:14,364 INFO L495 AbstractCegarLoop]: Abstraction has 1086 states and 3798 transitions. [2022-11-22 01:43:14,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 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-22 01:43:14,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 3798 transitions. [2022-11-22 01:43:14,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 01:43:14,365 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:43:14,365 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2022-11-22 01:43:14,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-11-22 01:43:14,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:43:14,565 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:43:14,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:43:14,566 INFO L85 PathProgramCache]: Analyzing trace with hash 230931399, now seen corresponding path program 5 times [2022-11-22 01:43:14,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:43:14,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908604533] [2022-11-22 01:43:14,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:43:14,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:43:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:43:15,350 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:43:15,350 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:43:15,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908604533] [2022-11-22 01:43:15,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908604533] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:43:15,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165903818] [2022-11-22 01:43:15,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:43:15,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:43:15,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:43:15,352 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:43:15,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-11-22 01:43:15,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-22 01:43:15,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:43:15,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-22 01:43:15,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:43:16,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-22 01:43:16,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:43:16,085 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 19 treesize of output 21 [2022-11-22 01:43:16,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:43:16,162 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 19 treesize of output 21 [2022-11-22 01:43:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:43:18,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:43:24,233 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse53 (* c_~j~0 4)) (.cse48 (+ c_~j~0 3))) (let ((.cse8 (not (< .cse48 c_~N~0))) (.cse4 (+ c_~A~0.offset 12 .cse53)) (.cse5 (+ c_~A~0.offset .cse53 4)) (.cse6 (+ c_~A~0.offset 8 .cse53)) (.cse7 (+ c_~A~0.offset .cse53))) (and (or (forall ((v_ArrVal_1615 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615) c_~A~0.base))) (let ((.cse2 (select .cse3 .cse7)) (.cse1 (select .cse3 .cse6)) (.cse0 (select .cse3 .cse5))) (or (not (<= 0 (+ .cse0 .cse1 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse2 2147483648))) (< 2147483647 (+ .cse0 c_~bag2~0 .cse2)) (not (<= .cse2 4294967295)) (< 2147483647 (+ c_~bag2~0 .cse2 c_~sum2~0)) (< (+ c_~bag2~0 .cse2 c_~sum2~0 2147483648) 0) (< (+ 9223372039002259455 .cse2) 0) (< (select .cse3 .cse4) 4294967296) (< (+ c_~bag2~0 .cse2) (+ .cse1 1)) (< .cse0 1))))) .cse8) (or .cse8 (forall ((v_ArrVal_1615 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615) c_~A~0.base))) (let ((.cse10 (select .cse12 .cse6)) (.cse9 (select .cse12 .cse5)) (.cse11 (select .cse12 .cse7))) (or (not (<= 0 (+ .cse9 c_~bag2~0 .cse10 .cse11 2147483648))) (not (<= (+ c_~bag2~0 .cse11) 2147483647)) (not (<= 0 (+ .cse9 c_~bag2~0 .cse11 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse11 2147483648))) (not (<= .cse11 4294967295)) (< (+ 9223372039002259455 .cse11) 0) (< (select .cse12 .cse4) 4294967296) (not (<= (+ .cse9 c_~bag2~0 .cse10 .cse11) 2147483647)) (not (<= (+ .cse9 c_~bag2~0 .cse11) 2147483647))))))) (or (not (<= c_~bag2~0 4294967295)) (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (let ((.cse39 (<= c_~N~0 .cse48))) (and (or (forall ((v_ArrVal_1615 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse7))) (let ((.cse15 (+ c_~bag2~0 .cse16)) (.cse14 (select .cse17 .cse6)) (.cse13 (select .cse17 .cse5))) (or (not (<= 0 (+ .cse13 .cse14 2147483648))) (not (<= .cse15 2147483647)) (< .cse16 (+ .cse14 1)) (< 2147483647 (+ c_~bag2~0 .cse16 c_~sum2~0)) (< .cse15 (+ .cse13 .cse14 1)) (< (select .cse17 .cse4) 4294967296) (< 2147483647 (+ .cse13 .cse16)) (<= .cse16 0)))))) .cse8) (or (forall ((v_ArrVal_1615 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615) c_~A~0.base))) (let ((.cse19 (select .cse20 .cse7)) (.cse18 (select .cse20 .cse5)) (.cse21 (select .cse20 .cse6))) (or (< c_~bag2~0 (+ .cse18 1)) (not (<= (+ c_~bag2~0 .cse19) 2147483647)) (not (<= .cse19 0)) (not (<= 0 (+ .cse18 .cse19 2147483648))) (< (select .cse20 .cse4) 4294967296) (not (<= 0 (+ .cse18 .cse21 .cse19 2147483648))) (< c_~bag2~0 (+ .cse18 .cse21 1)))))) .cse8) (or (forall ((v_ArrVal_1615 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615) c_~A~0.base))) (let ((.cse23 (select .cse25 .cse6)) (.cse22 (select .cse25 .cse5)) (.cse24 (select .cse25 .cse7))) (or (not (<= 0 (+ .cse22 .cse23 2147483648))) (not (<= 0 (+ .cse22 c_~bag2~0 .cse24 c_~sum2~0 2147483648))) (not (<= (+ c_~bag2~0 .cse24) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse24 2147483648))) (< 2147483647 (+ c_~bag2~0 .cse24 c_~sum2~0)) (not (<= .cse23 4294967295)) (< (select .cse25 .cse4) 4294967296) (not (<= (+ .cse22 c_~bag2~0 .cse24 c_~sum2~0) 2147483647)) (< (+ .cse22 .cse24 2147483648) 0) (not (<= (+ .cse22 .cse23) 2147483647)) (< 2147483647 (+ .cse22 .cse24)) (<= .cse24 0))))) .cse8) (or .cse8 (forall ((v_ArrVal_1615 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615) c_~A~0.base))) (let ((.cse27 (select .cse28 .cse7)) (.cse26 (select .cse28 .cse5)) (.cse29 (select .cse28 .cse6))) (or (< c_~bag2~0 (+ .cse26 1)) (not (<= (+ c_~bag2~0 .cse27) 2147483647)) (not (<= .cse27 4294967295)) (not (<= 0 (+ .cse26 .cse27 2147483648))) (< (select .cse28 .cse4) 4294967296) (not (<= 0 (+ .cse26 .cse29 .cse27 2147483648))) (<= .cse27 0) (< c_~bag2~0 (+ .cse26 .cse29 1))))))) (or (forall ((v_ArrVal_1615 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615) c_~A~0.base))) (let ((.cse33 (select .cse34 .cse7))) (let ((.cse32 (+ c_~bag2~0 .cse33)) (.cse31 (select .cse34 .cse6)) (.cse30 (select .cse34 .cse5))) (or (not (<= 0 (+ .cse30 .cse31 2147483648))) (not (<= .cse32 2147483647)) (not (<= .cse33 0)) (< .cse33 (+ .cse31 1)) (< (+ c_~bag2~0 .cse33 c_~sum2~0 2147483648) 0) (< .cse32 (+ .cse30 .cse31 1)) (< (select .cse34 .cse4) 4294967296) (< 2147483647 (+ .cse30 .cse33)) (< 4294967295 .cse30)))))) .cse8) (or (forall ((v_ArrVal_1615 (Array Int Int))) (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615) c_~A~0.base))) (let ((.cse37 (select .cse38 .cse6)) (.cse35 (select .cse38 .cse5)) (.cse36 (select .cse38 .cse7))) (or (< c_~bag2~0 (+ .cse35 1)) (not (<= (+ c_~bag2~0 .cse36) 2147483647)) (< 2147483647 (+ .cse35 .cse37 .cse36)) (< (+ .cse35 .cse37 .cse36 2147483648) 0) (not (<= .cse36 4294967295)) (not (<= 0 (+ .cse35 .cse36 2147483648))) (< (select .cse38 .cse4) 4294967296) (< 2147483647 (+ .cse35 c_~bag2~0 .cse36 c_~sum2~0)) (< (+ .cse35 c_~bag2~0 .cse36 c_~sum2~0 2147483648) 0) (<= .cse36 0))))) .cse39) (or (forall ((v_ArrVal_1615 (Array Int Int))) (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615) c_~A~0.base))) (let ((.cse41 (select .cse43 .cse6)) (.cse40 (select .cse43 .cse5)) (.cse42 (select .cse43 .cse7))) (or (not (<= 0 (+ .cse40 .cse41 2147483648))) (not (<= 0 (+ .cse40 c_~bag2~0 .cse42 c_~sum2~0 2147483648))) (not (<= (+ c_~bag2~0 .cse42) 2147483647)) (not (<= .cse42 0)) (not (<= 0 (+ c_~bag2~0 .cse42 2147483648))) (< (+ c_~bag2~0 .cse42 c_~sum2~0 2147483648) 0) (< (select .cse43 .cse4) 4294967296) (not (<= (+ .cse40 c_~bag2~0 .cse42 c_~sum2~0) 2147483647)) (< (+ .cse40 .cse42 2147483648) 0) (not (<= (+ .cse40 .cse41) 2147483647)) (< 2147483647 (+ .cse40 .cse42)))))) .cse8) (or .cse39 (forall ((v_ArrVal_1615 (Array Int Int))) (let ((.cse47 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615) c_~A~0.base))) (let ((.cse46 (select .cse47 .cse6)) (.cse44 (select .cse47 .cse5)) (.cse45 (select .cse47 .cse7))) (or (< c_~bag2~0 (+ .cse44 1)) (not (<= (+ c_~bag2~0 .cse45) 2147483647)) (< 2147483647 (+ .cse44 .cse46 .cse45)) (not (<= .cse45 0)) (< (+ .cse44 .cse46 .cse45 2147483648) 0) (not (<= 0 (+ .cse44 .cse45 2147483648))) (< (select .cse47 .cse4) 4294967296) (< 2147483647 (+ .cse44 c_~bag2~0 .cse45 c_~sum2~0)) (< (+ .cse44 c_~bag2~0 .cse45 c_~sum2~0 2147483648) 0))))))))) (or .cse8 (forall ((v_ArrVal_1615 (Array Int Int))) (let ((.cse52 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615) c_~A~0.base))) (let ((.cse51 (select .cse52 .cse7)) (.cse50 (select .cse52 .cse6)) (.cse49 (select .cse52 .cse5))) (or (not (<= 0 (+ .cse49 .cse50 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse51 2147483648))) (< 2147483647 (+ .cse49 c_~bag2~0 .cse51)) (not (<= .cse51 4294967295)) (< (+ c_~bag2~0 .cse51 c_~sum2~0 2147483648) 0) (< (+ 9223372039002259455 .cse51) 0) (< (select .cse52 .cse4) 4294967296) (not (<= (+ .cse49 c_~bag2~0 .cse51 c_~sum2~0) 2147483647)) (not (<= (+ .cse49 .cse50) 2147483647)) (< .cse49 1))))))))) is different from false [2022-11-22 01:43:25,392 WARN L837 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse7 (not (< 3 c_~N~0))) (.cse4 (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse36 (<= c_~N~0 3))) (and (or (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1614 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1614) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (select .cse3 .cse6)) (.cse0 (select .cse3 .cse5))) (or (< (+ .cse0 .cse1 .cse2 2147483648) 0) (< (+ .cse0 .cse2 2147483648) 0) (< (select .cse3 .cse4) 4294967296) (< 0 .cse2) (< 0 (+ .cse0 .cse1 1)) (< 0 (+ .cse0 1)))))) .cse7) (or .cse7 (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1614 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1614) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse9 (select .cse11 .cse6)) (.cse8 (select .cse11 .cse5)) (.cse10 (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 (+ .cse8 .cse9)) (< (+ .cse8 .cse9 2147483648) 0) (< (+ .cse10 2147483648) 0) (< (+ .cse8 .cse10 2147483648) 0) (< (select .cse11 .cse4) 4294967296) (< 0 .cse10) (< 2147483647 (+ .cse8 .cse10))))))) (or (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1614 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1614) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse13 (select .cse15 .cse6)) (.cse12 (select .cse15 .cse5)) (.cse14 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 (+ .cse12 .cse13)) (< (+ .cse12 .cse13 2147483648) 0) (<= .cse14 0) (< 4294967295 .cse13) (< 2147483647 .cse14) (< (+ .cse12 .cse14 2147483648) 0) (< (select .cse15 .cse4) 4294967296) (< 2147483647 (+ .cse12 .cse14)))))) .cse7) (or .cse7 (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1614 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1614) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse17 (select .cse19 .cse6)) (.cse16 (select .cse19 .cse5)) (.cse18 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 (+ .cse16 .cse17)) (< (+ .cse16 .cse17 2147483648) 0) (< (+ .cse18 2147483648) 0) (< .cse16 1) (< (select .cse19 .cse4) 4294967296) (< 2147483647 (+ .cse16 .cse18))))))) (or .cse7 (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1614 (Array Int Int))) (let ((.cse23 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1614) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse21 (select .cse23 .cse6)) (.cse20 (select .cse23 .cse5)) (.cse22 (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse20 .cse21 2147483648) 0) (< .cse22 (+ .cse21 1)) (< (+ .cse22 2147483648) 0) (< .cse20 1) (< (select .cse23 .cse4) 4294967296) (< 2147483647 (+ .cse20 .cse22))))))) (or (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1614 (Array Int Int))) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1614) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse25 (select .cse27 .cse6)) (.cse24 (select .cse27 .cse5)) (.cse26 (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse24 .cse25 2147483648) 0) (< .cse26 (+ .cse25 1)) (< .cse26 (+ .cse24 .cse25 1)) (< (select .cse27 .cse4) 4294967296) (< 0 .cse26) (< 2147483647 (+ .cse24 .cse26)))))) .cse7) (or (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1614 (Array Int Int))) (let ((.cse31 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1614) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse29 (select .cse31 .cse6)) (.cse28 (select .cse31 .cse5)) (.cse30 (select .cse31 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse28 .cse29 2147483648) 0) (<= .cse30 0) (< .cse30 (+ .cse29 1)) (< 2147483647 .cse30) (< .cse30 (+ .cse28 .cse29 1)) (< (select .cse31 .cse4) 4294967296) (< 2147483647 (+ .cse28 .cse30)))))) .cse7) (or (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1614 (Array Int Int))) (let ((.cse35 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1614) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse32 (select .cse35 .cse5)) (.cse33 (select .cse35 .cse6)) (.cse34 (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse32 .cse33 .cse34 2147483648) 0) (< 2147483647 .cse34) (< (+ .cse34 2147483648) 0) (< (+ .cse32 .cse34 2147483648) 0) (< (select .cse35 .cse4) 4294967296) (< 2147483647 (+ .cse32 .cse34)) (< 2147483647 (+ .cse32 .cse33 .cse34)))))) .cse7) (or .cse36 (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1614 (Array Int Int))) (let ((.cse40 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1614) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse38 (select .cse40 .cse6)) (.cse39 (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse37 (select .cse40 .cse5))) (or (< (+ .cse37 .cse38 .cse39 2147483648) 0) (<= .cse39 0) (< 2147483647 .cse39) (< (+ .cse37 .cse39 2147483648) 0) (< (select .cse40 .cse4) 4294967296) (< 2147483647 (+ .cse37 .cse38 .cse39)) (< 0 (+ .cse37 1))))))) (or (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1614 (Array Int Int))) (let ((.cse44 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1614) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse43 (select .cse44 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse42 (select .cse44 .cse6)) (.cse41 (select .cse44 .cse5))) (or (< (+ .cse41 .cse42 .cse43 2147483648) 0) (<= .cse43 0) (< 2147483647 .cse43) (< (+ .cse41 .cse43 2147483648) 0) (< (select .cse44 .cse4) 4294967296) (< 0 (+ .cse41 .cse42 1)) (< 0 (+ .cse41 1)))))) .cse7) (or (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1614 (Array Int Int))) (let ((.cse48 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1614) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1615) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse46 (select .cse48 .cse6)) (.cse47 (select .cse48 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse45 (select .cse48 .cse5))) (or (< (+ .cse45 .cse46 .cse47 2147483648) 0) (< (+ .cse45 .cse47 2147483648) 0) (< (select .cse48 .cse4) 4294967296) (< 0 .cse47) (< 2147483647 (+ .cse45 .cse46 .cse47)) (< 0 (+ .cse45 1)))))) .cse36)))) is different from false [2022-11-22 01:43:25,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:25,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 3211 treesize of output 1772 [2022-11-22 01:43:25,637 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:25,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 8757 treesize of output 7803 [2022-11-22 01:43:25,795 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:25,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7759 treesize of output 7683 [2022-11-22 01:43:25,926 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:25,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7683 treesize of output 7645 [2022-11-22 01:43:26,052 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:26,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7645 treesize of output 7577 [2022-11-22 01:43:26,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:26,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7577 treesize of output 7457 [2022-11-22 01:43:26,344 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:26,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7457 treesize of output 7397 [2022-11-22 01:43:26,475 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:26,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7397 treesize of output 7363 [2022-11-22 01:43:26,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:26,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7363 treesize of output 7291 [2022-11-22 01:43:26,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:26,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7291 treesize of output 7255 [2022-11-22 01:43:26,957 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:26,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7255 treesize of output 7179 [2022-11-22 01:43:27,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:27,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7179 treesize of output 7027 [2022-11-22 01:43:27,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:27,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7027 treesize of output 6963 [2022-11-22 01:43:27,394 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:27,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6963 treesize of output 6835 [2022-11-22 01:43:27,582 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:27,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6835 treesize of output 6755 [2022-11-22 01:43:27,722 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:27,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6755 treesize of output 6595 [2022-11-22 01:43:27,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:27,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6595 treesize of output 6515 [2022-11-22 01:43:27,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:27,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6515 treesize of output 6355 [2022-11-22 01:43:28,180 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:28,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6355 treesize of output 6283 [2022-11-22 01:43:28,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:28,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6283 treesize of output 6247 [2022-11-22 01:43:28,458 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:28,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6247 treesize of output 6103 [2022-11-22 01:43:28,588 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:28,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6103 treesize of output 6031 [2022-11-22 01:43:28,743 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:28,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6031 treesize of output 5959 [2022-11-22 01:43:28,871 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:43:28,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5959 treesize of output 5923 [2022-11-22 01:43:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-22 01:43:38,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165903818] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:43:38,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1475153502] [2022-11-22 01:43:38,441 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:336) 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-22 01:43:38,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:43:38,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-22 01:43:38,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841631342] [2022-11-22 01:43:38,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:43:38,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 01:43:38,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:43:38,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 01:43:38,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=774, Unknown=2, NotChecked=114, Total=992 [2022-11-22 01:43:38,443 INFO L87 Difference]: Start difference. First operand 1086 states and 3798 transitions. Second operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 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-22 01:44:02,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:44:02,663 INFO L93 Difference]: Finished difference Result 3162 states and 10781 transitions. [2022-11-22 01:44:02,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-22 01:44:02,664 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 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 13 [2022-11-22 01:44:02,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:44:02,671 INFO L225 Difference]: With dead ends: 3162 [2022-11-22 01:44:02,671 INFO L226 Difference]: Without dead ends: 3162 [2022-11-22 01:44:02,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=531, Invalid=3635, Unknown=2, NotChecked=254, Total=4422 [2022-11-22 01:44:02,672 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1990 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3653 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1990 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 3653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 437 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:44:02,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1990 Valid, 0 Invalid, 4198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 3653 Invalid, 0 Unknown, 437 Unchecked, 5.4s Time] [2022-11-22 01:44:02,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3162 states. [2022-11-22 01:44:02,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3162 to 1620. [2022-11-22 01:44:02,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1586 states have (on average 4.298865069356872) internal successors, (6818), 1619 states have internal predecessors, (6818), 0 states have call successors, (0), 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-22 01:44:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 6818 transitions. [2022-11-22 01:44:02,707 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 6818 transitions. Word has length 13 [2022-11-22 01:44:02,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:44:02,707 INFO L495 AbstractCegarLoop]: Abstraction has 1620 states and 6818 transitions. [2022-11-22 01:44:02,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 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-22 01:44:02,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 6818 transitions. [2022-11-22 01:44:02,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 01:44:02,708 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:44:02,708 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2022-11-22 01:44:02,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-11-22 01:44:02,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-11-22 01:44:02,911 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:44:02,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:44:02,911 INFO L85 PathProgramCache]: Analyzing trace with hash 230931482, now seen corresponding path program 5 times [2022-11-22 01:44:02,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:44:02,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264688302] [2022-11-22 01:44:02,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:44:02,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:44:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:44:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:44:03,823 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:44:03,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264688302] [2022-11-22 01:44:03,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264688302] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:44:03,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391637960] [2022-11-22 01:44:03,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:44:03,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:44:03,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:44:03,825 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:44:03,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-11-22 01:44:04,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-22 01:44:04,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:44:04,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-22 01:44:04,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:44:04,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:44:04,549 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-22 01:44:04,549 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 1 case distinctions, treesize of input 27 treesize of output 34 [2022-11-22 01:44:04,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:44:04,674 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 31 treesize of output 33 [2022-11-22 01:44:04,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:44:04,792 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 31 treesize of output 33 [2022-11-22 01:44:06,378 INFO L321 Elim1Store]: treesize reduction 20, result has 62.3 percent of original size [2022-11-22 01:44:06,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 680 treesize of output 558 [2022-11-22 01:44:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:44:09,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:44:12,872 WARN L837 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse4 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (not (< 3 c_~N~0)))) (and (or (forall ((v_ArrVal_1663 (Array Int Int)) (v_ArrVal_1662 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1662) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1663) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse3 .cse5)) (.cse2 (select .cse3 .cse4)) (.cse0 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 .cse0) (< 2147483647 (+ .cse1 .cse2)) (< .cse1 2147483648) (< 4294967295 .cse1) (< (+ .cse2 .cse0 2147483648) 0))))) (<= c_~N~0 3)) (or (forall ((v_ArrVal_1663 (Array Int Int)) (v_ArrVal_1662 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1662) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1663) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse6 (select .cse9 .cse5)) (.cse7 (select .cse9 .cse4)) (.cse8 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 (+ .cse6 .cse7 .cse8)) (< .cse6 2147483648) (< (+ .cse6 .cse7) 1) (< (+ .cse8 2147483648) 0) (< (+ .cse7 .cse8 2147483648) 0))))) .cse10) (or (forall ((v_ArrVal_1663 (Array Int Int)) (v_ArrVal_1662 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1662) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1663) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select .cse14 .cse5)) (.cse12 (select .cse14 .cse4)) (.cse13 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 (+ .cse11 .cse12 .cse13)) (< 2147483647 .cse13) (< .cse11 2147483648) (< 0 (+ .cse12 1)) (< (+ .cse12 .cse13 2147483648) 0))))) .cse10)))) is different from false [2022-11-22 01:44:13,346 INFO L321 Elim1Store]: treesize reduction 60, result has 62.5 percent of original size [2022-11-22 01:44:13,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 811 treesize of output 482 [2022-11-22 01:44:13,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 1051 treesize of output 1008 [2022-11-22 01:44:13,385 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 1635 treesize of output 1596 [2022-11-22 01:44:13,440 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:44:13,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1854 treesize of output 1828 [2022-11-22 01:44:13,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1784 treesize of output 1724 [2022-11-22 01:44:13,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1724 treesize of output 1694 [2022-11-22 01:44:13,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1694 treesize of output 1642 [2022-11-22 01:44:13,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1642 treesize of output 1538 [2022-11-22 01:44:13,625 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:44:13,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1558 treesize of output 1530 [2022-11-22 01:44:13,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1486 treesize of output 1438 [2022-11-22 01:44:13,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:44:13,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1458 treesize of output 1434 [2022-11-22 01:44:13,767 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:44:13,768 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 1390 treesize of output 1294 [2022-11-22 01:44:20,859 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-22 01:44:20,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391637960] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:44:20,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1100553435] [2022-11-22 01:44:20,859 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:336) 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-22 01:44:20,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:44:20,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-22 01:44:20,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096329519] [2022-11-22 01:44:20,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:44:20,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 01:44:20,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:44:20,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 01:44:20,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=809, Unknown=11, NotChecked=58, Total=992 [2022-11-22 01:44:20,861 INFO L87 Difference]: Start difference. First operand 1620 states and 6818 transitions. Second operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 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-22 01:44:36,943 WARN L233 SmtUtils]: Spent 11.57s on a formula simplification. DAG size of input: 201 DAG size of output: 188 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:44:48,179 WARN L233 SmtUtils]: Spent 7.55s on a formula simplification. DAG size of input: 222 DAG size of output: 201 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:44:56,830 WARN L233 SmtUtils]: Spent 7.58s on a formula simplification. DAG size of input: 217 DAG size of output: 208 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:45:09,213 WARN L233 SmtUtils]: Spent 11.90s on a formula simplification. DAG size of input: 221 DAG size of output: 198 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:45:23,874 WARN L233 SmtUtils]: Spent 5.58s on a formula simplification. DAG size of input: 255 DAG size of output: 198 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:45:56,004 WARN L233 SmtUtils]: Spent 7.78s on a formula simplification. DAG size of input: 239 DAG size of output: 226 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:46:08,745 WARN L233 SmtUtils]: Spent 9.46s on a formula simplification. DAG size of input: 194 DAG size of output: 186 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:46:13,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:46:13,209 INFO L93 Difference]: Finished difference Result 4216 states and 13647 transitions. [2022-11-22 01:46:13,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-22 01:46:13,210 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 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 13 [2022-11-22 01:46:13,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:46:13,218 INFO L225 Difference]: With dead ends: 4216 [2022-11-22 01:46:13,218 INFO L226 Difference]: Without dead ends: 4216 [2022-11-22 01:46:13,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 107.2s TimeCoverageRelationStatistics Valid=1144, Invalid=6155, Unknown=15, NotChecked=168, Total=7482 [2022-11-22 01:46:13,219 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 2660 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2886 mSolverCounterSat, 176 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2660 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 2886 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 337 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:46:13,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2660 Valid, 0 Invalid, 3400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 2886 Invalid, 1 Unknown, 337 Unchecked, 7.3s Time] [2022-11-22 01:46:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4216 states. [2022-11-22 01:46:13,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4216 to 1620. [2022-11-22 01:46:13,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1586 states have (on average 4.109709962168979) internal successors, (6518), 1619 states have internal predecessors, (6518), 0 states have call successors, (0), 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-22 01:46:13,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 6518 transitions. [2022-11-22 01:46:13,259 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 6518 transitions. Word has length 13 [2022-11-22 01:46:13,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:46:13,259 INFO L495 AbstractCegarLoop]: Abstraction has 1620 states and 6518 transitions. [2022-11-22 01:46:13,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 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-22 01:46:13,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 6518 transitions. [2022-11-22 01:46:13,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 01:46:13,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:46:13,261 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2022-11-22 01:46:13,272 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-11-22 01:46:13,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-11-22 01:46:13,468 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:46:13,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:46:13,468 INFO L85 PathProgramCache]: Analyzing trace with hash 230931488, now seen corresponding path program 3 times [2022-11-22 01:46:13,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:46:13,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284670461] [2022-11-22 01:46:13,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:46:13,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:46:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:46:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:46:14,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:46:14,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284670461] [2022-11-22 01:46:14,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284670461] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:46:14,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215824764] [2022-11-22 01:46:14,493 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:46:14,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:46:14,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:46:14,495 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:46:14,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-11-22 01:46:15,085 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:46:15,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:46:15,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-22 01:46:15,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:46:15,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-22 01:46:15,301 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 30 treesize of output 29 [2022-11-22 01:46:15,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:46:15,436 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 21 treesize of output 23 [2022-11-22 01:46:15,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:46:15,541 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 21 treesize of output 23 [2022-11-22 01:46:18,296 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:46:18,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:46:22,168 WARN L837 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse6 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse0 (<= c_~N~0 3))) (and (or .cse0 (forall ((v_ArrVal_1711 (Array Int Int)) (v_ArrVal_1710 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1710) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse5 .cse8)) (.cse2 (select .cse5 .cse7)) (.cse3 (select .cse5 .cse6)) (.cse4 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse1 0) (<= 0 (+ .cse1 .cse2 2147483648)) (< (+ .cse2 .cse3) (+ .cse4 1)) (< 2147483647 (+ .cse3 .cse4)) (< (+ .cse4 2147483648) 0)))))) (or (forall ((v_ArrVal_1711 (Array Int Int)) (v_ArrVal_1710 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1710) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select .cse13 .cse8)) (.cse10 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse12 (select .cse13 .cse7)) (.cse9 (select .cse13 .cse6))) (or (not (<= (+ .cse9 .cse10) 2147483647)) (< .cse11 0) (<= 0 (+ .cse11 .cse12 2147483648)) (not (<= 0 (+ .cse10 2147483648))) (not (<= 0 (+ .cse12 .cse9 2147483648))))))) .cse0)))) is different from false [2022-11-22 01:46:22,265 WARN L837 $PredicateComparison]: unable to prove that (or (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse5 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse9 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (<= c_~N~0 3))) (and (or (forall ((v_ArrVal_1711 (Array Int Int)) (v_ArrVal_1709 Int) (v_ArrVal_1710 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse8 .cse9 v_ArrVal_1709)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1710) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse2 (select .cse4 .cse7)) (.cse1 (select .cse4 .cse6)) (.cse3 (select .cse4 .cse5)) (.cse0 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 (+ .cse0 .cse1)) (< .cse2 0) (< (+ .cse0 2147483648) 0) (<= 0 (+ .cse2 .cse3 2147483648)) (< (+ .cse1 .cse3) (+ .cse0 1)))))) .cse10) (or (forall ((v_ArrVal_1711 (Array Int Int)) (v_ArrVal_1709 Int) (v_ArrVal_1710 (Array Int Int))) (let ((.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse8 .cse9 v_ArrVal_1709)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1710) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse12 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (select .cse15 .cse7)) (.cse13 (select .cse15 .cse6)) (.cse14 (select .cse15 .cse5))) (or (< .cse11 0) (not (<= 0 (+ .cse12 2147483648))) (not (<= (+ .cse12 .cse13) 2147483647)) (<= 0 (+ .cse11 .cse14 2147483648)) (not (<= 0 (+ .cse13 .cse14 2147483648))))))) .cse10)))) is different from false [2022-11-22 01:46:22,335 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:46:22,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 597 treesize of output 317 [2022-11-22 01:46:22,346 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 559 treesize of output 528 [2022-11-22 01:46:22,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 498 treesize of output 438 [2022-11-22 01:46:22,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 438 treesize of output 408 [2022-11-22 01:46:22,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:46:22,421 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 438 treesize of output 436 [2022-11-22 01:46:22,486 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:46:22,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1172 treesize of output 1084 [2022-11-22 01:46:22,521 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:46:22,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 998 treesize of output 942 [2022-11-22 01:46:22,552 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:46:22,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 942 treesize of output 830 [2022-11-22 01:46:25,902 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-22 01:46:25,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215824764] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:46:25,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1691197228] [2022-11-22 01:46:25,903 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:336) 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-22 01:46:25,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:46:25,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-22 01:46:25,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878611470] [2022-11-22 01:46:25,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:46:25,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 01:46:25,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:46:25,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 01:46:25,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=768, Unknown=3, NotChecked=114, Total=992 [2022-11-22 01:46:25,905 INFO L87 Difference]: Start difference. First operand 1620 states and 6518 transitions. Second operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 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-22 01:46:42,543 WARN L233 SmtUtils]: Spent 13.16s on a formula simplification. DAG size of input: 176 DAG size of output: 165 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:46:48,654 WARN L233 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 179 DAG size of output: 168 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:46:56,505 WARN L233 SmtUtils]: Spent 7.10s on a formula simplification. DAG size of input: 184 DAG size of output: 173 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:47:13,168 WARN L233 SmtUtils]: Spent 13.04s on a formula simplification. DAG size of input: 187 DAG size of output: 176 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:47:22,672 WARN L233 SmtUtils]: Spent 8.94s on a formula simplification. DAG size of input: 158 DAG size of output: 156 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:47:36,070 WARN L233 SmtUtils]: Spent 13.08s on a formula simplification. DAG size of input: 178 DAG size of output: 174 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:47:50,331 WARN L233 SmtUtils]: Spent 12.89s on a formula simplification. DAG size of input: 154 DAG size of output: 152 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:48:09,550 WARN L233 SmtUtils]: Spent 16.96s on a formula simplification. DAG size of input: 160 DAG size of output: 160 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:48:14,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:48:14,875 INFO L93 Difference]: Finished difference Result 2982 states and 9668 transitions. [2022-11-22 01:48:14,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-22 01:48:14,876 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 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 13 [2022-11-22 01:48:14,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:48:14,882 INFO L225 Difference]: With dead ends: 2982 [2022-11-22 01:48:14,882 INFO L226 Difference]: Without dead ends: 2982 [2022-11-22 01:48:14,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 105.2s TimeCoverageRelationStatistics Valid=784, Invalid=4333, Unknown=3, NotChecked=282, Total=5402 [2022-11-22 01:48:14,883 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1923 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2766 mSolverCounterSat, 130 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1923 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2766 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 434 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-11-22 01:48:14,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1923 Valid, 0 Invalid, 3331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2766 Invalid, 1 Unknown, 434 Unchecked, 5.9s Time] [2022-11-22 01:48:14,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2022-11-22 01:48:14,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 1620. [2022-11-22 01:48:14,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1586 states have (on average 3.9205548549810847) internal successors, (6218), 1619 states have internal predecessors, (6218), 0 states have call successors, (0), 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-22 01:48:14,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 6218 transitions. [2022-11-22 01:48:14,933 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 6218 transitions. Word has length 13 [2022-11-22 01:48:14,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:48:14,933 INFO L495 AbstractCegarLoop]: Abstraction has 1620 states and 6218 transitions. [2022-11-22 01:48:14,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 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-22 01:48:14,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 6218 transitions. [2022-11-22 01:48:14,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 01:48:14,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:48:14,935 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2022-11-22 01:48:14,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-11-22 01:48:15,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:48:15,142 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:48:15,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:48:15,143 INFO L85 PathProgramCache]: Analyzing trace with hash 230931378, now seen corresponding path program 3 times [2022-11-22 01:48:15,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:48:15,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860047453] [2022-11-22 01:48:15,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:48:15,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:48:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:48:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:48:16,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:48:16,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860047453] [2022-11-22 01:48:16,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860047453] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:48:16,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263686496] [2022-11-22 01:48:16,213 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:48:16,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:48:16,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:48:16,214 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:48:16,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-11-22 01:48:16,737 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:48:16,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:48:16,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-22 01:48:16,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:48:16,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:48:17,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:48:17,014 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 20 treesize of output 22 [2022-11-22 01:48:17,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:48:17,107 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 20 treesize of output 22 [2022-11-22 01:48:19,421 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:48:19,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:48:25,135 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse35 (* c_~j~0 4)) (.cse22 (+ c_~j~0 3))) (let ((.cse8 (not (< .cse22 c_~N~0))) (.cse4 (+ c_~A~0.offset 12 .cse35)) (.cse5 (+ c_~A~0.offset .cse35)) (.cse6 (+ c_~A~0.offset .cse35 4)) (.cse7 (+ c_~A~0.offset 8 .cse35))) (and (or (forall ((v_ArrVal_1757 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1757) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse7)) (.cse2 (select .cse3 .cse6)) (.cse0 (select .cse3 .cse5))) (or (not (<= .cse0 4294967295)) (not (<= (+ .cse0 c_~bag2~0 .cse1 .cse2) 2147483647)) (not (<= (+ .cse0 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse0 c_~bag2~0 .cse2 2147483648))) (< (+ .cse0 9223372039002259455) 0) (< 0 (+ (select .cse3 .cse4) 9223372039002259456)) (not (<= 0 (+ .cse0 c_~bag2~0 .cse1 .cse2 2147483648))) (not (<= (+ .cse0 c_~bag2~0 .cse2) 2147483647)) (not (<= 0 (+ .cse0 c_~bag2~0 2147483648))))))) .cse8) (or (not (<= c_~bag2~0 4294967295)) (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (forall ((v_ArrVal_1757 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1757) c_~A~0.base))) (let ((.cse9 (select .cse13 .cse5))) (let ((.cse12 (+ .cse9 c_~bag2~0)) (.cse10 (select .cse13 .cse7)) (.cse11 (select .cse13 .cse6))) (or (< .cse9 (+ .cse10 1)) (< 2147483647 (+ .cse9 .cse11)) (not (<= .cse12 2147483647)) (< (+ .cse9 c_~bag2~0 c_~sum2~0 2147483648) 0) (< .cse12 (+ .cse10 .cse11 1)) (not (<= 0 (+ .cse10 .cse11 2147483648))) (< 4294967295 .cse11) (< 0 (+ (select .cse13 .cse4) 9223372039002259456)) (< 2147483647 (+ .cse9 c_~bag2~0 c_~sum2~0))))))) .cse8) (or (forall ((v_ArrVal_1757 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1757) c_~A~0.base))) (let ((.cse14 (select .cse17 .cse5)) (.cse16 (select .cse17 .cse7)) (.cse15 (select .cse17 .cse6))) (or (not (<= .cse14 4294967295)) (< c_~bag2~0 (+ .cse15 1)) (not (<= 0 (+ .cse14 .cse15 2147483648))) (not (<= (+ .cse14 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse14 .cse16 .cse15 2147483648))) (< 0 (+ (select .cse17 .cse4) 9223372039002259456)) (< c_~bag2~0 (+ .cse16 .cse15 1)))))) .cse8) (or (forall ((v_ArrVal_1757 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1757) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse7)) (.cse18 (select .cse21 .cse5)) (.cse19 (select .cse21 .cse6))) (or (not (<= .cse18 4294967295)) (< c_~bag2~0 (+ .cse19 1)) (< (+ .cse18 .cse20 .cse19 2147483648) 0) (not (<= 0 (+ .cse18 .cse19 2147483648))) (not (<= (+ .cse18 c_~bag2~0) 2147483647)) (< 0 (+ (select .cse21 .cse4) 9223372039002259456)) (< 2147483647 (+ .cse18 .cse20 .cse19)) (< 2147483647 (+ .cse18 c_~bag2~0 .cse19 c_~sum2~0)) (< (+ .cse18 c_~bag2~0 .cse19 c_~sum2~0 2147483648) 0))))) (<= c_~N~0 .cse22)) (or (forall ((v_ArrVal_1757 (Array Int Int))) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1757) c_~A~0.base))) (let ((.cse23 (select .cse26 .cse7)) (.cse24 (select .cse26 .cse6)) (.cse25 (select .cse26 .cse5))) (or (not (<= (+ .cse23 .cse24) 2147483647)) (< 2147483647 (+ .cse25 .cse24)) (not (<= (+ .cse25 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse25 c_~bag2~0 .cse24 c_~sum2~0 2147483648))) (not (<= .cse23 4294967295)) (< (+ .cse25 c_~bag2~0 c_~sum2~0 2147483648) 0) (not (<= 0 (+ .cse23 .cse24 2147483648))) (not (<= (+ .cse25 c_~bag2~0 .cse24 c_~sum2~0) 2147483647)) (< 0 (+ (select .cse26 .cse4) 9223372039002259456)) (< 2147483647 (+ .cse25 c_~bag2~0 c_~sum2~0)) (< (+ .cse25 .cse24 2147483648) 0) (not (<= 0 (+ .cse25 c_~bag2~0 2147483648))))))) .cse8))) (or (forall ((v_ArrVal_1757 (Array Int Int))) (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1757) c_~A~0.base))) (let ((.cse28 (select .cse30 .cse7)) (.cse29 (select .cse30 .cse6)) (.cse27 (select .cse30 .cse5))) (or (not (<= .cse27 4294967295)) (< (+ .cse27 c_~bag2~0) (+ .cse28 1)) (< (+ .cse27 c_~bag2~0 c_~sum2~0 2147483648) 0) (< (+ .cse27 9223372039002259455) 0) (not (<= 0 (+ .cse28 .cse29 2147483648))) (< 0 (+ (select .cse30 .cse4) 9223372039002259456)) (< 2147483647 (+ .cse27 c_~bag2~0 c_~sum2~0)) (< .cse29 1) (< 2147483647 (+ .cse27 c_~bag2~0 .cse29)) (not (<= 0 (+ .cse27 c_~bag2~0 2147483648))))))) .cse8) (or .cse8 (forall ((v_ArrVal_1757 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1757) c_~A~0.base))) (let ((.cse32 (select .cse34 .cse7)) (.cse33 (select .cse34 .cse6)) (.cse31 (select .cse34 .cse5))) (or (not (<= .cse31 4294967295)) (not (<= (+ .cse32 .cse33) 2147483647)) (< (+ .cse31 c_~bag2~0 c_~sum2~0 2147483648) 0) (< (+ .cse31 9223372039002259455) 0) (not (<= 0 (+ .cse32 .cse33 2147483648))) (not (<= (+ .cse31 c_~bag2~0 .cse33 c_~sum2~0) 2147483647)) (< 0 (+ (select .cse34 .cse4) 9223372039002259456)) (< .cse33 1) (< 2147483647 (+ .cse31 c_~bag2~0 .cse33)) (not (<= 0 (+ .cse31 c_~bag2~0 2147483648))))))))))) is different from false [2022-11-22 01:48:25,889 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse4 (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (not (< 3 c_~N~0)))) (and (or (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1756) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1757) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse3 .cse6)) (.cse2 (select .cse3 .cse5)) (.cse0 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse0 (+ .cse1 .cse2 1)) (< (+ .cse1 .cse2 2147483648) 0) (< .cse0 (+ .cse1 1)) (< 2147483647 .cse0) (< 2147483647 (+ .cse2 .cse0)) (< 0 (+ (select .cse3 .cse4) 9223372039002259456)))))) .cse7) (or .cse7 (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1756) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1757) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse8 (select .cse11 .cse5)) (.cse10 (select .cse11 .cse6)) (.cse9 (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse8 .cse9 2147483648) 0) (< 2147483647 (+ .cse10 .cse8)) (< (+ .cse10 .cse8 2147483648) 0) (< 2147483647 .cse9) (< 2147483647 (+ .cse8 .cse9)) (< 0 (+ (select .cse11 .cse4) 9223372039002259456)) (< 4294967295 .cse10) (< (+ .cse9 2147483648) 0)))))) (or (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1756) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1757) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse14 (select .cse15 .cse6)) (.cse12 (select .cse15 .cse5)) (.cse13 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse12 .cse13 2147483648) 0) (< (+ .cse14 .cse12 .cse13 2147483648) 0) (< 2147483647 .cse13) (< 2147483647 (+ .cse12 .cse13)) (< 2147483647 (+ .cse14 .cse12 .cse13)) (< 0 (+ (select .cse15 .cse4) 9223372039002259456)) (< (+ .cse13 2147483648) 0))))) .cse7) (or (<= c_~N~0 3) (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1756) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1757) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse18 (select .cse19 .cse6)) (.cse16 (select .cse19 .cse5)) (.cse17 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse16 .cse17 2147483648) 0) (< 0 (+ .cse16 1)) (< (+ .cse18 .cse16 .cse17 2147483648) 0) (< 2147483647 .cse17) (< 2147483647 (+ .cse18 .cse16 .cse17)) (< 0 (+ (select .cse19 .cse4) 9223372039002259456))))))) (or (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int))) (let ((.cse23 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1756) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1757) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse20 (select .cse23 .cse6)) (.cse21 (select .cse23 .cse5)) (.cse22 (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse20 .cse21 2147483648) 0) (< .cse21 1) (< .cse22 (+ .cse20 1)) (< 2147483647 (+ .cse21 .cse22)) (< 0 (+ (select .cse23 .cse4) 9223372039002259456)) (< (+ .cse22 2147483648) 0))))) .cse7) (or .cse7 (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int))) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1756) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1757) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse24 (select .cse27 .cse6)) (.cse25 (select .cse27 .cse5)) (.cse26 (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 (+ .cse24 .cse25)) (< (+ .cse24 .cse25 2147483648) 0) (< .cse25 1) (< 2147483647 (+ .cse25 .cse26)) (< 0 (+ (select .cse27 .cse4) 9223372039002259456)) (< (+ .cse26 2147483648) 0)))))) (or (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int))) (let ((.cse31 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1756) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1757) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse29 (select .cse31 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse30 (select .cse31 .cse6)) (.cse28 (select .cse31 .cse5))) (or (< (+ .cse28 .cse29 2147483648) 0) (< 0 (+ .cse28 1)) (< (+ .cse30 .cse28 .cse29 2147483648) 0) (< 2147483647 .cse29) (< 0 (+ .cse30 .cse28 1)) (< 0 (+ (select .cse31 .cse4) 9223372039002259456)))))) .cse7))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) is different from false [2022-11-22 01:48:25,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:48:25,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2010 treesize of output 1123 [2022-11-22 01:48:26,073 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:48:26,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 5734 treesize of output 5122 [2022-11-22 01:48:26,167 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:48:26,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5076 treesize of output 5004 [2022-11-22 01:48:26,257 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:48:26,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5004 treesize of output 4860 [2022-11-22 01:48:26,347 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:48:26,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4860 treesize of output 4780 [2022-11-22 01:48:26,431 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:48:26,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4780 treesize of output 4720 [2022-11-22 01:48:26,523 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:48:26,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4720 treesize of output 4656 [2022-11-22 01:48:26,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:48:26,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4656 treesize of output 4624 [2022-11-22 01:48:26,730 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:48:26,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4624 treesize of output 4464 [2022-11-22 01:48:26,818 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:48:26,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4464 treesize of output 4396 [2022-11-22 01:48:26,907 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:48:26,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4396 treesize of output 4366 [2022-11-22 01:48:26,995 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:48:26,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4366 treesize of output 4286 [2022-11-22 01:48:27,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:48:27,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4286 treesize of output 4252 [2022-11-22 01:48:27,170 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:48:27,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4252 treesize of output 4180 [2022-11-22 01:48:27,263 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:48:27,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4180 treesize of output 4020 [2022-11-22 01:48:27,352 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:48:27,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4020 treesize of output 3876 [2022-11-22 01:48:35,086 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-22 01:48:35,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263686496] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:48:35,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [56494427] [2022-11-22 01:48:35,087 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:336) 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-22 01:48:35,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:48:35,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-22 01:48:35,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996727724] [2022-11-22 01:48:35,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:48:35,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 01:48:35,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:48:35,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 01:48:35,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=750, Unknown=2, NotChecked=114, Total=992 [2022-11-22 01:48:35,089 INFO L87 Difference]: Start difference. First operand 1620 states and 6218 transitions. Second operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 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-22 01:48:43,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:48:43,865 INFO L93 Difference]: Finished difference Result 2370 states and 8006 transitions. [2022-11-22 01:48:43,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-22 01:48:43,866 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 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 13 [2022-11-22 01:48:43,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:48:43,872 INFO L225 Difference]: With dead ends: 2370 [2022-11-22 01:48:43,872 INFO L226 Difference]: Without dead ends: 2370 [2022-11-22 01:48:43,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=476, Invalid=2080, Unknown=2, NotChecked=198, Total=2756 [2022-11-22 01:48:43,873 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1380 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 244 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-22 01:48:43,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 0 Invalid, 1907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1577 Invalid, 0 Unknown, 244 Unchecked, 2.8s Time] [2022-11-22 01:48:43,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2022-11-22 01:48:43,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 1740. [2022-11-22 01:48:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1740 states, 1706 states have (on average 3.899179366940211) internal successors, (6652), 1739 states have internal predecessors, (6652), 0 states have call successors, (0), 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-22 01:48:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 6652 transitions. [2022-11-22 01:48:43,932 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 6652 transitions. Word has length 13 [2022-11-22 01:48:43,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:48:43,932 INFO L495 AbstractCegarLoop]: Abstraction has 1740 states and 6652 transitions. [2022-11-22 01:48:43,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 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-22 01:48:43,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 6652 transitions. [2022-11-22 01:48:43,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 01:48:43,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:48:43,933 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:48:43,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-11-22 01:48:44,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-11-22 01:48:44,134 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:48:44,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:48:44,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1511362207, now seen corresponding path program 2 times [2022-11-22 01:48:44,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:48:44,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244497384] [2022-11-22 01:48:44,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:48:44,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:48:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:48:44,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:48:44,657 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:48:44,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244497384] [2022-11-22 01:48:44,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244497384] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:48:44,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654752031] [2022-11-22 01:48:44,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:48:44,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:48:44,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:48:44,658 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:48:44,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-11-22 01:48:45,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-22 01:48:45,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:48:45,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-22 01:48:45,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:48:45,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-22 01:48:45,314 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 23 treesize of output 22 [2022-11-22 01:48:45,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:48:45,374 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 16 treesize of output 18 [2022-11-22 01:48:45,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:48:45,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:48:46,351 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:48:46,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 83 [2022-11-22 01:48:46,391 INFO L321 Elim1Store]: treesize reduction 10, result has 69.7 percent of original size [2022-11-22 01:48:46,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 107 [2022-11-22 01:48:46,405 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-22 01:48:46,406 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 72 treesize of output 50 [2022-11-22 01:48:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:48:46,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654752031] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:48:46,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [840834429] [2022-11-22 01:48:46,594 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:336) 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-22 01:48:46,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:48:46,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-11-22 01:48:46,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576750053] [2022-11-22 01:48:46,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:48:46,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-22 01:48:46,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:48:46,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-22 01:48:46,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2022-11-22 01:48:46,597 INFO L87 Difference]: Start difference. First operand 1740 states and 6652 transitions. Second operand has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 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-22 01:48:54,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:48:54,422 INFO L93 Difference]: Finished difference Result 3685 states and 12905 transitions. [2022-11-22 01:48:54,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-11-22 01:48:54,423 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 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 13 [2022-11-22 01:48:54,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:48:54,431 INFO L225 Difference]: With dead ends: 3685 [2022-11-22 01:48:54,431 INFO L226 Difference]: Without dead ends: 3685 [2022-11-22 01:48:54,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2141 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1216, Invalid=6616, Unknown=0, NotChecked=0, Total=7832 [2022-11-22 01:48:54,432 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 574 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:48:54,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 0 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-22 01:48:54,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3685 states. [2022-11-22 01:48:54,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3685 to 2259. [2022-11-22 01:48:54,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2259 states, 2225 states have (on average 3.9298876404494383) internal successors, (8744), 2258 states have internal predecessors, (8744), 0 states have call successors, (0), 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-22 01:48:54,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 8744 transitions. [2022-11-22 01:48:54,500 INFO L78 Accepts]: Start accepts. Automaton has 2259 states and 8744 transitions. Word has length 13 [2022-11-22 01:48:54,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:48:54,500 INFO L495 AbstractCegarLoop]: Abstraction has 2259 states and 8744 transitions. [2022-11-22 01:48:54,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 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-22 01:48:54,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 8744 transitions. [2022-11-22 01:48:54,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 01:48:54,502 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:48:54,502 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2022-11-22 01:48:54,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-11-22 01:48:54,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-11-22 01:48:54,709 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:48:54,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:48:54,709 INFO L85 PathProgramCache]: Analyzing trace with hash 216509301, now seen corresponding path program 2 times [2022-11-22 01:48:54,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:48:54,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751582286] [2022-11-22 01:48:54,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:48:54,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:48:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:48:55,273 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:48:55,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:48:55,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751582286] [2022-11-22 01:48:55,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751582286] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:48:55,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513289866] [2022-11-22 01:48:55,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:48:55,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:48:55,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:48:55,279 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:48:55,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-11-22 01:48:55,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-22 01:48:55,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:48:55,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-22 01:48:55,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:48:56,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:48:56,101 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-22 01:48:56,102 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 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-22 01:48:56,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:48:56,203 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 28 [2022-11-22 01:48:56,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-11-22 01:48:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:48:56,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:48:56,948 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-22 01:48:56,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 48 [2022-11-22 01:48:56,961 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:48:56,961 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 51 treesize of output 47 [2022-11-22 01:48:57,022 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 9 treesize of output 5 [2022-11-22 01:48:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:48:57,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513289866] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:48:57,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [176113554] [2022-11-22 01:48:57,176 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:336) 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-22 01:48:57,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:48:57,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-11-22 01:48:57,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503870834] [2022-11-22 01:48:57,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:48:57,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-22 01:48:57,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:48:57,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-22 01:48:57,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2022-11-22 01:48:57,180 INFO L87 Difference]: Start difference. First operand 2259 states and 8744 transitions. Second operand has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 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-22 01:49:03,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:49:03,082 INFO L93 Difference]: Finished difference Result 3813 states and 13339 transitions. [2022-11-22 01:49:03,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-22 01:49:03,082 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 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 13 [2022-11-22 01:49:03,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:49:03,092 INFO L225 Difference]: With dead ends: 3813 [2022-11-22 01:49:03,092 INFO L226 Difference]: Without dead ends: 3813 [2022-11-22 01:49:03,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1894 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=976, Invalid=5996, Unknown=0, NotChecked=0, Total=6972 [2022-11-22 01:49:03,094 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 545 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-22 01:49:03,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 0 Invalid, 1594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-22 01:49:03,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3813 states. [2022-11-22 01:49:03,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3813 to 2214. [2022-11-22 01:49:03,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2214 states, 2180 states have (on average 3.8192660550458717) internal successors, (8326), 2213 states have internal predecessors, (8326), 0 states have call successors, (0), 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-22 01:49:03,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 8326 transitions. [2022-11-22 01:49:03,157 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 8326 transitions. Word has length 13 [2022-11-22 01:49:03,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:49:03,158 INFO L495 AbstractCegarLoop]: Abstraction has 2214 states and 8326 transitions. [2022-11-22 01:49:03,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 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-22 01:49:03,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 8326 transitions. [2022-11-22 01:49:03,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 01:49:03,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:49:03,159 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1] [2022-11-22 01:49:03,167 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-11-22 01:49:03,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:49:03,367 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:49:03,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:49:03,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1981541450, now seen corresponding path program 4 times [2022-11-22 01:49:03,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:49:03,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619206317] [2022-11-22 01:49:03,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:49:03,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:49:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:49:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:49:04,424 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:49:04,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619206317] [2022-11-22 01:49:04,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619206317] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:49:04,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115312396] [2022-11-22 01:49:04,424 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 01:49:04,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:49:04,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:49:04,427 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:49:04,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-11-22 01:49:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:49:04,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-22 01:49:04,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:49:05,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:49:05,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:49:05,208 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 27 treesize of output 26 [2022-11-22 01:49:05,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:49:05,284 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 18 treesize of output 20 [2022-11-22 01:49:05,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:49:05,353 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 18 treesize of output 20 [2022-11-22 01:49:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:49:07,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:49:13,630 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse50 (* c_~j~0 4))) (let ((.cse1 (+ c_~A~0.offset 12 .cse50)) (.cse5 (+ c_~A~0.offset .cse50)) (.cse6 (+ c_~A~0.offset 8 .cse50)) (.cse7 (+ c_~A~0.offset .cse50 4))) (and (forall ((v_ArrVal_1887 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) c_~A~0.base))) (let ((.cse2 (select .cse0 .cse7)) (.cse4 (select .cse0 .cse6)) (.cse3 (select .cse0 .cse5))) (or (< 0 (+ (select .cse0 .cse1) 9223372039002259456)) (< .cse2 1) (not (<= (+ c_~bag2~0 .cse3 .cse2) 2147483647)) (not (<= 0 (+ .cse2 2147483648 .cse4))) (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))) (not (<= 0 (+ 9223372039002259455 .cse3))) (< (+ c_~bag2~0 .cse3) (+ 1 .cse4)) (not (<= (+ c_~bag2~0 .cse3 c_~sum2~0) 2147483647)) (not (<= .cse3 4294967295)) (not (<= 0 (+ c_~bag2~0 .cse3 c_~sum2~0 2147483648))))))) (or (not (<= c_~bag2~0 4294967295)) (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (forall ((v_ArrVal_1887 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) c_~A~0.base))) (let ((.cse9 (select .cse11 .cse7)) (.cse10 (select .cse11 .cse6)) (.cse8 (select .cse11 .cse5))) (or (< 2147483647 (+ .cse8 .cse9 .cse10)) (< 0 (+ (select .cse11 .cse1) 9223372039002259456)) (< (+ c_~bag2~0 .cse8 c_~sum2~0 .cse9 2147483648) 0) (not (<= 0 (+ .cse8 .cse9 2147483648))) (< 2147483647 (+ c_~bag2~0 .cse8 c_~sum2~0 .cse9)) (< c_~bag2~0 (+ .cse9 1)) (not (<= (+ c_~bag2~0 .cse8) 2147483647)) (< (+ .cse8 .cse9 2147483648 .cse10) 0) (not (<= .cse8 4294967295)) (<= .cse8 0))))) (forall ((v_ArrVal_1887 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) c_~A~0.base))) (let ((.cse16 (select .cse12 .cse5))) (let ((.cse15 (+ c_~bag2~0 .cse16)) (.cse13 (select .cse12 .cse7)) (.cse14 (select .cse12 .cse6))) (or (< 0 (+ (select .cse12 .cse1) 9223372039002259456)) (not (<= .cse13 4294967295)) (not (<= 0 (+ .cse13 2147483648 .cse14))) (not (<= .cse15 2147483647)) (not (<= (+ .cse16 .cse13) 2147483647)) (< .cse15 (+ .cse13 1 .cse14)) (not (<= 0 (+ c_~bag2~0 .cse16 c_~sum2~0 2147483648))) (< .cse16 (+ 1 .cse14)) (not (<= .cse16 0))))))) (forall ((v_ArrVal_1887 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) c_~A~0.base))) (let ((.cse19 (select .cse17 .cse7)) (.cse20 (select .cse17 .cse6)) (.cse18 (select .cse17 .cse5))) (or (< 0 (+ (select .cse17 .cse1) 9223372039002259456)) (not (<= (+ c_~bag2~0 .cse18 c_~sum2~0 .cse19) 2147483647)) (not (<= 0 (+ .cse18 .cse19 2147483648))) (not (<= 0 (+ .cse19 2147483648 .cse20))) (not (<= 0 (+ c_~bag2~0 .cse18 c_~sum2~0 .cse19 2147483648))) (not (<= (+ c_~bag2~0 .cse18) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse18 2147483648))) (not (<= (+ .cse18 .cse19) 2147483647)) (not (<= (+ .cse19 .cse20) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse18 c_~sum2~0 2147483648))) (not (<= .cse18 0)))))) (forall ((v_ArrVal_1887 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) c_~A~0.base))) (let ((.cse23 (select .cse21 .cse7)) (.cse24 (select .cse21 .cse6)) (.cse22 (select .cse21 .cse5))) (or (< 0 (+ (select .cse21 .cse1) 9223372039002259456)) (not (<= 0 (+ .cse22 .cse23 2147483648 .cse24))) (not (<= 0 (+ .cse22 .cse23 2147483648))) (< c_~bag2~0 (+ .cse23 1)) (not (<= (+ c_~bag2~0 .cse22) 2147483647)) (< c_~bag2~0 (+ .cse23 1 .cse24)) (not (<= .cse22 0)))))) (forall ((v_ArrVal_1887 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) c_~A~0.base))) (let ((.cse27 (select .cse25 .cse7)) (.cse28 (select .cse25 .cse6)) (.cse26 (select .cse25 .cse5))) (or (< 0 (+ (select .cse25 .cse1) 9223372039002259456)) (not (<= 0 (+ .cse26 .cse27 2147483648 .cse28))) (not (<= 0 (+ .cse26 .cse27 2147483648))) (< c_~bag2~0 (+ .cse27 1)) (not (<= (+ c_~bag2~0 .cse26) 2147483647)) (not (<= .cse26 4294967295)) (< c_~bag2~0 (+ .cse27 1 .cse28)) (<= .cse26 0))))) (forall ((v_ArrVal_1887 (Array Int Int))) (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) c_~A~0.base))) (let ((.cse31 (select .cse29 .cse7)) (.cse32 (select .cse29 .cse6)) (.cse30 (select .cse29 .cse5))) (or (< 0 (+ (select .cse29 .cse1) 9223372039002259456)) (not (<= (+ c_~bag2~0 .cse30 c_~sum2~0 .cse31) 2147483647)) (not (<= 0 (+ .cse30 .cse31 2147483648))) (not (<= 0 (+ .cse31 2147483648 .cse32))) (not (<= 0 (+ c_~bag2~0 .cse30 c_~sum2~0 .cse31 2147483648))) (not (<= (+ c_~bag2~0 .cse30) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse30 2147483648))) (not (<= (+ .cse30 .cse31) 2147483647)) (not (<= (+ .cse31 .cse32) 2147483647)) (not (<= (+ c_~bag2~0 .cse30 c_~sum2~0) 2147483647)) (not (<= .cse32 4294967295)) (<= .cse30 0))))) (forall ((v_ArrVal_1887 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) c_~A~0.base))) (let ((.cse37 (select .cse33 .cse5))) (let ((.cse36 (+ c_~bag2~0 .cse37)) (.cse34 (select .cse33 .cse7)) (.cse35 (select .cse33 .cse6))) (or (< 0 (+ (select .cse33 .cse1) 9223372039002259456)) (not (<= 0 (+ .cse34 2147483648 .cse35))) (not (<= .cse36 2147483647)) (not (<= (+ .cse37 .cse34) 2147483647)) (< .cse36 (+ .cse34 1 .cse35)) (not (<= (+ c_~bag2~0 .cse37 c_~sum2~0) 2147483647)) (< .cse37 (+ 1 .cse35)) (<= .cse37 0)))))) (forall ((v_ArrVal_1887 (Array Int Int))) (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) c_~A~0.base))) (let ((.cse39 (select .cse41 .cse7)) (.cse40 (select .cse41 .cse6)) (.cse38 (select .cse41 .cse5))) (or (< 2147483647 (+ .cse38 .cse39 .cse40)) (< 0 (+ (select .cse41 .cse1) 9223372039002259456)) (< (+ c_~bag2~0 .cse38 c_~sum2~0 .cse39 2147483648) 0) (not (<= 0 (+ .cse38 .cse39 2147483648))) (< 2147483647 (+ c_~bag2~0 .cse38 c_~sum2~0 .cse39)) (< c_~bag2~0 (+ .cse39 1)) (not (<= (+ c_~bag2~0 .cse38) 2147483647)) (< (+ .cse38 .cse39 2147483648 .cse40) 0) (not (<= .cse38 0)))))))) (forall ((v_ArrVal_1887 (Array Int Int))) (let ((.cse42 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) c_~A~0.base))) (let ((.cse44 (select .cse42 .cse7)) (.cse45 (select .cse42 .cse6)) (.cse43 (select .cse42 .cse5))) (or (< 0 (+ (select .cse42 .cse1) 9223372039002259456)) (not (<= (+ c_~bag2~0 .cse43 c_~sum2~0 .cse44) 2147483647)) (< .cse44 1) (not (<= (+ c_~bag2~0 .cse43 .cse44) 2147483647)) (not (<= 0 (+ .cse44 2147483648 .cse45))) (not (<= 0 (+ c_~bag2~0 .cse43 2147483648))) (not (<= 0 (+ 9223372039002259455 .cse43))) (not (<= (+ .cse44 .cse45) 2147483647)) (not (<= .cse43 4294967295)) (not (<= 0 (+ c_~bag2~0 .cse43 c_~sum2~0 2147483648))))))) (forall ((v_ArrVal_1887 (Array Int Int))) (let ((.cse46 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) c_~A~0.base))) (let ((.cse48 (select .cse46 .cse7)) (.cse49 (select .cse46 .cse6)) (.cse47 (select .cse46 .cse5))) (or (< 0 (+ (select .cse46 .cse1) 9223372039002259456)) (not (<= 0 (+ c_~bag2~0 .cse47 .cse48 2147483648 .cse49))) (not (<= 0 (+ c_~bag2~0 .cse47 .cse48 2147483648))) (not (<= (+ c_~bag2~0 .cse47 .cse48) 2147483647)) (not (<= (+ c_~bag2~0 .cse47) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse47 2147483648))) (not (<= 0 (+ 9223372039002259455 .cse47))) (not (<= (+ c_~bag2~0 .cse47 .cse48 .cse49) 2147483647)) (not (<= .cse47 4294967295))))))))) is different from false [2022-11-22 01:49:14,695 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse2 .cse6)) (.cse0 (select .cse2 .cse5)) (.cse4 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse0 .cse1 2147483648) 0) (< 0 (+ (select .cse2 .cse3) 9223372039002259456)) (< .cse4 (+ .cse0 .cse1 1)) (< .cse4 (+ .cse1 1)) (< 2147483647 (+ .cse4 .cse0)) (< 0 .cse4))))) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse8 (select .cse10 .cse6)) (.cse9 (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (select .cse10 .cse5))) (or (< 2147483647 (+ .cse7 .cse8)) (< (+ .cse9 .cse7 2147483648) 0) (< (+ .cse7 .cse8 2147483648) 0) (< 2147483647 .cse9) (< 0 (+ (select .cse10 .cse3) 9223372039002259456)) (<= .cse9 0) (< 4294967295 .cse8) (< 2147483647 (+ .cse9 .cse7)))))) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse12 (select .cse14 .cse5)) (.cse13 (select .cse14 .cse6)) (.cse11 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= (+ .cse11 .cse12) 2147483647)) (not (<= 0 (+ .cse12 .cse13 2147483648))) (< 0 (+ (select .cse14 .cse3) 9223372039002259456)) (<= .cse11 0) (< .cse11 (+ .cse12 .cse13 1)) (< .cse11 (+ .cse13 1)) (not (<= .cse11 2147483647)))))) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse17 (select .cse18 .cse6)) (.cse15 (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse16 (select .cse18 .cse5))) (or (< (+ .cse15 .cse16 2147483648) 0) (< 2147483647 (+ .cse15 .cse16 .cse17)) (< 2147483647 .cse15) (< (+ .cse15 .cse16 .cse17 2147483648) 0) (< 0 (+ (select .cse18 .cse3) 9223372039002259456)) (< (+ .cse15 2147483648) 0) (< 2147483647 (+ .cse15 .cse16)))))) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int))) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse20 (select .cse21 .cse6)) (.cse22 (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse19 (select .cse21 .cse5))) (or (< 2147483647 (+ .cse19 .cse20)) (< (+ .cse19 .cse20 2147483648) 0) (< 0 (+ (select .cse21 .cse3) 9223372039002259456)) (< (+ .cse22 2147483648) 0) (< 2147483647 (+ .cse22 .cse19)) (< .cse19 1))))) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int))) (let ((.cse26 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse25 (select .cse26 .cse6)) (.cse24 (select .cse26 .cse5)) (.cse23 (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse23 .cse24 2147483648) 0) (< 2147483647 (+ .cse23 .cse24 .cse25)) (< (+ .cse23 .cse24 .cse25 2147483648) 0) (< 0 (+ (select .cse26 .cse3) 9223372039002259456)) (< 0 (+ .cse24 1)) (< 0 .cse23))))) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse29 (select .cse30 .cse6)) (.cse28 (select .cse30 .cse5)) (.cse27 (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse27 .cse28 2147483648) 0) (< (+ .cse27 .cse28 .cse29 2147483648) 0) (< 0 (+ .cse28 .cse29 1)) (< 0 (+ (select .cse30 .cse3) 9223372039002259456)) (< 0 (+ .cse28 1)) (< 0 .cse27))))) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int))) (let ((.cse33 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse32 (select .cse33 .cse6)) (.cse34 (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse31 (select .cse33 .cse5))) (or (< (+ .cse31 .cse32 2147483648) 0) (< 0 (+ (select .cse33 .cse3) 9223372039002259456)) (< (+ .cse34 2147483648) 0) (< .cse34 (+ .cse32 1)) (< 2147483647 (+ .cse34 .cse31)) (< .cse31 1))))) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int))) (let ((.cse38 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse37 (select .cse38 .cse6)) (.cse35 (select .cse38 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse36 (select .cse38 .cse5))) (or (< (+ .cse35 .cse36 2147483648) 0) (< 2147483647 .cse35) (< (+ .cse35 .cse36 .cse37 2147483648) 0) (< 0 (+ .cse36 .cse37 1)) (< 0 (+ (select .cse38 .cse3) 9223372039002259456)) (<= .cse35 0) (< 0 (+ .cse36 1)))))) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int))) (let ((.cse42 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse41 (select .cse42 .cse6)) (.cse39 (select .cse42 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse40 (select .cse42 .cse5))) (or (< (+ .cse39 .cse40 2147483648) 0) (< 2147483647 (+ .cse39 .cse40 .cse41)) (< 2147483647 .cse39) (< (+ .cse39 .cse40 .cse41 2147483648) 0) (< 0 (+ (select .cse42 .cse3) 9223372039002259456)) (<= .cse39 0) (< 0 (+ .cse40 1)))))) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int))) (let ((.cse46 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse44 (select .cse46 .cse6)) (.cse43 (select .cse46 .cse5)) (.cse45 (select .cse46 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 (+ .cse43 .cse44)) (< (+ .cse45 .cse43 2147483648) 0) (< (+ .cse43 .cse44 2147483648) 0) (< 0 (+ (select .cse46 .cse3) 9223372039002259456)) (< (+ .cse45 2147483648) 0) (< 2147483647 (+ .cse45 .cse43)) (< 0 .cse45))))))) is different from false [2022-11-22 01:49:15,102 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse8 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int)) (v_ArrVal_1885 Int)) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_1885)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse3 .cse6)) (.cse0 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (select .cse3 .cse5))) (or (< (+ .cse0 .cse1 .cse2 2147483648) 0) (< (+ .cse0 2147483648) 0) (< 2147483647 (+ .cse0 .cse2)) (< 2147483647 (+ .cse0 .cse1 .cse2)) (< 2147483647 .cse0) (< 0 (+ (select .cse3 .cse4) 9223372039002259456)) (< (+ .cse0 .cse2 2147483648) 0))))) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int)) (v_ArrVal_1885 Int)) (let ((.cse12 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_1885)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse10 (select .cse12 .cse5)) (.cse11 (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (select .cse12 .cse6))) (or (< (+ .cse9 .cse10 2147483648) 0) (< (+ .cse11 2147483648) 0) (< 2147483647 (+ .cse11 .cse10)) (< .cse10 1) (< .cse11 (+ .cse9 1)) (< 0 (+ (select .cse12 .cse4) 9223372039002259456)))))) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int)) (v_ArrVal_1885 Int)) (let ((.cse16 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_1885)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse14 (select .cse16 .cse6)) (.cse13 (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse15 (select .cse16 .cse5))) (or (< 0 .cse13) (< (+ .cse13 .cse14 .cse15 2147483648) 0) (< 0 (+ .cse15 1)) (< 0 (+ .cse14 .cse15 1)) (< 0 (+ (select .cse16 .cse4) 9223372039002259456)) (< (+ .cse13 .cse15 2147483648) 0))))) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int)) (v_ArrVal_1885 Int)) (let ((.cse20 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_1885)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse18 (select .cse20 .cse6)) (.cse17 (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse19 (select .cse20 .cse5))) (or (< (+ .cse17 .cse18 .cse19 2147483648) 0) (<= .cse17 0) (< 2147483647 .cse17) (< 0 (+ .cse19 1)) (< 0 (+ .cse18 .cse19 1)) (< 0 (+ (select .cse20 .cse4) 9223372039002259456)) (< (+ .cse17 .cse19 2147483648) 0))))) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int)) (v_ArrVal_1885 Int)) (let ((.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_1885)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse21 (select .cse24 .cse6)) (.cse23 (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse22 (select .cse24 .cse5))) (or (< (+ .cse21 .cse22 2147483648) 0) (< 2147483647 (+ .cse21 .cse22)) (< (+ .cse23 2147483648) 0) (< 2147483647 (+ .cse23 .cse22)) (< .cse22 1) (< 0 (+ (select .cse24 .cse4) 9223372039002259456)))))) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int)) (v_ArrVal_1885 Int)) (let ((.cse28 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_1885)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse27 (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse25 (select .cse28 .cse6)) (.cse26 (select .cse28 .cse5))) (or (< (+ .cse25 .cse26 2147483648) 0) (< 0 .cse27) (< 2147483647 (+ .cse27 .cse26)) (< .cse27 (+ .cse25 1)) (< 0 (+ (select .cse28 .cse4) 9223372039002259456)) (< .cse27 (+ .cse25 .cse26 1)))))) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int)) (v_ArrVal_1885 Int)) (let ((.cse32 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_1885)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse29 (select .cse32 .cse6)) (.cse30 (select .cse32 .cse5))) (or (not (<= 0 (+ .cse29 .cse30 2147483648))) (not (<= (+ .cse31 .cse30) 2147483647)) (not (<= .cse31 2147483647)) (<= .cse31 0) (< .cse31 (+ .cse29 1)) (< 0 (+ (select .cse32 .cse4) 9223372039002259456)) (< .cse31 (+ .cse29 .cse30 1)))))) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int)) (v_ArrVal_1885 Int)) (let ((.cse36 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_1885)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse33 (select .cse36 .cse6)) (.cse35 (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse34 (select .cse36 .cse5))) (or (< (+ .cse33 .cse34 2147483648) 0) (< 2147483647 (+ .cse33 .cse34)) (< 0 .cse35) (< (+ .cse35 2147483648) 0) (< 2147483647 (+ .cse35 .cse34)) (< 0 (+ (select .cse36 .cse4) 9223372039002259456)) (< (+ .cse35 .cse34 2147483648) 0))))) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int)) (v_ArrVal_1885 Int)) (let ((.cse40 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_1885)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse37 (select .cse40 .cse6)) (.cse39 (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse38 (select .cse40 .cse5))) (or (< (+ .cse37 .cse38 2147483648) 0) (< 2147483647 (+ .cse37 .cse38)) (< 4294967295 .cse37) (< 2147483647 (+ .cse39 .cse38)) (<= .cse39 0) (< 2147483647 .cse39) (< 0 (+ (select .cse40 .cse4) 9223372039002259456)) (< (+ .cse39 .cse38 2147483648) 0))))) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int)) (v_ArrVal_1885 Int)) (let ((.cse44 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_1885)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse42 (select .cse44 .cse6)) (.cse41 (select .cse44 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse43 (select .cse44 .cse5))) (or (< 0 .cse41) (< (+ .cse41 .cse42 .cse43 2147483648) 0) (< 2147483647 (+ .cse41 .cse42 .cse43)) (< 0 (+ .cse43 1)) (< 0 (+ (select .cse44 .cse4) 9223372039002259456)) (< (+ .cse41 .cse43 2147483648) 0))))) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int)) (v_ArrVal_1885 Int)) (let ((.cse48 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_1885)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse46 (select .cse48 .cse6)) (.cse45 (select .cse48 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse47 (select .cse48 .cse5))) (or (< (+ .cse45 .cse46 .cse47 2147483648) 0) (< 2147483647 (+ .cse45 .cse46 .cse47)) (<= .cse45 0) (< 2147483647 .cse45) (< 0 (+ .cse47 1)) (< 0 (+ (select .cse48 .cse4) 9223372039002259456)) (< (+ .cse45 .cse47 2147483648) 0))))))) is different from false [2022-11-22 01:49:16,029 INFO L321 Elim1Store]: treesize reduction 319, result has 45.4 percent of original size [2022-11-22 01:49:16,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 11 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 11 new quantified variables, introduced 22 case distinctions, treesize of input 4041 treesize of output 2502 [2022-11-22 01:49:16,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 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 3864 treesize of output 4048 [2022-11-22 01:49:16,607 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:49:16,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 3726 treesize of output 3688 [2022-11-22 01:49:16,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 3635 treesize of output 3491 [2022-11-22 01:49:16,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 3491 treesize of output 3419 [2022-11-22 01:49:17,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 7601 treesize of output 7532 [2022-11-22 01:49:18,184 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:49:18,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 7327 treesize of output 7321 [2022-11-22 01:49:18,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 7270 treesize of output 7234 [2022-11-22 01:49:18,618 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:49:18,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 7251 treesize of output 7209 [2022-11-22 01:49:18,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 7158 treesize of output 7078 [2022-11-22 01:49:19,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 7078 treesize of output 7038 [2022-11-22 01:49:19,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 7038 treesize of output 6962 [2022-11-22 01:49:19,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:49:19,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 6979 treesize of output 6983 [2022-11-22 01:49:19,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 6932 treesize of output 6872 [2022-11-22 01:49:19,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 6872 treesize of output 6842 [2022-11-22 01:49:20,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:49:20,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 6859 treesize of output 6813 [2022-11-22 01:49:20,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 6762 treesize of output 6690 [2022-11-22 01:49:20,578 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:49:20,581 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 7104 treesize of output 6952 [2022-11-22 01:49:20,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 6654 treesize of output 6502 [2022-11-22 01:49:21,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 6502 treesize of output 6422 [2022-11-22 01:49:21,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 6422 treesize of output 6262 [2022-11-22 01:49:21,508 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:49:21,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 6279 treesize of output 6281 [2022-11-22 01:49:21,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 6230 treesize of output 6166 [2022-11-22 01:49:22,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 6166 treesize of output 6134 [2022-11-22 01:49:22,306 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:49:22,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 7099 treesize of output 7007 [2022-11-22 01:49:22,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 6956 treesize of output 6804 [2022-11-22 01:49:23,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 6804 treesize of output 6728 [2022-11-22 01:49:23,375 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:49:23,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 6745 treesize of output 6707 [2022-11-22 01:49:23,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 6656 treesize of output 6584 [2022-11-22 01:49:24,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 6584 treesize of output 6440 [2022-11-22 01:49:24,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:49:24,318 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 7044 treesize of output 6822 [2022-11-22 01:49:24,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 6406 treesize of output 6338 [2022-11-22 01:49:25,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 6338 treesize of output 6304 [2022-11-22 01:49:25,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 6304 treesize of output 6232 [2022-11-22 01:49:25,536 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:49:25,539 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 6884 treesize of output 6606 [2022-11-22 01:49:25,847 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:49:25,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6160 treesize of output 6016 [2022-11-22 01:51:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-22 01:51:00,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115312396] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:51:00,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [169106739] [2022-11-22 01:51:00,140 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:336) 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-22 01:51:00,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:51:00,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-22 01:51:00,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411342677] [2022-11-22 01:51:00,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:51:00,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-22 01:51:00,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:51:00,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-22 01:51:00,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=899, Unknown=3, NotChecked=186, Total=1190 [2022-11-22 01:51:00,142 INFO L87 Difference]: Start difference. First operand 2214 states and 8326 transitions. Second operand has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 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-22 01:51:10,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:51:10,770 INFO L93 Difference]: Finished difference Result 2480 states and 8811 transitions. [2022-11-22 01:51:10,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-22 01:51:10,770 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 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 14 [2022-11-22 01:51:10,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:51:10,776 INFO L225 Difference]: With dead ends: 2480 [2022-11-22 01:51:10,777 INFO L226 Difference]: Without dead ends: 2480 [2022-11-22 01:51:10,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=240, Invalid=1749, Unknown=3, NotChecked=264, Total=2256 [2022-11-22 01:51:10,777 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 714 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2980 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 530 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:51:10,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 0 Invalid, 3551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2980 Invalid, 0 Unknown, 530 Unchecked, 4.5s Time] [2022-11-22 01:51:10,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2022-11-22 01:51:10,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2214. [2022-11-22 01:51:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2214 states, 2180 states have (on average 3.791743119266055) internal successors, (8266), 2213 states have internal predecessors, (8266), 0 states have call successors, (0), 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-22 01:51:10,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 8266 transitions. [2022-11-22 01:51:10,821 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 8266 transitions. Word has length 14 [2022-11-22 01:51:10,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:51:10,821 INFO L495 AbstractCegarLoop]: Abstraction has 2214 states and 8266 transitions. [2022-11-22 01:51:10,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 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-22 01:51:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 8266 transitions. [2022-11-22 01:51:10,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 01:51:10,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:51:10,823 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1] [2022-11-22 01:51:10,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-11-22 01:51:11,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:51:11,035 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:51:11,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:51:11,036 INFO L85 PathProgramCache]: Analyzing trace with hash -702653052, now seen corresponding path program 3 times [2022-11-22 01:51:11,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:51:11,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721364873] [2022-11-22 01:51:11,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:51:11,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:51:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:51:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:51:11,807 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:51:11,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721364873] [2022-11-22 01:51:11,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721364873] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:51:11,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580768610] [2022-11-22 01:51:11,807 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:51:11,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:51:11,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:51:11,809 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:51:11,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-11-22 01:51:12,355 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:51:12,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:51:12,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-22 01:51:12,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:51:12,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:51:12,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:51:12,550 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 25 treesize of output 24 [2022-11-22 01:51:12,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:51:12,618 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 16 treesize of output 18 [2022-11-22 01:51:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:51:12,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:51:13,156 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1929 Int) (v_ArrVal_1930 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1929)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1930) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-22 01:51:13,182 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-22 01:51:13,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-11-22 01:51:13,192 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:51:13,193 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 37 treesize of output 33 [2022-11-22 01:51:13,210 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 7 treesize of output 3 [2022-11-22 01:51:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-22 01:51:13,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580768610] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:51:13,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1917892813] [2022-11-22 01:51:13,350 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:336) 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-22 01:51:13,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:51:13,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-22 01:51:13,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470865828] [2022-11-22 01:51:13,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:51:13,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 01:51:13,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:51:13,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 01:51:13,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=829, Unknown=6, NotChecked=58, Total=992 [2022-11-22 01:51:13,352 INFO L87 Difference]: Start difference. First operand 2214 states and 8266 transitions. Second operand has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 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-22 01:51:16,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:51:16,165 INFO L93 Difference]: Finished difference Result 3351 states and 11398 transitions. [2022-11-22 01:51:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-22 01:51:16,166 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 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 14 [2022-11-22 01:51:16,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:51:16,173 INFO L225 Difference]: With dead ends: 3351 [2022-11-22 01:51:16,173 INFO L226 Difference]: Without dead ends: 3351 [2022-11-22 01:51:16,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=296, Invalid=1682, Unknown=6, NotChecked=86, Total=2070 [2022-11-22 01:51:16,174 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 218 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-22 01:51:16,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 0 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1545 Invalid, 0 Unknown, 108 Unchecked, 1.8s Time] [2022-11-22 01:51:16,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3351 states. [2022-11-22 01:51:16,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3351 to 2220. [2022-11-22 01:51:16,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2220 states, 2186 states have (on average 3.7886550777676122) internal successors, (8282), 2219 states have internal predecessors, (8282), 0 states have call successors, (0), 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-22 01:51:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 8282 transitions. [2022-11-22 01:51:16,219 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 8282 transitions. Word has length 14 [2022-11-22 01:51:16,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:51:16,219 INFO L495 AbstractCegarLoop]: Abstraction has 2220 states and 8282 transitions. [2022-11-22 01:51:16,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 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-22 01:51:16,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 8282 transitions. [2022-11-22 01:51:16,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 01:51:16,220 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:51:16,220 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1] [2022-11-22 01:51:16,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-11-22 01:51:16,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:51:16,423 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:51:16,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:51:16,423 INFO L85 PathProgramCache]: Analyzing trace with hash -702653208, now seen corresponding path program 2 times [2022-11-22 01:51:16,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:51:16,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213270598] [2022-11-22 01:51:16,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:51:16,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:51:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:51:16,949 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:51:16,949 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:51:16,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213270598] [2022-11-22 01:51:16,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213270598] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:51:16,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74878609] [2022-11-22 01:51:16,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:51:16,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:51:16,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:51:16,951 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:51:16,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-11-22 01:51:17,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-22 01:51:17,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:51:17,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-22 01:51:17,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:51:17,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:51:17,727 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-22 01:51:17,727 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 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-22 01:51:19,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:51:19,748 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 31 treesize of output 31 [2022-11-22 01:51:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:51:22,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:51:22,741 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1973 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1973) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-22 01:51:22,881 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-22 01:51:22,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 48 [2022-11-22 01:51:22,904 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:51:22,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 74 [2022-11-22 01:51:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-22 01:51:23,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74878609] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:51:23,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2071252862] [2022-11-22 01:51:23,087 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:336) 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-22 01:51:23,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:51:23,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-22 01:51:23,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063448695] [2022-11-22 01:51:23,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:51:23,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 01:51:23,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:51:23,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 01:51:23,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=840, Unknown=11, NotChecked=58, Total=992 [2022-11-22 01:51:23,089 INFO L87 Difference]: Start difference. First operand 2220 states and 8282 transitions. Second operand has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 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-22 01:51:53,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:51:53,978 INFO L93 Difference]: Finished difference Result 2906 states and 10261 transitions. [2022-11-22 01:51:53,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-22 01:51:53,979 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 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 14 [2022-11-22 01:51:53,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:51:53,986 INFO L225 Difference]: With dead ends: 2906 [2022-11-22 01:51:53,987 INFO L226 Difference]: Without dead ends: 2906 [2022-11-22 01:51:53,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 34.9s TimeCoverageRelationStatistics Valid=342, Invalid=2299, Unknown=15, NotChecked=100, Total=2756 [2022-11-22 01:51:53,987 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 246 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:51:53,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 0 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1000 Invalid, 0 Unknown, 61 Unchecked, 1.4s Time] [2022-11-22 01:51:53,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2022-11-22 01:51:54,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 2220. [2022-11-22 01:51:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2220 states, 2186 states have (on average 3.786825251601098) internal successors, (8278), 2219 states have internal predecessors, (8278), 0 states have call successors, (0), 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-22 01:51:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 8278 transitions. [2022-11-22 01:51:54,033 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 8278 transitions. Word has length 14 [2022-11-22 01:51:54,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:51:54,033 INFO L495 AbstractCegarLoop]: Abstraction has 2220 states and 8278 transitions. [2022-11-22 01:51:54,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 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-22 01:51:54,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 8278 transitions. [2022-11-22 01:51:54,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 01:51:54,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:51:54,035 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:51:54,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-11-22 01:51:54,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2022-11-22 01:51:54,236 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:51:54,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:51:54,236 INFO L85 PathProgramCache]: Analyzing trace with hash -279391076, now seen corresponding path program 1 times [2022-11-22 01:51:54,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:51:54,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34255829] [2022-11-22 01:51:54,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:51:54,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:51:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:51:54,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:51:54,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:51:54,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34255829] [2022-11-22 01:51:54,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34255829] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:51:54,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238728400] [2022-11-22 01:51:54,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:51:54,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:51:54,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:51:54,801 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:51:54,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-11-22 01:51:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:51:55,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-22 01:51:55,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:51:55,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:51:55,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:51:55,512 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 25 treesize of output 24 [2022-11-22 01:51:55,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:51:55,579 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 16 treesize of output 18 [2022-11-22 01:51:55,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:51:55,692 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 16 treesize of output 18 [2022-11-22 01:51:55,851 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:51:55,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:51:56,147 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2017 (Array Int Int)) (v_~i~0_274 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2017) c_~A~0.base))) (let ((.cse1 (select .cse0 (+ c_~A~0.offset (* v_~i~0_274 4))))) (or (< (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork1_#t~post7#1| 4) 4)) .cse1) 2147483648) (not (<= .cse1 0)) (not (<= 0 (+ 9223372039002259455 .cse1))))))) is different from false [2022-11-22 01:51:56,316 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2017 (Array Int Int)) (v_ArrVal_2016 (Array Int Int)) (v_~i~0_274 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2016) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2017) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse1 (+ (* v_~i~0_274 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (<= .cse0 0)) (not (<= 0 (+ 9223372039002259455 .cse0))) (< (+ (select .cse1 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse0) 2147483648))))) is different from false [2022-11-22 01:51:56,337 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2017 (Array Int Int)) (v_ArrVal_2016 (Array Int Int)) (v_ArrVal_2015 Int) (v_~i~0_274 Int)) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_2015)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2016) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2017) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse1 (+ (* v_~i~0_274 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (<= .cse0 0)) (< (+ (select .cse1 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse0) 2147483648) (not (<= 0 (+ 9223372039002259455 .cse0))))))) is different from false [2022-11-22 01:51:56,369 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-22 01:51:56,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 146 treesize of output 94 [2022-11-22 01:51:56,415 INFO L321 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2022-11-22 01:51:56,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 533 treesize of output 492 [2022-11-22 01:51:56,432 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-22 01:51:56,433 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 462 treesize of output 418 [2022-11-22 01:51:56,448 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-22 01:51:56,449 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 418 treesize of output 330 [2022-11-22 01:51:56,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-22 01:51:56,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238728400] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:51:56,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [292095509] [2022-11-22 01:51:56,705 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:336) 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-22 01:51:56,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:51:56,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-11-22 01:51:56,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30466541] [2022-11-22 01:51:56,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:51:56,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-22 01:51:56,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:51:56,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-22 01:51:56,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=527, Unknown=6, NotChecked=144, Total=756 [2022-11-22 01:51:56,707 INFO L87 Difference]: Start difference. First operand 2220 states and 8278 transitions. Second operand has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 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-22 01:51:58,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:51:58,947 INFO L93 Difference]: Finished difference Result 4864 states and 16789 transitions. [2022-11-22 01:51:58,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-22 01:51:58,948 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 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 14 [2022-11-22 01:51:58,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:51:58,960 INFO L225 Difference]: With dead ends: 4864 [2022-11-22 01:51:58,960 INFO L226 Difference]: Without dead ends: 4864 [2022-11-22 01:51:58,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=261, Invalid=1305, Unknown=6, NotChecked=234, Total=1806 [2022-11-22 01:51:58,961 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 445 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 252 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:51:58,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 0 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 848 Invalid, 0 Unknown, 252 Unchecked, 1.4s Time] [2022-11-22 01:51:58,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4864 states. [2022-11-22 01:51:59,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4864 to 2535. [2022-11-22 01:51:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2535 states, 2501 states have (on average 3.8688524590163933) internal successors, (9676), 2534 states have internal predecessors, (9676), 0 states have call successors, (0), 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-22 01:51:59,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 9676 transitions. [2022-11-22 01:51:59,020 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 9676 transitions. Word has length 14 [2022-11-22 01:51:59,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:51:59,021 INFO L495 AbstractCegarLoop]: Abstraction has 2535 states and 9676 transitions. [2022-11-22 01:51:59,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 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-22 01:51:59,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 9676 transitions. [2022-11-22 01:51:59,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 01:51:59,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:51:59,023 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:51:59,030 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-11-22 01:51:59,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-11-22 01:51:59,227 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:51:59,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:51:59,227 INFO L85 PathProgramCache]: Analyzing trace with hash -639564266, now seen corresponding path program 2 times [2022-11-22 01:51:59,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:51:59,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572850845] [2022-11-22 01:51:59,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:51:59,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:51:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:51:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:51:59,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:51:59,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572850845] [2022-11-22 01:51:59,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572850845] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:51:59,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221042289] [2022-11-22 01:51:59,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:51:59,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:51:59,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:51:59,846 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:51:59,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-11-22 01:52:00,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-22 01:52:00,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:52:00,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-22 01:52:00,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:52:00,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:52:00,556 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-22 01:52:00,557 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-22 01:52:00,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:52:00,623 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 16 treesize of output 18 [2022-11-22 01:52:00,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:52:00,785 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 16 treesize of output 18 [2022-11-22 01:52:00,890 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:52:00,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:52:03,291 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int)) (v_~i~0_277 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2061) c_~A~0.base))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* v_~i~0_277 4))))) (or (not (<= .cse0 0)) (< (+ .cse0 (select .cse1 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork1_#t~post7#1| 4) 4))) 2147483648) (not (<= 0 (+ 9223372039002259455 .cse0))))))) is different from false [2022-11-22 01:52:03,309 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int)) (v_~i~0_277 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2061) c_~A~0.base))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* v_~i~0_277 4))))) (or (not (<= .cse0 0)) (< (+ .cse0 (select .cse1 (+ c_~A~0.offset (* c_~i~0 4) 4))) 2147483648) (not (<= 0 (+ 9223372039002259455 .cse0))))))) is different from false [2022-11-22 01:52:03,359 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2060 (Array Int Int)) (v_~i~0_277 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2060) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2061) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse1 (+ (* v_~i~0_277 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< (+ .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 2147483648) (not (<= .cse0 0)) (not (<= 0 (+ 9223372039002259455 .cse0))))))) is different from false [2022-11-22 01:52:03,545 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-22 01:52:03,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 146 treesize of output 94 [2022-11-22 01:52:03,589 INFO L321 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2022-11-22 01:52:03,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 257 treesize of output 246 [2022-11-22 01:52:03,603 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-22 01:52:03,603 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 216 treesize of output 172 [2022-11-22 01:52:03,617 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-22 01:52:03,618 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 147 treesize of output 125 [2022-11-22 01:52:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-22 01:52:03,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221042289] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:52:03,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2127043414] [2022-11-22 01:52:03,840 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:336) 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-22 01:52:03,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:52:03,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-22 01:52:03,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107516530] [2022-11-22 01:52:03,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:52:03,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-22 01:52:03,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:52:03,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-22 01:52:03,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=572, Unknown=16, NotChecked=150, Total=812 [2022-11-22 01:52:03,842 INFO L87 Difference]: Start difference. First operand 2535 states and 9676 transitions. Second operand has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 0 states have call successors, (0), 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-22 01:52:06,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:52:06,837 INFO L93 Difference]: Finished difference Result 5253 states and 18391 transitions. [2022-11-22 01:52:06,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-22 01:52:06,837 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 0 states have call successors, (0), 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 14 [2022-11-22 01:52:06,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:52:06,850 INFO L225 Difference]: With dead ends: 5253 [2022-11-22 01:52:06,850 INFO L226 Difference]: Without dead ends: 5253 [2022-11-22 01:52:06,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=291, Invalid=1427, Unknown=16, NotChecked=246, Total=1980 [2022-11-22 01:52:06,851 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 660 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 340 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:52:06,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 0 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 867 Invalid, 0 Unknown, 340 Unchecked, 1.3s Time] [2022-11-22 01:52:06,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5253 states. [2022-11-22 01:52:06,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5253 to 2435. [2022-11-22 01:52:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2435 states, 2401 states have (on average 3.818408996251562) internal successors, (9168), 2434 states have internal predecessors, (9168), 0 states have call successors, (0), 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-22 01:52:06,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 9168 transitions. [2022-11-22 01:52:06,907 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 9168 transitions. Word has length 14 [2022-11-22 01:52:06,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:52:06,907 INFO L495 AbstractCegarLoop]: Abstraction has 2435 states and 9168 transitions. [2022-11-22 01:52:06,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 0 states have call successors, (0), 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-22 01:52:06,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 9168 transitions. [2022-11-22 01:52:06,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 01:52:06,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:52:06,909 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:52:06,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-11-22 01:52:07,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:52:07,109 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:52:07,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:52:07,110 INFO L85 PathProgramCache]: Analyzing trace with hash -395575981, now seen corresponding path program 1 times [2022-11-22 01:52:07,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:52:07,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890555119] [2022-11-22 01:52:07,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:52:07,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:52:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:52:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 01:52:07,720 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:52:07,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890555119] [2022-11-22 01:52:07,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890555119] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:52:07,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344269195] [2022-11-22 01:52:07,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:52:07,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:52:07,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:52:07,723 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:52:07,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-11-22 01:52:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:52:08,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-22 01:52:08,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:52:09,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:52:09,069 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 29 treesize of output 29 [2022-11-22 01:52:09,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2022-11-22 01:52:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 01:52:09,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:52:10,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:52:10,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 307 treesize of output 239 [2022-11-22 01:52:10,270 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 108 treesize of output 102 [2022-11-22 01:52:10,282 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 102 treesize of output 96 [2022-11-22 01:52:10,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 01:52:10,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344269195] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:52:10,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1613673551] [2022-11-22 01:52:10,650 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:336) 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-22 01:52:10,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:52:10,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-11-22 01:52:10,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933844816] [2022-11-22 01:52:10,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:52:10,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-22 01:52:10,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:52:10,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-22 01:52:10,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=348, Unknown=3, NotChecked=0, Total=420 [2022-11-22 01:52:10,652 INFO L87 Difference]: Start difference. First operand 2435 states and 9168 transitions. Second operand has 21 states, 20 states have (on average 1.65) internal successors, (33), 20 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-22 01:52:14,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:52:14,289 INFO L93 Difference]: Finished difference Result 4378 states and 15583 transitions. [2022-11-22 01:52:14,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-22 01:52:14,290 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.65) internal successors, (33), 20 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 14 [2022-11-22 01:52:14,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:52:14,300 INFO L225 Difference]: With dead ends: 4378 [2022-11-22 01:52:14,300 INFO L226 Difference]: Without dead ends: 4378 [2022-11-22 01:52:14,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=452, Invalid=1351, Unknown=3, NotChecked=0, Total=1806 [2022-11-22 01:52:14,301 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 656 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-22 01:52:14,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 0 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-22 01:52:14,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4378 states. [2022-11-22 01:52:14,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4378 to 2137. [2022-11-22 01:52:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2137 states, 2113 states have (on average 3.860861334595362) internal successors, (8158), 2136 states have internal predecessors, (8158), 0 states have call successors, (0), 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-22 01:52:14,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 8158 transitions. [2022-11-22 01:52:14,346 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 8158 transitions. Word has length 14 [2022-11-22 01:52:14,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:52:14,346 INFO L495 AbstractCegarLoop]: Abstraction has 2137 states and 8158 transitions. [2022-11-22 01:52:14,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.65) internal successors, (33), 20 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-22 01:52:14,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 8158 transitions. [2022-11-22 01:52:14,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 01:52:14,348 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:52:14,348 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-22 01:52:14,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-11-22 01:52:14,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-11-22 01:52:14,555 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-22 01:52:14,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:52:14,555 INFO L85 PathProgramCache]: Analyzing trace with hash 972441602, now seen corresponding path program 2 times [2022-11-22 01:52:14,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:52:14,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668826788] [2022-11-22 01:52:14,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:52:14,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:52:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:52:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:52:15,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:52:15,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668826788] [2022-11-22 01:52:15,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668826788] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:52:15,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104953068] [2022-11-22 01:52:15,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:52:15,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:52:15,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:52:15,130 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:52:15,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0386adeb-506e-46fe-abf6-27840459478a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-11-22 01:52:15,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-22 01:52:15,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:52:15,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-22 01:52:15,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:52:15,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:52:15,937 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-22 01:52:15,937 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 1 case distinctions, treesize of input 29 treesize of output 36 [2022-11-22 01:52:16,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:52:16,068 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 33 treesize of output 35 [2022-11-22 01:52:16,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:52:16,184 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 33 treesize of output 35 [2022-11-22 01:52:16,445 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:52:16,446 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 38 treesize of output 34 [2022-11-22 01:52:16,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:52:16,661 INFO L328 TraceCheckSpWp]: Computing backward predicates...