./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5e519f3a 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_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI --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 4018a1168c08743b2a9b9283b6137e1dcc53bdf8ab8362348f4bbe02762305c3 --- 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-5e519f3 [2022-11-03 03:41:19,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:41:19,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:41:19,247 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:41:19,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:41:19,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:41:19,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:41:19,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:41:19,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:41:19,266 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:41:19,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:41:19,269 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:41:19,269 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:41:19,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:41:19,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:41:19,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:41:19,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:41:19,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:41:19,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:41:19,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:41:19,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:41:19,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:41:19,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:41:19,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:41:19,304 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:41:19,305 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:41:19,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:41:19,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:41:19,308 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:41:19,309 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:41:19,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:41:19,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:41:19,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:41:19,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:41:19,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:41:19,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:41:19,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:41:19,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:41:19,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:41:19,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:41:19,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:41:19,320 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-03 03:41:19,360 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:41:19,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:41:19,361 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:41:19,361 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:41:19,362 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:41:19,362 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:41:19,362 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:41:19,362 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:41:19,363 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:41:19,363 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:41:19,364 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:41:19,364 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:41:19,364 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:41:19,364 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:41:19,364 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:41:19,365 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:41:19,365 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:41:19,365 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:41:19,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:41:19,366 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:41:19,366 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 03:41:19,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:41:19,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:41:19,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:41:19,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:41:19,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:41:19,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:41:19,367 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-03 03:41:19,367 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:41:19,367 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:41:19,368 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:41:19,368 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:41:19,368 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:41:19,368 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:41:19,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:41:19,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:41:19,369 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:41:19,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:41:19,369 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:41:19,370 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:41:19,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:41:19,370 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:41:19,370 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:41:19,370 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_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/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_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI 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 -> 4018a1168c08743b2a9b9283b6137e1dcc53bdf8ab8362348f4bbe02762305c3 [2022-11-03 03:41:19,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:41:19,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:41:19,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:41:19,663 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:41:19,664 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:41:19,665 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c [2022-11-03 03:41:19,728 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/data/cef66bfdc/6444aa5e896a466ca238a85809c9c17e/FLAG565a4edd8 [2022-11-03 03:41:20,210 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:41:20,211 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c [2022-11-03 03:41:20,220 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/data/cef66bfdc/6444aa5e896a466ca238a85809c9c17e/FLAG565a4edd8 [2022-11-03 03:41:20,572 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/data/cef66bfdc/6444aa5e896a466ca238a85809c9c17e [2022-11-03 03:41:20,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:41:20,576 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:41:20,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:41:20,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:41:20,582 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:41:20,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:41:20" (1/1) ... [2022-11-03 03:41:20,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d0d576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:20, skipping insertion in model container [2022-11-03 03:41:20,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:41:20" (1/1) ... [2022-11-03 03:41:20,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:41:20,609 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:41:20,893 WARN L230 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_93d20b01-338a-4747-9acc-05af57ebc4c3/sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2022-11-03 03:41:20,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:41:20,919 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:41:20,962 WARN L230 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_93d20b01-338a-4747-9acc-05af57ebc4c3/sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2022-11-03 03:41:20,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:41:20,987 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:41:20,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:20 WrapperNode [2022-11-03 03:41:20,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:41:20,989 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:41:20,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:41:20,989 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:41:20,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:20" (1/1) ... [2022-11-03 03:41:21,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:20" (1/1) ... [2022-11-03 03:41:21,067 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 241 [2022-11-03 03:41:21,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:41:21,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:41:21,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:41:21,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:41:21,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:20" (1/1) ... [2022-11-03 03:41:21,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:20" (1/1) ... [2022-11-03 03:41:21,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:20" (1/1) ... [2022-11-03 03:41:21,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:20" (1/1) ... [2022-11-03 03:41:21,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:20" (1/1) ... [2022-11-03 03:41:21,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:20" (1/1) ... [2022-11-03 03:41:21,114 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:20" (1/1) ... [2022-11-03 03:41:21,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:20" (1/1) ... [2022-11-03 03:41:21,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:41:21,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:41:21,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:41:21,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:41:21,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:20" (1/1) ... [2022-11-03 03:41:21,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:41:21,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:41:21,157 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:41:21,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:41:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:41:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:41:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 03:41:21,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 03:41:21,197 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-03 03:41:21,197 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-03 03:41:21,197 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-03 03:41:21,197 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-03 03:41:21,197 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-03 03:41:21,198 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-03 03:41:21,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:41:21,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 03:41:21,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 03:41:21,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 03:41:21,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:41:21,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:41:21,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:41:21,200 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 03:41:21,326 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:41:21,334 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:41:21,887 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:41:22,421 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:41:22,421 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-03 03:41:22,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:41:22 BoogieIcfgContainer [2022-11-03 03:41:22,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:41:22,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:41:22,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:41:22,430 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:41:22,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:41:20" (1/3) ... [2022-11-03 03:41:22,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab99e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:41:22, skipping insertion in model container [2022-11-03 03:41:22,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:20" (2/3) ... [2022-11-03 03:41:22,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab99e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:41:22, skipping insertion in model container [2022-11-03 03:41:22,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:41:22" (3/3) ... [2022-11-03 03:41:22,440 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2022-11-03 03:41:22,453 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 03:41:22,464 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:41:22,464 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2022-11-03 03:41:22,464 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 03:41:22,675 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-03 03:41:22,728 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 03:41:22,744 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 186 transitions, 396 flow [2022-11-03 03:41:22,750 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 186 transitions, 396 flow [2022-11-03 03:41:22,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 186 transitions, 396 flow [2022-11-03 03:41:22,878 INFO L130 PetriNetUnfolder]: 12/183 cut-off events. [2022-11-03 03:41:22,879 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-03 03:41:22,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 183 events. 12/183 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 233 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 136. Up to 2 conditions per place. [2022-11-03 03:41:22,888 INFO L118 LiptonReduction]: Number of co-enabled transitions 3840 [2022-11-03 03:41:45,185 INFO L133 LiptonReduction]: Checked pairs total: 5243 [2022-11-03 03:41:45,185 INFO L135 LiptonReduction]: Total number of compositions: 196 [2022-11-03 03:41:45,194 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 53 transitions, 130 flow [2022-11-03 03:41:45,365 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3189 states, 2459 states have (on average 4.410736071573811) internal successors, (10846), 3188 states have internal predecessors, (10846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:45,383 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:41:45,390 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;@7696e9b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:41:45,390 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2022-11-03 03:41:45,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 3189 states, 2459 states have (on average 4.410736071573811) internal successors, (10846), 3188 states have internal predecessors, (10846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:45,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-03 03:41:45,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:41:45,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-03 03:41:45,409 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:41:45,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:41:45,414 INFO L85 PathProgramCache]: Analyzing trace with hash 35633, now seen corresponding path program 1 times [2022-11-03 03:41:45,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:41:45,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598183287] [2022-11-03 03:41:45,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:45,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:41:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:45,785 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-03 03:41:45,785 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:41:45,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598183287] [2022-11-03 03:41:45,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598183287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:41:45,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:41:45,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:41:45,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391757336] [2022-11-03 03:41:45,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:41:45,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:41:45,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:41:45,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:41:45,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:41:45,840 INFO L87 Difference]: Start difference. First operand has 3189 states, 2459 states have (on average 4.410736071573811) internal successors, (10846), 3188 states have internal predecessors, (10846), 0 states have call successors, (0), 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-03 03:41:46,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:41:46,174 INFO L93 Difference]: Finished difference Result 3631 states and 12269 transitions. [2022-11-03 03:41:46,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:41:46,177 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-03 03:41:46,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:41:46,227 INFO L225 Difference]: With dead ends: 3631 [2022-11-03 03:41:46,227 INFO L226 Difference]: Without dead ends: 3631 [2022-11-03 03:41:46,228 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-03 03:41:46,232 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 38 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:41:46,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 6 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:41:46,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3631 states. [2022-11-03 03:41:46,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3631 to 1818. [2022-11-03 03:41:46,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1474 states have (on average 4.164179104477612) internal successors, (6138), 1817 states have internal predecessors, (6138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 6138 transitions. [2022-11-03 03:41:46,391 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 6138 transitions. Word has length 2 [2022-11-03 03:41:46,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:41:46,391 INFO L495 AbstractCegarLoop]: Abstraction has 1818 states and 6138 transitions. [2022-11-03 03:41:46,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-03 03:41:46,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 6138 transitions. [2022-11-03 03:41:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:41:46,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:41:46,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:41:46,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:41:46,393 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:41:46,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:41:46,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1106249, now seen corresponding path program 1 times [2022-11-03 03:41:46,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:41:46,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379496111] [2022-11-03 03:41:46,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:46,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:41:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:46,491 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-03 03:41:46,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:41:46,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379496111] [2022-11-03 03:41:46,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379496111] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:41:46,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295054007] [2022-11-03 03:41:46,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:46,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:41:46,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:41:46,496 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:41:46,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 03:41:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:46,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 03:41:46,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:41:46,836 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-03 03:41:46,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:41:46,863 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-03 03:41:46,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295054007] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:41:46,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2100308621] [2022-11-03 03:41:46,876 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-03 03:41:46,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:41:46,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2022-11-03 03:41:46,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748003923] [2022-11-03 03:41:46,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:41:46,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 03:41:46,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:41:46,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 03:41:46,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:41:46,885 INFO L87 Difference]: Start difference. First operand 1818 states and 6138 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:47,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:41:47,490 INFO L93 Difference]: Finished difference Result 9073 states and 30671 transitions. [2022-11-03 03:41:47,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:41:47,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 03:41:47,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:41:47,583 INFO L225 Difference]: With dead ends: 9073 [2022-11-03 03:41:47,584 INFO L226 Difference]: Without dead ends: 9073 [2022-11-03 03:41:47,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:41:47,585 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 228 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:41:47,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 15 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:41:47,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9073 states. [2022-11-03 03:41:47,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9073 to 1821. [2022-11-03 03:41:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1477 states have (on average 4.161814488828707) internal successors, (6147), 1820 states have internal predecessors, (6147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:47,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 6147 transitions. [2022-11-03 03:41:47,748 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 6147 transitions. Word has length 3 [2022-11-03 03:41:47,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:41:47,748 INFO L495 AbstractCegarLoop]: Abstraction has 1821 states and 6147 transitions. [2022-11-03 03:41:47,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:47,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 6147 transitions. [2022-11-03 03:41:47,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:41:47,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:41:47,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:41:47,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:41:47,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:41:47,971 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:41:47,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:41:47,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1106250, now seen corresponding path program 1 times [2022-11-03 03:41:47,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:41:47,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994052076] [2022-11-03 03:41:47,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:47,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:41:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:48,116 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-03 03:41:48,116 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:41:48,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994052076] [2022-11-03 03:41:48,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994052076] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:41:48,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268992281] [2022-11-03 03:41:48,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:48,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:41:48,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:41:48,119 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:41:48,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 03:41:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:48,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 03:41:48,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:41:48,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:41:48,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:41:48,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268992281] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:41:48,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:41:48,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2022-11-03 03:41:48,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51450692] [2022-11-03 03:41:48,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:41:48,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:41:48,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:41:48,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:41:48,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:41:48,305 INFO L87 Difference]: Start difference. First operand 1821 states and 6147 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:48,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:41:48,641 INFO L93 Difference]: Finished difference Result 3633 states and 12274 transitions. [2022-11-03 03:41:48,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:41:48,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 03:41:48,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:41:48,703 INFO L225 Difference]: With dead ends: 3633 [2022-11-03 03:41:48,703 INFO L226 Difference]: Without dead ends: 3633 [2022-11-03 03:41:48,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:41:48,704 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 78 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:41:48,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 9 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:41:48,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3633 states. [2022-11-03 03:41:48,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3633 to 1820. [2022-11-03 03:41:48,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1820 states, 1477 states have (on average 4.159106296547055) internal successors, (6143), 1819 states have internal predecessors, (6143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:48,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 6143 transitions. [2022-11-03 03:41:48,858 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 6143 transitions. Word has length 3 [2022-11-03 03:41:48,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:41:48,859 INFO L495 AbstractCegarLoop]: Abstraction has 1820 states and 6143 transitions. [2022-11-03 03:41:48,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 6143 transitions. [2022-11-03 03:41:48,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 03:41:48,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:41:48,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 03:41:48,902 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 03:41:49,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:41:49,075 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:41:49,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:41:49,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1063610279, now seen corresponding path program 1 times [2022-11-03 03:41:49,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:41:49,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552532882] [2022-11-03 03:41:49,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:49,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:41:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:49,214 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-03 03:41:49,215 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:41:49,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552532882] [2022-11-03 03:41:49,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552532882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:41:49,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:41:49,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:41:49,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971011596] [2022-11-03 03:41:49,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:41:49,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:41:49,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:41:49,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:41:49,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:41:49,217 INFO L87 Difference]: Start difference. First operand 1820 states and 6143 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:49,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:41:49,500 INFO L93 Difference]: Finished difference Result 2467 states and 8113 transitions. [2022-11-03 03:41:49,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:41:49,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-03 03:41:49,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:41:49,519 INFO L225 Difference]: With dead ends: 2467 [2022-11-03 03:41:49,520 INFO L226 Difference]: Without dead ends: 2463 [2022-11-03 03:41:49,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:41:49,522 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 85 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:41:49,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 13 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:41:49,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2022-11-03 03:41:49,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 2241. [2022-11-03 03:41:49,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2241 states, 1898 states have (on average 4.067439409905163) internal successors, (7720), 2240 states have internal predecessors, (7720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:49,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 7720 transitions. [2022-11-03 03:41:49,668 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 7720 transitions. Word has length 5 [2022-11-03 03:41:49,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:41:49,669 INFO L495 AbstractCegarLoop]: Abstraction has 2241 states and 7720 transitions. [2022-11-03 03:41:49,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:49,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 7720 transitions. [2022-11-03 03:41:49,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 03:41:49,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:41:49,671 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1] [2022-11-03 03:41:49,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 03:41:49,672 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:41:49,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:41:49,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1401859791, now seen corresponding path program 2 times [2022-11-03 03:41:49,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:41:49,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607921770] [2022-11-03 03:41:49,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:49,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:41:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:49,858 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-03 03:41:49,859 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:41:49,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607921770] [2022-11-03 03:41:49,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607921770] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:41:49,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487739695] [2022-11-03 03:41:49,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:41:49,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:41:49,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:41:49,861 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:41:49,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 03:41:50,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 03:41:50,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:41:50,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 03:41:50,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:41:50,102 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-03 03:41:50,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:41:50,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487739695] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:41:50,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:41:50,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2022-11-03 03:41:50,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238079134] [2022-11-03 03:41:50,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:41:50,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:41:50,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:41:50,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:41:50,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:41:50,105 INFO L87 Difference]: Start difference. First operand 2241 states and 7720 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-03 03:41:50,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:41:50,211 INFO L93 Difference]: Finished difference Result 2240 states and 7719 transitions. [2022-11-03 03:41:50,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:41:50,211 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-03 03:41:50,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:41:50,232 INFO L225 Difference]: With dead ends: 2240 [2022-11-03 03:41:50,232 INFO L226 Difference]: Without dead ends: 2240 [2022-11-03 03:41:50,233 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-03 03:41:50,238 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:41:50,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:41:50,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2022-11-03 03:41:50,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 2237. [2022-11-03 03:41:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2237 states, 1895 states have (on average 4.070184696569921) internal successors, (7713), 2236 states have internal predecessors, (7713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:50,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 7713 transitions. [2022-11-03 03:41:50,336 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 7713 transitions. Word has length 6 [2022-11-03 03:41:50,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:41:50,338 INFO L495 AbstractCegarLoop]: Abstraction has 2237 states and 7713 transitions. [2022-11-03 03:41:50,338 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-03 03:41:50,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 7713 transitions. [2022-11-03 03:41:50,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 03:41:50,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:41:50,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 03:41:50,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:41:50,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:41:50,555 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:41:50,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:41:50,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1401406833, now seen corresponding path program 1 times [2022-11-03 03:41:50,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:41:50,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450399759] [2022-11-03 03:41:50,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:50,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:41:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:51,041 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-03 03:41:51,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:41:51,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450399759] [2022-11-03 03:41:51,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450399759] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:41:51,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194280175] [2022-11-03 03:41:51,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:51,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:41:51,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:41:51,046 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:41:51,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 03:41:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:51,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-03 03:41:51,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:41:51,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:41:51,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:41:51,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:41:51,404 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-03 03:41:51,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:41:51,455 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-11-03 03:41:51,479 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:41:51,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:41:51,491 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:41:51,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:41:51,534 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-03 03:41:51,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194280175] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:41:51,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1407716661] [2022-11-03 03:41:51,535 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java: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-03 03:41:51,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:41:51,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-11-03 03:41:51,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588594609] [2022-11-03 03:41:51,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:41:51,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 03:41:51,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:41:51,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 03:41:51,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2022-11-03 03:41:51,539 INFO L87 Difference]: Start difference. First operand 2237 states and 7713 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-03 03:41:52,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:41:52,180 INFO L93 Difference]: Finished difference Result 3369 states and 10314 transitions. [2022-11-03 03:41:52,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:41:52,181 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-03 03:41:52,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:41:52,199 INFO L225 Difference]: With dead ends: 3369 [2022-11-03 03:41:52,199 INFO L226 Difference]: Without dead ends: 3369 [2022-11-03 03:41:52,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=231, Unknown=1, NotChecked=32, Total=342 [2022-11-03 03:41:52,200 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 160 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:41:52,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 33 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 414 Invalid, 0 Unknown, 81 Unchecked, 0.4s Time] [2022-11-03 03:41:52,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3369 states. [2022-11-03 03:41:52,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3369 to 2238. [2022-11-03 03:41:52,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2238 states, 1896 states have (on average 4.07120253164557) internal successors, (7719), 2237 states have internal predecessors, (7719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:52,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 7719 transitions. [2022-11-03 03:41:52,313 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 7719 transitions. Word has length 6 [2022-11-03 03:41:52,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:41:52,314 INFO L495 AbstractCegarLoop]: Abstraction has 2238 states and 7719 transitions. [2022-11-03 03:41:52,314 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-03 03:41:52,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 7719 transitions. [2022-11-03 03:41:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 03:41:52,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:41:52,315 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 03:41:52,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:41:52,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-03 03:41:52,531 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:41:52,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:41:52,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1401406839, now seen corresponding path program 1 times [2022-11-03 03:41:52,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:41:52,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80337440] [2022-11-03 03:41:52,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:52,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:41:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:52,652 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-03 03:41:52,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:41:52,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80337440] [2022-11-03 03:41:52,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80337440] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:41:52,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:41:52,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:41:52,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987660092] [2022-11-03 03:41:52,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:41:52,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:41:52,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:41:52,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:41:52,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:41:52,655 INFO L87 Difference]: Start difference. First operand 2238 states and 7719 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-03 03:41:52,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:41:52,795 INFO L93 Difference]: Finished difference Result 3138 states and 11078 transitions. [2022-11-03 03:41:52,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:41:52,796 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-03 03:41:52,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:41:52,814 INFO L225 Difference]: With dead ends: 3138 [2022-11-03 03:41:52,814 INFO L226 Difference]: Without dead ends: 3138 [2022-11-03 03:41:52,815 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-03 03:41:52,815 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 30 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:41:52,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 5 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:41:52,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2022-11-03 03:41:52,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2419. [2022-11-03 03:41:52,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2419 states, 2077 states have (on average 4.450168512277323) internal successors, (9243), 2418 states have internal predecessors, (9243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 9243 transitions. [2022-11-03 03:41:52,949 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 9243 transitions. Word has length 6 [2022-11-03 03:41:52,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:41:52,950 INFO L495 AbstractCegarLoop]: Abstraction has 2419 states and 9243 transitions. [2022-11-03 03:41:52,950 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-03 03:41:52,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 9243 transitions. [2022-11-03 03:41:52,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 03:41:52,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:41:52,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 03:41:52,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 03:41:52,952 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:41:52,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:41:52,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1401406837, now seen corresponding path program 1 times [2022-11-03 03:41:52,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:41:52,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075427567] [2022-11-03 03:41:52,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:52,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:41:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:53,210 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-03 03:41:53,210 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:41:53,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075427567] [2022-11-03 03:41:53,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075427567] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:41:53,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029923001] [2022-11-03 03:41:53,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:53,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:41:53,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:41:53,228 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:41:53,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 03:41:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:53,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-03 03:41:53,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:41:53,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:41:53,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:41:53,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:41:53,494 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-03 03:41:53,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:41:53,534 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_248 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248) |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-03 03:41:53,549 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:41:53,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:41:53,557 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:41:53,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:41:53,586 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-03 03:41:53,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029923001] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:41:53,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [715044953] [2022-11-03 03:41:53,587 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-03 03:41:53,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:41:53,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-11-03 03:41:53,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209004326] [2022-11-03 03:41:53,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:41:53,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 03:41:53,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:41:53,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 03:41:53,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2022-11-03 03:41:53,589 INFO L87 Difference]: Start difference. First operand 2419 states and 9243 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-03 03:41:54,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:41:54,322 INFO L93 Difference]: Finished difference Result 3547 states and 11834 transitions. [2022-11-03 03:41:54,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:41:54,323 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-03 03:41:54,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:41:54,348 INFO L225 Difference]: With dead ends: 3547 [2022-11-03 03:41:54,348 INFO L226 Difference]: Without dead ends: 3547 [2022-11-03 03:41:54,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=231, Unknown=1, NotChecked=32, Total=342 [2022-11-03 03:41:54,351 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 125 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:41:54,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 46 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 540 Invalid, 0 Unknown, 96 Unchecked, 0.5s Time] [2022-11-03 03:41:54,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3547 states. [2022-11-03 03:41:54,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3547 to 2419. [2022-11-03 03:41:54,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2419 states, 2077 states have (on average 4.449687048627829) internal successors, (9242), 2418 states have internal predecessors, (9242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:54,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 9242 transitions. [2022-11-03 03:41:54,459 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 9242 transitions. Word has length 6 [2022-11-03 03:41:54,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:41:54,459 INFO L495 AbstractCegarLoop]: Abstraction has 2419 states and 9242 transitions. [2022-11-03 03:41:54,459 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-03 03:41:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 9242 transitions. [2022-11-03 03:41:54,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 03:41:54,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:41:54,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:41:54,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 03:41:54,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:41:54,675 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:41:54,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:41:54,675 INFO L85 PathProgramCache]: Analyzing trace with hash -493731783, now seen corresponding path program 1 times [2022-11-03 03:41:54,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:41:54,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196728750] [2022-11-03 03:41:54,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:54,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:41:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:55,064 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-03 03:41:55,064 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:41:55,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196728750] [2022-11-03 03:41:55,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196728750] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:41:55,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24588632] [2022-11-03 03:41:55,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:55,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:41:55,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:41:55,067 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:41:55,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 03:41:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:55,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-03 03:41:55,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:41:55,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:41:55,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:41:55,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:41:55,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:41:55,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:41:55,413 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-03 03:41:55,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:41:55,458 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_292 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-11-03 03:41:55,472 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-11-03 03:41:55,486 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:41:55,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:41:55,495 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:41:55,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:41:55,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:41:55,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:41:55,571 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-03 03:41:55,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24588632] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:41:55,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1038213455] [2022-11-03 03:41:55,572 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-03 03:41:55,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:41:55,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-11-03 03:41:55,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416240993] [2022-11-03 03:41:55,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:41:55,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 03:41:55,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:41:55,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 03:41:55,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=167, Unknown=2, NotChecked=54, Total=272 [2022-11-03 03:41:55,575 INFO L87 Difference]: Start difference. First operand 2419 states and 9242 transitions. Second operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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-03 03:41:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:41:56,532 INFO L93 Difference]: Finished difference Result 3517 states and 11747 transitions. [2022-11-03 03:41:56,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:41:56,532 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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-03 03:41:56,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:41:56,553 INFO L225 Difference]: With dead ends: 3517 [2022-11-03 03:41:56,554 INFO L226 Difference]: Without dead ends: 3517 [2022-11-03 03:41:56,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=291, Unknown=2, NotChecked=74, Total=462 [2022-11-03 03:41:56,556 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 182 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:41:56,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 54 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 621 Invalid, 0 Unknown, 191 Unchecked, 0.7s Time] [2022-11-03 03:41:56,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3517 states. [2022-11-03 03:41:56,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3517 to 2419. [2022-11-03 03:41:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2419 states, 2077 states have (on average 4.435243139142995) internal successors, (9212), 2418 states have internal predecessors, (9212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:56,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 9212 transitions. [2022-11-03 03:41:56,650 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 9212 transitions. Word has length 7 [2022-11-03 03:41:56,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:41:56,650 INFO L495 AbstractCegarLoop]: Abstraction has 2419 states and 9212 transitions. [2022-11-03 03:41:56,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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-03 03:41:56,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 9212 transitions. [2022-11-03 03:41:56,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 03:41:56,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:41:56,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:41:56,692 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 03:41:56,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:41:56,875 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:41:56,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:41:56,875 INFO L85 PathProgramCache]: Analyzing trace with hash -493731787, now seen corresponding path program 1 times [2022-11-03 03:41:56,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:41:56,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705656215] [2022-11-03 03:41:56,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:56,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:41:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:57,279 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-03 03:41:57,279 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:41:57,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705656215] [2022-11-03 03:41:57,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705656215] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:41:57,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233517355] [2022-11-03 03:41:57,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:57,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:41:57,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:41:57,283 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:41:57,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 03:41:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:57,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-03 03:41:57,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:41:57,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:41:57,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:41:57,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:41:57,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:41:57,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:41:57,596 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-03 03:41:57,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:41:57,636 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_336) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-11-03 03:41:57,646 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (v_ArrVal_335 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_335) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_336) |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-03 03:41:57,659 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:41:57,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:41:57,668 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:41:57,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:41:57,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:41:57,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:41:57,781 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-03 03:41:57,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233517355] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:41:57,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1619883103] [2022-11-03 03:41:57,782 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-03 03:41:57,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:41:57,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-11-03 03:41:57,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701442821] [2022-11-03 03:41:57,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:41:57,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 03:41:57,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:41:57,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 03:41:57,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=167, Unknown=2, NotChecked=54, Total=272 [2022-11-03 03:41:57,785 INFO L87 Difference]: Start difference. First operand 2419 states and 9212 transitions. Second operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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-03 03:41:58,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:41:58,561 INFO L93 Difference]: Finished difference Result 3507 states and 11718 transitions. [2022-11-03 03:41:58,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:41:58,561 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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-03 03:41:58,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:41:58,581 INFO L225 Difference]: With dead ends: 3507 [2022-11-03 03:41:58,581 INFO L226 Difference]: Without dead ends: 3507 [2022-11-03 03:41:58,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=291, Unknown=2, NotChecked=74, Total=462 [2022-11-03 03:41:58,582 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 247 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 185 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:41:58,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 43 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 499 Invalid, 0 Unknown, 185 Unchecked, 0.5s Time] [2022-11-03 03:41:58,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3507 states. [2022-11-03 03:41:58,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3507 to 2419. [2022-11-03 03:41:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2419 states, 2077 states have (on average 4.43042850264805) internal successors, (9202), 2418 states have internal predecessors, (9202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 9202 transitions. [2022-11-03 03:41:58,694 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 9202 transitions. Word has length 7 [2022-11-03 03:41:58,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:41:58,695 INFO L495 AbstractCegarLoop]: Abstraction has 2419 states and 9202 transitions. [2022-11-03 03:41:58,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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-03 03:41:58,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 9202 transitions. [2022-11-03 03:41:58,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 03:41:58,696 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:41:58,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:41:58,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 03:41:58,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 03:41:58,923 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:41:58,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:41:58,924 INFO L85 PathProgramCache]: Analyzing trace with hash -493935639, now seen corresponding path program 1 times [2022-11-03 03:41:58,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:41:58,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480947241] [2022-11-03 03:41:58,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:58,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:41:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:59,061 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-03 03:41:59,062 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:41:59,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480947241] [2022-11-03 03:41:59,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480947241] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:41:59,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876256361] [2022-11-03 03:41:59,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:59,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:41:59,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:41:59,064 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:41:59,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 03:41:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:59,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 03:41:59,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:41:59,315 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-03 03:41:59,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:41:59,373 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-03 03:41:59,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876256361] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:41:59,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1784055569] [2022-11-03 03:41:59,374 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-03 03:41:59,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:41:59,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-11-03 03:41:59,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622534352] [2022-11-03 03:41:59,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:41:59,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 03:41:59,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:41:59,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 03:41:59,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-11-03 03:41:59,380 INFO L87 Difference]: Start difference. First operand 2419 states and 9202 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-03 03:42:00,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:00,007 INFO L93 Difference]: Finished difference Result 4077 states and 14188 transitions. [2022-11-03 03:42:00,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:42:00,010 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 7 [2022-11-03 03:42:00,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:00,064 INFO L225 Difference]: With dead ends: 4077 [2022-11-03 03:42:00,064 INFO L226 Difference]: Without dead ends: 4075 [2022-11-03 03:42:00,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2022-11-03 03:42:00,065 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 513 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:00,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 35 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:42:00,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2022-11-03 03:42:00,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 2839. [2022-11-03 03:42:00,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2839 states, 2497 states have (on average 4.496195434521426) internal successors, (11227), 2838 states have internal predecessors, (11227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:00,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 11227 transitions. [2022-11-03 03:42:00,176 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 11227 transitions. Word has length 7 [2022-11-03 03:42:00,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:00,177 INFO L495 AbstractCegarLoop]: Abstraction has 2839 states and 11227 transitions. [2022-11-03 03:42:00,177 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-03 03:42:00,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 11227 transitions. [2022-11-03 03:42:00,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 03:42:00,180 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:00,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:00,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 03:42:00,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 03:42:00,403 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:00,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:00,403 INFO L85 PathProgramCache]: Analyzing trace with hash -66259206, now seen corresponding path program 1 times [2022-11-03 03:42:00,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:00,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596140875] [2022-11-03 03:42:00,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:00,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:00,527 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-03 03:42:00,527 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:00,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596140875] [2022-11-03 03:42:00,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596140875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:42:00,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:42:00,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:42:00,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014767202] [2022-11-03 03:42:00,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:42:00,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:42:00,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:00,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:42:00,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:42:00,529 INFO L87 Difference]: Start difference. First operand 2839 states and 11227 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-03 03:42:00,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:00,741 INFO L93 Difference]: Finished difference Result 2899 states and 11263 transitions. [2022-11-03 03:42:00,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:42:00,742 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-03 03:42:00,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:00,755 INFO L225 Difference]: With dead ends: 2899 [2022-11-03 03:42:00,756 INFO L226 Difference]: Without dead ends: 2883 [2022-11-03 03:42:00,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:42:00,756 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 57 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:00,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 8 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:42:00,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2022-11-03 03:42:00,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2823. [2022-11-03 03:42:00,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2823 states, 2481 states have (on average 4.475211608222491) internal successors, (11103), 2822 states have internal predecessors, (11103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:00,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 11103 transitions. [2022-11-03 03:42:00,838 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 11103 transitions. Word has length 7 [2022-11-03 03:42:00,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:00,838 INFO L495 AbstractCegarLoop]: Abstraction has 2823 states and 11103 transitions. [2022-11-03 03:42:00,838 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-03 03:42:00,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 11103 transitions. [2022-11-03 03:42:00,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:42:00,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:00,839 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:00,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 03:42:00,840 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:00,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:00,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1446567121, now seen corresponding path program 2 times [2022-11-03 03:42:00,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:00,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280588615] [2022-11-03 03:42:00,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:00,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:01,256 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-03 03:42:01,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:01,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280588615] [2022-11-03 03:42:01,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280588615] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:01,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652095323] [2022-11-03 03:42:01,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:42:01,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:01,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:01,258 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:01,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 03:42:01,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:42:01,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:42:01,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 03:42:01,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:01,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:01,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:01,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:01,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:42:01,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:01,917 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:01,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-03 03:42:01,927 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:01,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 43 [2022-11-03 03:42:01,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:02,098 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-03 03:42:02,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652095323] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:02,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [164064890] [2022-11-03 03:42:02,099 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-03 03:42:02,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:02,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-03 03:42:02,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306734460] [2022-11-03 03:42:02,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:02,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 03:42:02,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:02,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 03:42:02,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-11-03 03:42:02,103 INFO L87 Difference]: Start difference. First operand 2823 states and 11103 transitions. Second operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:02,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:02,601 INFO L93 Difference]: Finished difference Result 2829 states and 11127 transitions. [2022-11-03 03:42:02,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 03:42:02,601 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 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-03 03:42:02,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:02,616 INFO L225 Difference]: With dead ends: 2829 [2022-11-03 03:42:02,616 INFO L226 Difference]: Without dead ends: 2829 [2022-11-03 03:42:02,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2022-11-03 03:42:02,617 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:02,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 47 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 219 Invalid, 0 Unknown, 136 Unchecked, 0.2s Time] [2022-11-03 03:42:02,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2022-11-03 03:42:02,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2828. [2022-11-03 03:42:02,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2486 states have (on average 4.472646822204345) internal successors, (11119), 2827 states have internal predecessors, (11119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 11119 transitions. [2022-11-03 03:42:02,700 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 11119 transitions. Word has length 8 [2022-11-03 03:42:02,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:02,700 INFO L495 AbstractCegarLoop]: Abstraction has 2828 states and 11119 transitions. [2022-11-03 03:42:02,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 11119 transitions. [2022-11-03 03:42:02,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:42:02,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:02,702 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:02,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 03:42:02,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 03:42:02,923 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:02,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:02,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1446567193, now seen corresponding path program 1 times [2022-11-03 03:42:02,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:02,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945022627] [2022-11-03 03:42:02,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:02,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:02,986 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-03 03:42:02,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:02,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945022627] [2022-11-03 03:42:02,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945022627] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:02,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233963123] [2022-11-03 03:42:02,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:02,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:02,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:02,989 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:03,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 03:42:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:03,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 03:42:03,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:03,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:42:03,202 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:42:03,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233963123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:42:03,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:42:03,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-11-03 03:42:03,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699480523] [2022-11-03 03:42:03,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:42:03,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:42:03,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:03,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:42:03,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:42:03,204 INFO L87 Difference]: Start difference. First operand 2828 states and 11119 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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-03 03:42:03,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:03,398 INFO L93 Difference]: Finished difference Result 3456 states and 12623 transitions. [2022-11-03 03:42:03,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:42:03,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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 8 [2022-11-03 03:42:03,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:03,412 INFO L225 Difference]: With dead ends: 3456 [2022-11-03 03:42:03,412 INFO L226 Difference]: Without dead ends: 3456 [2022-11-03 03:42:03,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-03 03:42:03,413 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 63 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:03,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 13 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:42:03,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3456 states. [2022-11-03 03:42:03,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3456 to 2646. [2022-11-03 03:42:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2646 states, 2353 states have (on average 4.386740331491713) internal successors, (10322), 2645 states have internal predecessors, (10322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2646 states and 10322 transitions. [2022-11-03 03:42:03,551 INFO L78 Accepts]: Start accepts. Automaton has 2646 states and 10322 transitions. Word has length 8 [2022-11-03 03:42:03,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:03,551 INFO L495 AbstractCegarLoop]: Abstraction has 2646 states and 10322 transitions. [2022-11-03 03:42:03,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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-03 03:42:03,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2646 states and 10322 transitions. [2022-11-03 03:42:03,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:42:03,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:03,552 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:03,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 03:42:03,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:03,771 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:03,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:03,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1446567115, now seen corresponding path program 1 times [2022-11-03 03:42:03,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:03,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753180917] [2022-11-03 03:42:03,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:03,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:04,036 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-03 03:42:04,036 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:04,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753180917] [2022-11-03 03:42:04,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753180917] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:04,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387472651] [2022-11-03 03:42:04,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:04,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:04,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:04,039 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:04,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 03:42:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:04,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 03:42:04,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:04,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:42:04,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:42:04,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387472651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:42:04,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:42:04,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2022-11-03 03:42:04,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393979101] [2022-11-03 03:42:04,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:42:04,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:42:04,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:04,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:42:04,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:42:04,366 INFO L87 Difference]: Start difference. First operand 2646 states and 10322 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:04,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:04,443 INFO L93 Difference]: Finished difference Result 2987 states and 12398 transitions. [2022-11-03 03:42:04,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:42:04,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 03:42:04,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:04,457 INFO L225 Difference]: With dead ends: 2987 [2022-11-03 03:42:04,458 INFO L226 Difference]: Without dead ends: 2987 [2022-11-03 03:42:04,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:42:04,459 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:04,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 58 Unchecked, 0.1s Time] [2022-11-03 03:42:04,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2022-11-03 03:42:04,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2826. [2022-11-03 03:42:04,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2826 states, 2533 states have (on average 4.676273193841295) internal successors, (11845), 2825 states have internal predecessors, (11845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:04,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 11845 transitions. [2022-11-03 03:42:04,552 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 11845 transitions. Word has length 8 [2022-11-03 03:42:04,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:04,552 INFO L495 AbstractCegarLoop]: Abstraction has 2826 states and 11845 transitions. [2022-11-03 03:42:04,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:04,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 11845 transitions. [2022-11-03 03:42:04,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:42:04,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:04,553 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:04,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 03:42:04,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 03:42:04,778 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:04,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:04,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1446567164, now seen corresponding path program 1 times [2022-11-03 03:42:04,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:04,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775366630] [2022-11-03 03:42:04,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:04,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:04,865 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-03 03:42:04,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:04,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775366630] [2022-11-03 03:42:04,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775366630] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:04,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082480359] [2022-11-03 03:42:04,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:04,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:04,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:04,868 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:04,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 03:42:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:05,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 03:42:05,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:05,115 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-03 03:42:05,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:05,127 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-03 03:42:05,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082480359] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:05,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1677429876] [2022-11-03 03:42:05,128 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-03 03:42:05,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:05,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-11-03 03:42:05,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431709896] [2022-11-03 03:42:05,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:05,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 03:42:05,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:05,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 03:42:05,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:42:05,132 INFO L87 Difference]: Start difference. First operand 2826 states and 11845 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:05,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:05,505 INFO L93 Difference]: Finished difference Result 7977 states and 30784 transitions. [2022-11-03 03:42:05,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:42:05,506 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 03:42:05,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:05,550 INFO L225 Difference]: With dead ends: 7977 [2022-11-03 03:42:05,551 INFO L226 Difference]: Without dead ends: 7977 [2022-11-03 03:42:05,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:42:05,552 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 186 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:05,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 17 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:42:05,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7977 states. [2022-11-03 03:42:05,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7977 to 3918. [2022-11-03 03:42:05,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3918 states, 3625 states have (on average 5.60551724137931) internal successors, (20320), 3917 states have internal predecessors, (20320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:05,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 20320 transitions. [2022-11-03 03:42:05,747 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 20320 transitions. Word has length 8 [2022-11-03 03:42:05,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:05,747 INFO L495 AbstractCegarLoop]: Abstraction has 3918 states and 20320 transitions. [2022-11-03 03:42:05,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:05,748 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 20320 transitions. [2022-11-03 03:42:05,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:42:05,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:05,748 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:05,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 03:42:05,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 03:42:05,971 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:05,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:05,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1446567117, now seen corresponding path program 1 times [2022-11-03 03:42:05,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:05,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624807423] [2022-11-03 03:42:05,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:05,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:06,380 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-03 03:42:06,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:06,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624807423] [2022-11-03 03:42:06,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624807423] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:06,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558971840] [2022-11-03 03:42:06,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:06,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:06,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:06,383 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:06,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 03:42:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:06,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-03 03:42:06,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:06,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:06,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:06,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:06,744 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-03 03:42:06,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:06,802 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_596 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 03:42:06,821 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:06,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:06,829 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:06,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:06,883 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-03 03:42:06,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558971840] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:06,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2026868610] [2022-11-03 03:42:06,884 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-03 03:42:06,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:06,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-03 03:42:06,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658378588] [2022-11-03 03:42:06,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:06,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 03:42:06,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:06,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 03:42:06,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=289, Unknown=1, NotChecked=34, Total=380 [2022-11-03 03:42:06,886 INFO L87 Difference]: Start difference. First operand 3918 states and 20320 transitions. Second operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:07,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:07,966 INFO L93 Difference]: Finished difference Result 5134 states and 22894 transitions. [2022-11-03 03:42:07,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:42:07,967 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 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-03 03:42:07,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:07,992 INFO L225 Difference]: With dead ends: 5134 [2022-11-03 03:42:07,992 INFO L226 Difference]: Without dead ends: 5134 [2022-11-03 03:42:07,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=626, Unknown=1, NotChecked=52, Total=812 [2022-11-03 03:42:07,993 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 205 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:07,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 90 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 998 Invalid, 0 Unknown, 103 Unchecked, 0.7s Time] [2022-11-03 03:42:08,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5134 states. [2022-11-03 03:42:08,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5134 to 3918. [2022-11-03 03:42:08,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3918 states, 3625 states have (on average 5.6049655172413795) internal successors, (20318), 3917 states have internal predecessors, (20318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:08,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 20318 transitions. [2022-11-03 03:42:08,220 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 20318 transitions. Word has length 8 [2022-11-03 03:42:08,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:08,221 INFO L495 AbstractCegarLoop]: Abstraction has 3918 states and 20318 transitions. [2022-11-03 03:42:08,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:08,221 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 20318 transitions. [2022-11-03 03:42:08,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:42:08,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:08,222 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:08,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 03:42:08,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 03:42:08,447 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:08,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:08,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1446567119, now seen corresponding path program 1 times [2022-11-03 03:42:08,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:08,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877106529] [2022-11-03 03:42:08,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:08,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:08,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:42:08,616 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:08,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877106529] [2022-11-03 03:42:08,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877106529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:42:08,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:42:08,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:42:08,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818903386] [2022-11-03 03:42:08,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:42:08,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:42:08,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:08,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:42:08,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:42:08,618 INFO L87 Difference]: Start difference. First operand 3918 states and 20318 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:08,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:08,709 INFO L93 Difference]: Finished difference Result 3736 states and 18419 transitions. [2022-11-03 03:42:08,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:42:08,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 03:42:08,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:08,730 INFO L225 Difference]: With dead ends: 3736 [2022-11-03 03:42:08,730 INFO L226 Difference]: Without dead ends: 3736 [2022-11-03 03:42:08,731 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-03 03:42:08,731 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3 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-03 03:42:08,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:42:08,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3736 states. [2022-11-03 03:42:08,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3736 to 3736. [2022-11-03 03:42:08,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3736 states, 3492 states have (on average 5.274627720504009) internal successors, (18419), 3735 states have internal predecessors, (18419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3736 states to 3736 states and 18419 transitions. [2022-11-03 03:42:08,855 INFO L78 Accepts]: Start accepts. Automaton has 3736 states and 18419 transitions. Word has length 8 [2022-11-03 03:42:08,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:08,855 INFO L495 AbstractCegarLoop]: Abstraction has 3736 states and 18419 transitions. [2022-11-03 03:42:08,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:08,856 INFO L276 IsEmpty]: Start isEmpty. Operand 3736 states and 18419 transitions. [2022-11-03 03:42:08,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:42:08,856 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:08,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:08,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-03 03:42:08,857 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:08,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:08,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1874243554, now seen corresponding path program 1 times [2022-11-03 03:42:08,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:08,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521746221] [2022-11-03 03:42:08,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:08,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:09,161 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-03 03:42:09,161 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:09,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521746221] [2022-11-03 03:42:09,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521746221] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:09,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642885529] [2022-11-03 03:42:09,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:09,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:09,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:09,167 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:09,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 03:42:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:09,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-03 03:42:09,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:09,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:09,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:09,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:09,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:09,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:09,497 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-03 03:42:09,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:09,542 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_660) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-11-03 03:42:09,553 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_659 (Array Int Int)) (v_ArrVal_660 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_659) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_660) |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-03 03:42:09,566 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:09,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:09,575 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:09,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:09,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:09,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:09,638 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-03 03:42:09,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642885529] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:09,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2012237029] [2022-11-03 03:42:09,639 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-03 03:42:09,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:09,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-11-03 03:42:09,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055338756] [2022-11-03 03:42:09,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:09,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 03:42:09,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:09,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 03:42:09,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=167, Unknown=2, NotChecked=54, Total=272 [2022-11-03 03:42:09,643 INFO L87 Difference]: Start difference. First operand 3736 states and 18419 transitions. Second operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:10,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:10,469 INFO L93 Difference]: Finished difference Result 5756 states and 26587 transitions. [2022-11-03 03:42:10,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:42:10,470 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 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-03 03:42:10,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:10,506 INFO L225 Difference]: With dead ends: 5756 [2022-11-03 03:42:10,506 INFO L226 Difference]: Without dead ends: 5756 [2022-11-03 03:42:10,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=291, Unknown=2, NotChecked=74, Total=462 [2022-11-03 03:42:10,507 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 197 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:10,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 46 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 514 Invalid, 0 Unknown, 136 Unchecked, 0.5s Time] [2022-11-03 03:42:10,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5756 states. [2022-11-03 03:42:10,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5756 to 3755. [2022-11-03 03:42:10,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3755 states, 3511 states have (on average 5.29136998006266) internal successors, (18578), 3754 states have internal predecessors, (18578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 18578 transitions. [2022-11-03 03:42:10,671 INFO L78 Accepts]: Start accepts. Automaton has 3755 states and 18578 transitions. Word has length 8 [2022-11-03 03:42:10,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:10,671 INFO L495 AbstractCegarLoop]: Abstraction has 3755 states and 18578 transitions. [2022-11-03 03:42:10,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:10,672 INFO L276 IsEmpty]: Start isEmpty. Operand 3755 states and 18578 transitions. [2022-11-03 03:42:10,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:42:10,672 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:10,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:10,708 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 03:42:10,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:10,887 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:10,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:10,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1874243556, now seen corresponding path program 1 times [2022-11-03 03:42:10,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:10,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021723866] [2022-11-03 03:42:10,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:10,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:11,133 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-03 03:42:11,134 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:11,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021723866] [2022-11-03 03:42:11,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021723866] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:11,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237578293] [2022-11-03 03:42:11,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:11,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:11,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:11,136 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:11,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 03:42:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:11,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-03 03:42:11,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:11,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:11,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:11,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:11,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:11,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:11,480 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-03 03:42:11,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:11,514 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_704 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-11-03 03:42:11,525 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-11-03 03:42:11,536 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:11,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:11,544 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:11,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:11,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:11,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:11,598 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-03 03:42:11,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237578293] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:11,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [469980683] [2022-11-03 03:42:11,599 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-03 03:42:11,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:11,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-11-03 03:42:11,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623993262] [2022-11-03 03:42:11,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:11,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 03:42:11,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:11,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 03:42:11,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=122, Unknown=2, NotChecked=46, Total=210 [2022-11-03 03:42:11,602 INFO L87 Difference]: Start difference. First operand 3755 states and 18578 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-03 03:42:12,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:12,192 INFO L93 Difference]: Finished difference Result 5737 states and 26504 transitions. [2022-11-03 03:42:12,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:42:12,193 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 8 [2022-11-03 03:42:12,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:12,220 INFO L225 Difference]: With dead ends: 5737 [2022-11-03 03:42:12,221 INFO L226 Difference]: Without dead ends: 5737 [2022-11-03 03:42:12,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=176, Unknown=2, NotChecked=58, Total=306 [2022-11-03 03:42:12,222 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 135 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:12,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 38 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 357 Invalid, 0 Unknown, 181 Unchecked, 0.4s Time] [2022-11-03 03:42:12,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5737 states. [2022-11-03 03:42:12,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5737 to 3755. [2022-11-03 03:42:12,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3755 states, 3511 states have (on average 5.285958416405583) internal successors, (18559), 3754 states have internal predecessors, (18559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:12,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 18559 transitions. [2022-11-03 03:42:12,367 INFO L78 Accepts]: Start accepts. Automaton has 3755 states and 18559 transitions. Word has length 8 [2022-11-03 03:42:12,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:12,367 INFO L495 AbstractCegarLoop]: Abstraction has 3755 states and 18559 transitions. [2022-11-03 03:42:12,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-03 03:42:12,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3755 states and 18559 transitions. [2022-11-03 03:42:12,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:42:12,368 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:12,368 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:12,402 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 03:42:12,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:12,595 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:12,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:12,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1874243559, now seen corresponding path program 1 times [2022-11-03 03:42:12,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:12,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116248353] [2022-11-03 03:42:12,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:12,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:12,650 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-03 03:42:12,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:12,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116248353] [2022-11-03 03:42:12,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116248353] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:42:12,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:42:12,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:42:12,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877316803] [2022-11-03 03:42:12,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:42:12,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:42:12,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:12,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:42:12,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:42:12,653 INFO L87 Difference]: Start difference. First operand 3755 states and 18559 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-03 03:42:12,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:12,802 INFO L93 Difference]: Finished difference Result 5438 states and 27647 transitions. [2022-11-03 03:42:12,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:42:12,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-03 03:42:12,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:12,835 INFO L225 Difference]: With dead ends: 5438 [2022-11-03 03:42:12,835 INFO L226 Difference]: Without dead ends: 5438 [2022-11-03 03:42:12,835 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-03 03:42:12,836 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 23 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:12,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 6 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:42:12,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5438 states. [2022-11-03 03:42:12,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5438 to 4610. [2022-11-03 03:42:12,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4610 states, 4366 states have (on average 5.7562986715529085) internal successors, (25132), 4609 states have internal predecessors, (25132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 25132 transitions. [2022-11-03 03:42:13,012 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 25132 transitions. Word has length 8 [2022-11-03 03:42:13,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:13,014 INFO L495 AbstractCegarLoop]: Abstraction has 4610 states and 25132 transitions. [2022-11-03 03:42:13,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-03 03:42:13,014 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 25132 transitions. [2022-11-03 03:42:13,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:42:13,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:13,015 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:13,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-03 03:42:13,016 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:13,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:13,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1874243560, now seen corresponding path program 1 times [2022-11-03 03:42:13,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:13,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891461609] [2022-11-03 03:42:13,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:13,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:13,079 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-03 03:42:13,080 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:13,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891461609] [2022-11-03 03:42:13,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891461609] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:42:13,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:42:13,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:42:13,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808581675] [2022-11-03 03:42:13,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:42:13,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:42:13,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:13,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:42:13,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:42:13,082 INFO L87 Difference]: Start difference. First operand 4610 states and 25132 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-03 03:42:13,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:13,228 INFO L93 Difference]: Finished difference Result 5522 states and 27964 transitions. [2022-11-03 03:42:13,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:42:13,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-03 03:42:13,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:13,255 INFO L225 Difference]: With dead ends: 5522 [2022-11-03 03:42:13,255 INFO L226 Difference]: Without dead ends: 5522 [2022-11-03 03:42:13,256 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-03 03:42:13,256 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 21 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:13,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 6 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:42:13,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2022-11-03 03:42:13,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 4694. [2022-11-03 03:42:13,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4694 states, 4450 states have (on average 5.718876404494382) internal successors, (25449), 4693 states have internal predecessors, (25449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:13,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4694 states to 4694 states and 25449 transitions. [2022-11-03 03:42:13,472 INFO L78 Accepts]: Start accepts. Automaton has 4694 states and 25449 transitions. Word has length 8 [2022-11-03 03:42:13,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:13,472 INFO L495 AbstractCegarLoop]: Abstraction has 4694 states and 25449 transitions. [2022-11-03 03:42:13,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-03 03:42:13,473 INFO L276 IsEmpty]: Start isEmpty. Operand 4694 states and 25449 transitions. [2022-11-03 03:42:13,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:42:13,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:13,473 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:13,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-03 03:42:13,474 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:13,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:13,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1472610537, now seen corresponding path program 3 times [2022-11-03 03:42:13,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:13,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495076213] [2022-11-03 03:42:13,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:13,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:13,922 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:42:13,924 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:13,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495076213] [2022-11-03 03:42:13,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495076213] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:13,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552446070] [2022-11-03 03:42:13,924 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:42:13,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:13,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:13,927 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:13,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 03:42:14,173 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:42:14,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:42:14,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 03:42:14,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:14,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:14,268 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 03:42:14,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 [2022-11-03 03:42:14,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:14,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:14,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:42:14,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:14,435 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_793 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_793) |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-03 03:42:14,443 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_791 Int) (v_ArrVal_793 (Array Int Int))) (< 0 (+ 9223372039002259456 (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~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_791)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_793) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2022-11-03 03:42:14,472 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-03 03:42:14,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2022-11-03 03:42:14,481 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:14,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:14,539 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 03:42:14,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552446070] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:14,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [494703672] [2022-11-03 03:42:14,539 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-03 03:42:14,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:14,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-03 03:42:14,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530309424] [2022-11-03 03:42:14,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:14,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 03:42:14,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:14,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 03:42:14,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=362, Unknown=2, NotChecked=78, Total=506 [2022-11-03 03:42:14,544 INFO L87 Difference]: Start difference. First operand 4694 states and 25449 transitions. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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-03 03:42:15,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:15,905 INFO L93 Difference]: Finished difference Result 5929 states and 28607 transitions. [2022-11-03 03:42:15,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:42:15,906 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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-03 03:42:15,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:15,929 INFO L225 Difference]: With dead ends: 5929 [2022-11-03 03:42:15,929 INFO L226 Difference]: Without dead ends: 5929 [2022-11-03 03:42:15,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=723, Unknown=2, NotChecked=114, Total=992 [2022-11-03 03:42:15,930 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 187 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 238 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:15,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 123 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1357 Invalid, 0 Unknown, 238 Unchecked, 0.9s Time] [2022-11-03 03:42:15,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5929 states. [2022-11-03 03:42:16,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5929 to 4694. [2022-11-03 03:42:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4694 states, 4450 states have (on average 5.718651685393258) internal successors, (25448), 4693 states have internal predecessors, (25448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4694 states to 4694 states and 25448 transitions. [2022-11-03 03:42:16,133 INFO L78 Accepts]: Start accepts. Automaton has 4694 states and 25448 transitions. Word has length 9 [2022-11-03 03:42:16,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:16,134 INFO L495 AbstractCegarLoop]: Abstraction has 4694 states and 25448 transitions. [2022-11-03 03:42:16,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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-03 03:42:16,134 INFO L276 IsEmpty]: Start isEmpty. Operand 4694 states and 25448 transitions. [2022-11-03 03:42:16,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:42:16,135 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:16,135 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:16,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-03 03:42:16,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:16,363 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:16,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:16,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1900230551, now seen corresponding path program 1 times [2022-11-03 03:42:16,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:16,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291679088] [2022-11-03 03:42:16,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:16,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:16,841 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-03 03:42:16,842 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:16,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291679088] [2022-11-03 03:42:16,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291679088] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:16,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388761479] [2022-11-03 03:42:16,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:16,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:16,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:16,847 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:16,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 03:42:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:17,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 03:42:17,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:17,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:17,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:17,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:17,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:17,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:17,286 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-03 03:42:17,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:17,358 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_841) c_~A~0.base) (+ c_~A~0.offset 4))))) is different from false [2022-11-03 03:42:17,369 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_840) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_841) |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-03 03:42:17,381 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:17,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:17,390 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:17,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:17,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 28 [2022-11-03 03:42:17,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 50 [2022-11-03 03:42:17,499 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-03 03:42:17,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388761479] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:17,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [662722639] [2022-11-03 03:42:17,500 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-03 03:42:17,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:17,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-03 03:42:17,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169900332] [2022-11-03 03:42:17,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:17,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 03:42:17,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:17,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 03:42:17,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=359, Unknown=2, NotChecked=78, Total=506 [2022-11-03 03:42:17,504 INFO L87 Difference]: Start difference. First operand 4694 states and 25448 transitions. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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-03 03:42:19,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:19,035 INFO L93 Difference]: Finished difference Result 5953 states and 28629 transitions. [2022-11-03 03:42:19,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:42:19,036 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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-03 03:42:19,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:19,065 INFO L225 Difference]: With dead ends: 5953 [2022-11-03 03:42:19,065 INFO L226 Difference]: Without dead ends: 5953 [2022-11-03 03:42:19,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=154, Invalid=722, Unknown=2, NotChecked=114, Total=992 [2022-11-03 03:42:19,066 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 340 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 291 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:19,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 95 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 980 Invalid, 0 Unknown, 291 Unchecked, 0.9s Time] [2022-11-03 03:42:19,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5953 states. [2022-11-03 03:42:19,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5953 to 4694. [2022-11-03 03:42:19,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4694 states, 4450 states have (on average 5.713258426966292) internal successors, (25424), 4693 states have internal predecessors, (25424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4694 states to 4694 states and 25424 transitions. [2022-11-03 03:42:19,282 INFO L78 Accepts]: Start accepts. Automaton has 4694 states and 25424 transitions. Word has length 9 [2022-11-03 03:42:19,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:19,283 INFO L495 AbstractCegarLoop]: Abstraction has 4694 states and 25424 transitions. [2022-11-03 03:42:19,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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-03 03:42:19,283 INFO L276 IsEmpty]: Start isEmpty. Operand 4694 states and 25424 transitions. [2022-11-03 03:42:19,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:42:19,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:19,284 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:19,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-03 03:42:19,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-03 03:42:19,511 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:19,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:19,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1900230547, now seen corresponding path program 1 times [2022-11-03 03:42:19,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:19,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747339766] [2022-11-03 03:42:19,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:19,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:19,900 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-03 03:42:19,900 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:19,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747339766] [2022-11-03 03:42:19,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747339766] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:19,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656919853] [2022-11-03 03:42:19,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:19,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:19,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:19,903 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:19,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-03 03:42:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:20,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 03:42:20,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:20,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:20,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:20,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:20,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:20,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:20,309 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-03 03:42:20,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:20,374 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_889 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_889) c_~A~0.base) (+ c_~A~0.offset 4)) 4294967296)) is different from false [2022-11-03 03:42:20,387 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_889 (Array Int Int)) (v_ArrVal_888 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_888) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_889) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 03:42:20,397 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:20,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:20,405 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:20,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 71 treesize of output 67 [2022-11-03 03:42:20,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-03 03:42:20,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-11-03 03:42:20,513 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-03 03:42:20,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656919853] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:20,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2107313652] [2022-11-03 03:42:20,515 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-03 03:42:20,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:20,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-03 03:42:20,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171286881] [2022-11-03 03:42:20,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:20,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 03:42:20,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:20,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 03:42:20,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=359, Unknown=2, NotChecked=78, Total=506 [2022-11-03 03:42:20,519 INFO L87 Difference]: Start difference. First operand 4694 states and 25424 transitions. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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-03 03:42:21,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:21,949 INFO L93 Difference]: Finished difference Result 5941 states and 28582 transitions. [2022-11-03 03:42:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:42:21,950 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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-03 03:42:21,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:21,972 INFO L225 Difference]: With dead ends: 5941 [2022-11-03 03:42:21,972 INFO L226 Difference]: Without dead ends: 5941 [2022-11-03 03:42:21,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=722, Unknown=2, NotChecked=114, Total=992 [2022-11-03 03:42:21,974 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 311 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 267 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:21,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 115 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1212 Invalid, 0 Unknown, 267 Unchecked, 0.9s Time] [2022-11-03 03:42:21,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5941 states. [2022-11-03 03:42:22,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5941 to 4694. [2022-11-03 03:42:22,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4694 states, 4450 states have (on average 5.707865168539326) internal successors, (25400), 4693 states have internal predecessors, (25400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4694 states to 4694 states and 25400 transitions. [2022-11-03 03:42:22,122 INFO L78 Accepts]: Start accepts. Automaton has 4694 states and 25400 transitions. Word has length 9 [2022-11-03 03:42:22,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:22,122 INFO L495 AbstractCegarLoop]: Abstraction has 4694 states and 25400 transitions. [2022-11-03 03:42:22,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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-03 03:42:22,123 INFO L276 IsEmpty]: Start isEmpty. Operand 4694 states and 25400 transitions. [2022-11-03 03:42:22,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:42:22,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:22,123 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:22,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-03 03:42:22,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-03 03:42:22,324 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:22,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:22,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1893911195, now seen corresponding path program 1 times [2022-11-03 03:42:22,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:22,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660165605] [2022-11-03 03:42:22,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:22,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:22,505 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-03 03:42:22,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:22,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660165605] [2022-11-03 03:42:22,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660165605] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:22,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299845847] [2022-11-03 03:42:22,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:22,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:22,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:22,507 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:22,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-03 03:42:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:22,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 03:42:22,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:22,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 [2022-11-03 03:42:22,792 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:42:22,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:42:22,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:42:22,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299845847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:42:22,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:42:22,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2022-11-03 03:42:22,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984382116] [2022-11-03 03:42:22,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:42:22,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:42:22,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:22,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:42:22,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:42:22,812 INFO L87 Difference]: Start difference. First operand 4694 states and 25400 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-03 03:42:22,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:22,921 INFO L93 Difference]: Finished difference Result 4469 states and 23833 transitions. [2022-11-03 03:42:22,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:42:22,922 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 9 [2022-11-03 03:42:22,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:22,941 INFO L225 Difference]: With dead ends: 4469 [2022-11-03 03:42:22,941 INFO L226 Difference]: Without dead ends: 4469 [2022-11-03 03:42:22,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:42:22,942 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:22,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:42:22,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4469 states. [2022-11-03 03:42:23,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4469 to 3569. [2022-11-03 03:42:23,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3569 states, 3374 states have (on average 5.148784825133373) internal successors, (17372), 3568 states have internal predecessors, (17372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3569 states to 3569 states and 17372 transitions. [2022-11-03 03:42:23,060 INFO L78 Accepts]: Start accepts. Automaton has 3569 states and 17372 transitions. Word has length 9 [2022-11-03 03:42:23,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:23,060 INFO L495 AbstractCegarLoop]: Abstraction has 3569 states and 17372 transitions. [2022-11-03 03:42:23,060 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-03 03:42:23,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3569 states and 17372 transitions. [2022-11-03 03:42:23,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:42:23,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:23,062 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-11-03 03:42:23,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-03 03:42:23,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-03 03:42:23,280 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:23,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:23,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1893911011, now seen corresponding path program 2 times [2022-11-03 03:42:23,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:23,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885121387] [2022-11-03 03:42:23,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:23,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:23,410 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-03 03:42:23,411 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:23,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885121387] [2022-11-03 03:42:23,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885121387] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:23,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043798918] [2022-11-03 03:42:23,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:42:23,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:23,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:23,413 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:23,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-03 03:42:23,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:42:23,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:42:23,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 03:42:23,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:23,747 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:42:23,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:42:23,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043798918] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:23,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1733660102] [2022-11-03 03:42:23,830 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-03 03:42:23,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:23,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-11-03 03:42:23,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165035546] [2022-11-03 03:42:23,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:23,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 03:42:23,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:23,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 03:42:23,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2022-11-03 03:42:23,831 INFO L87 Difference]: Start difference. First operand 3569 states and 17372 transitions. Second operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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-03 03:42:24,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:24,969 INFO L93 Difference]: Finished difference Result 7361 states and 30448 transitions. [2022-11-03 03:42:24,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-03 03:42:24,969 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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 9 [2022-11-03 03:42:24,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:25,001 INFO L225 Difference]: With dead ends: 7361 [2022-11-03 03:42:25,001 INFO L226 Difference]: Without dead ends: 7359 [2022-11-03 03:42:25,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=320, Invalid=736, Unknown=0, NotChecked=0, Total=1056 [2022-11-03 03:42:25,002 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 802 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:25,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 85 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-03 03:42:25,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7359 states. [2022-11-03 03:42:25,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7359 to 3979. [2022-11-03 03:42:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3979 states, 3784 states have (on average 5.174682875264271) internal successors, (19581), 3978 states have internal predecessors, (19581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:25,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3979 states to 3979 states and 19581 transitions. [2022-11-03 03:42:25,151 INFO L78 Accepts]: Start accepts. Automaton has 3979 states and 19581 transitions. Word has length 9 [2022-11-03 03:42:25,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:25,152 INFO L495 AbstractCegarLoop]: Abstraction has 3979 states and 19581 transitions. [2022-11-03 03:42:25,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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-03 03:42:25,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3979 states and 19581 transitions. [2022-11-03 03:42:25,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:42:25,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:25,153 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:25,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-03 03:42:25,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-03 03:42:25,379 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:25,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:25,379 INFO L85 PathProgramCache]: Analyzing trace with hash -2029879591, now seen corresponding path program 1 times [2022-11-03 03:42:25,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:25,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545103604] [2022-11-03 03:42:25,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:25,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:25,695 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-03 03:42:25,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:25,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545103604] [2022-11-03 03:42:25,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545103604] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:25,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275600246] [2022-11-03 03:42:25,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:25,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:25,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:25,697 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:25,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-03 03:42:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:25,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 03:42:25,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:25,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:26,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:26,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:26,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:26,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:26,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:26,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:26,148 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-03 03:42:26,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:26,178 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1022 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1022) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 9223372039002259456))) is different from false [2022-11-03 03:42:26,186 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1022 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1022) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-11-03 03:42:26,192 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1022 (Array Int Int)) (v_ArrVal_1021 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1022) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-11-03 03:42:26,207 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1022 (Array Int Int)) (v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1022) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-11-03 03:42:26,221 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:26,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 03:42:26,233 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:26,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1107 treesize of output 1077 [2022-11-03 03:42:26,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 531 treesize of output 515 [2022-11-03 03:42:26,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1046 treesize of output 1014 [2022-11-03 03:42:26,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1014 treesize of output 950 [2022-11-03 03:42:28,283 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-03 03:42:28,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275600246] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:28,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [917062797] [2022-11-03 03:42:28,285 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-03 03:42:28,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:28,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-11-03 03:42:28,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925592701] [2022-11-03 03:42:28,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:28,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 03:42:28,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:28,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 03:42:28,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=169, Unknown=4, NotChecked=116, Total=342 [2022-11-03 03:42:28,288 INFO L87 Difference]: Start difference. First operand 3979 states and 19581 transitions. Second operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 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-03 03:42:28,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:28,915 INFO L93 Difference]: Finished difference Result 5131 states and 23688 transitions. [2022-11-03 03:42:28,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:42:28,915 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 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 9 [2022-11-03 03:42:28,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:28,933 INFO L225 Difference]: With dead ends: 5131 [2022-11-03 03:42:28,933 INFO L226 Difference]: Without dead ends: 5131 [2022-11-03 03:42:28,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=233, Unknown=4, NotChecked=140, Total=462 [2022-11-03 03:42:28,934 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 307 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 327 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:28,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 35 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 338 Invalid, 0 Unknown, 327 Unchecked, 0.4s Time] [2022-11-03 03:42:28,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5131 states. [2022-11-03 03:42:29,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5131 to 4187. [2022-11-03 03:42:29,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4187 states, 3992 states have (on average 5.107464929859719) internal successors, (20389), 4186 states have internal predecessors, (20389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:29,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4187 states to 4187 states and 20389 transitions. [2022-11-03 03:42:29,036 INFO L78 Accepts]: Start accepts. Automaton has 4187 states and 20389 transitions. Word has length 9 [2022-11-03 03:42:29,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:29,037 INFO L495 AbstractCegarLoop]: Abstraction has 4187 states and 20389 transitions. [2022-11-03 03:42:29,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 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-03 03:42:29,037 INFO L276 IsEmpty]: Start isEmpty. Operand 4187 states and 20389 transitions. [2022-11-03 03:42:29,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:42:29,038 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:29,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:29,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-11-03 03:42:29,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-03 03:42:29,251 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:29,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:29,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2029879595, now seen corresponding path program 1 times [2022-11-03 03:42:29,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:29,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979524048] [2022-11-03 03:42:29,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:29,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:29,587 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-03 03:42:29,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:29,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979524048] [2022-11-03 03:42:29,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979524048] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:29,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029865837] [2022-11-03 03:42:29,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:29,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:29,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:29,589 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:29,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-03 03:42:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:29,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 03:42:29,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:29,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:29,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:29,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:29,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:29,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:29,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:29,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:30,028 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-03 03:42:30,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:30,050 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1071 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1071) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 4294967296)) is different from false [2022-11-03 03:42:30,059 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1071 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1071) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-11-03 03:42:30,064 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1070) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1071) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-11-03 03:42:30,075 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1069 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1069) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1070) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1071) |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-03 03:42:30,089 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:30,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-03 03:42:30,100 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:30,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 977 treesize of output 947 [2022-11-03 03:42:30,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 467 treesize of output 435 [2022-11-03 03:42:30,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 902 treesize of output 886 [2022-11-03 03:42:30,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 886 treesize of output 822 [2022-11-03 03:42:30,887 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-03 03:42:30,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029865837] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:30,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [255674566] [2022-11-03 03:42:30,889 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-03 03:42:30,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:30,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-11-03 03:42:30,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070873470] [2022-11-03 03:42:30,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:30,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 03:42:30,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:30,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 03:42:30,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=169, Unknown=4, NotChecked=116, Total=342 [2022-11-03 03:42:30,892 INFO L87 Difference]: Start difference. First operand 4187 states and 20389 transitions. Second operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 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-03 03:42:31,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:31,507 INFO L93 Difference]: Finished difference Result 4847 states and 22096 transitions. [2022-11-03 03:42:31,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:42:31,508 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 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 9 [2022-11-03 03:42:31,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:31,531 INFO L225 Difference]: With dead ends: 4847 [2022-11-03 03:42:31,532 INFO L226 Difference]: Without dead ends: 4843 [2022-11-03 03:42:31,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=233, Unknown=4, NotChecked=140, Total=462 [2022-11-03 03:42:31,533 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 236 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 327 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:31,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 48 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 468 Invalid, 0 Unknown, 327 Unchecked, 0.4s Time] [2022-11-03 03:42:31,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4843 states. [2022-11-03 03:42:31,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4843 to 4183. [2022-11-03 03:42:31,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4183 states, 3988 states have (on average 4.956369107321966) internal successors, (19766), 4182 states have internal predecessors, (19766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4183 states to 4183 states and 19766 transitions. [2022-11-03 03:42:31,635 INFO L78 Accepts]: Start accepts. Automaton has 4183 states and 19766 transitions. Word has length 9 [2022-11-03 03:42:31,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:31,635 INFO L495 AbstractCegarLoop]: Abstraction has 4183 states and 19766 transitions. [2022-11-03 03:42:31,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 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-03 03:42:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand 4183 states and 19766 transitions. [2022-11-03 03:42:31,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:42:31,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:31,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:31,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-03 03:42:31,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-03 03:42:31,836 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:31,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:31,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2027795834, now seen corresponding path program 1 times [2022-11-03 03:42:31,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:31,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066038536] [2022-11-03 03:42:31,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:31,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:32,150 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-03 03:42:32,150 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:32,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066038536] [2022-11-03 03:42:32,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066038536] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:32,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872231203] [2022-11-03 03:42:32,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:32,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:32,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:32,158 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:32,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-03 03:42:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:32,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-03 03:42:32,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:32,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:32,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:32,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:32,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:32,599 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-03 03:42:32,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:32,640 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1120 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1120) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-11-03 03:42:32,649 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1120 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1119) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1120) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-11-03 03:42:32,660 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1120 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1119) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1120) |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-03 03:42:32,672 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:32,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-03 03:42:32,687 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:32,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 977 treesize of output 947 [2022-11-03 03:42:32,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 934 treesize of output 870 [2022-11-03 03:42:32,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 435 treesize of output 419 [2022-11-03 03:42:32,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 854 treesize of output 822 [2022-11-03 03:42:33,811 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-03 03:42:33,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872231203] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:33,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [178970601] [2022-11-03 03:42:33,812 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-03 03:42:33,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:33,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-03 03:42:33,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021148669] [2022-11-03 03:42:33,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:33,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 03:42:33,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:33,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 03:42:33,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=219, Unknown=3, NotChecked=96, Total=380 [2022-11-03 03:42:33,815 INFO L87 Difference]: Start difference. First operand 4183 states and 19766 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-03 03:42:34,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:34,539 INFO L93 Difference]: Finished difference Result 5578 states and 25458 transitions. [2022-11-03 03:42:34,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:42:34,543 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-03 03:42:34,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:34,571 INFO L225 Difference]: With dead ends: 5578 [2022-11-03 03:42:34,571 INFO L226 Difference]: Without dead ends: 5578 [2022-11-03 03:42:34,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=357, Unknown=3, NotChecked=126, Total=600 [2022-11-03 03:42:34,573 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 289 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 301 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:34,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 38 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 357 Invalid, 0 Unknown, 301 Unchecked, 0.4s Time] [2022-11-03 03:42:34,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5578 states. [2022-11-03 03:42:34,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5578 to 4348. [2022-11-03 03:42:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4348 states, 4153 states have (on average 5.02094871177462) internal successors, (20852), 4347 states have internal predecessors, (20852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:34,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4348 states to 4348 states and 20852 transitions. [2022-11-03 03:42:34,711 INFO L78 Accepts]: Start accepts. Automaton has 4348 states and 20852 transitions. Word has length 9 [2022-11-03 03:42:34,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:34,711 INFO L495 AbstractCegarLoop]: Abstraction has 4348 states and 20852 transitions. [2022-11-03 03:42:34,711 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-03 03:42:34,711 INFO L276 IsEmpty]: Start isEmpty. Operand 4348 states and 20852 transitions. [2022-11-03 03:42:34,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:42:34,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:34,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:34,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-03 03:42:34,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:34,939 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:34,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:34,939 INFO L85 PathProgramCache]: Analyzing trace with hash -2027795832, now seen corresponding path program 1 times [2022-11-03 03:42:34,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:34,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332274722] [2022-11-03 03:42:34,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:34,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:35,213 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-03 03:42:35,213 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:35,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332274722] [2022-11-03 03:42:35,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332274722] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:35,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755675934] [2022-11-03 03:42:35,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:35,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:35,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:35,219 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:35,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-03 03:42:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:35,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-03 03:42:35,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:35,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:35,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:35,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:35,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:35,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:35,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:35,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:35,641 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-03 03:42:35,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:35,691 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1169 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1169) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-11-03 03:42:35,699 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1168 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1168) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1169) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-11-03 03:42:35,708 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1167) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1168) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1169) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-11-03 03:42:35,719 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:35,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 03:42:35,733 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:35,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 279 treesize of output 273 [2022-11-03 03:42:35,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 258 treesize of output 242 [2022-11-03 03:42:35,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 242 treesize of output 234 [2022-11-03 03:42:35,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 114 [2022-11-03 03:42:35,888 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-03 03:42:35,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755675934] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:35,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1992170933] [2022-11-03 03:42:35,889 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-03 03:42:35,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:35,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-03 03:42:35,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122528256] [2022-11-03 03:42:35,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:35,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 03:42:35,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:35,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 03:42:35,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=219, Unknown=3, NotChecked=96, Total=380 [2022-11-03 03:42:35,898 INFO L87 Difference]: Start difference. First operand 4348 states and 20852 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-03 03:42:36,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:36,693 INFO L93 Difference]: Finished difference Result 5207 states and 23558 transitions. [2022-11-03 03:42:36,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:42:36,694 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-03 03:42:36,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:36,712 INFO L225 Difference]: With dead ends: 5207 [2022-11-03 03:42:36,712 INFO L226 Difference]: Without dead ends: 5207 [2022-11-03 03:42:36,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=357, Unknown=3, NotChecked=126, Total=600 [2022-11-03 03:42:36,713 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 293 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 291 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:36,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 50 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 488 Invalid, 0 Unknown, 291 Unchecked, 0.4s Time] [2022-11-03 03:42:36,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5207 states. [2022-11-03 03:42:36,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5207 to 4245. [2022-11-03 03:42:36,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4245 states, 4050 states have (on average 4.909876543209877) internal successors, (19885), 4244 states have internal predecessors, (19885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4245 states to 4245 states and 19885 transitions. [2022-11-03 03:42:36,821 INFO L78 Accepts]: Start accepts. Automaton has 4245 states and 19885 transitions. Word has length 9 [2022-11-03 03:42:36,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:36,821 INFO L495 AbstractCegarLoop]: Abstraction has 4245 states and 19885 transitions. [2022-11-03 03:42:36,821 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-03 03:42:36,821 INFO L276 IsEmpty]: Start isEmpty. Operand 4245 states and 19885 transitions. [2022-11-03 03:42:36,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:42:36,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:36,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:36,845 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-03 03:42:37,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:37,025 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:37,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:37,025 INFO L85 PathProgramCache]: Analyzing trace with hash -2027985988, now seen corresponding path program 1 times [2022-11-03 03:42:37,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:37,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137226509] [2022-11-03 03:42:37,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:37,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:37,138 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-03 03:42:37,138 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:37,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137226509] [2022-11-03 03:42:37,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137226509] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:37,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584361679] [2022-11-03 03:42:37,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:37,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:37,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:37,143 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:37,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-03 03:42:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:37,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 03:42:37,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:37,500 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-03 03:42:37,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:37,634 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-03 03:42:37,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584361679] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:37,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [848553695] [2022-11-03 03:42:37,635 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-03 03:42:37,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:37,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-11-03 03:42:37,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349213450] [2022-11-03 03:42:37,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:37,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 03:42:37,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:37,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 03:42:37,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-11-03 03:42:37,640 INFO L87 Difference]: Start difference. First operand 4245 states and 19885 transitions. Second operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 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-03 03:42:38,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:38,355 INFO L93 Difference]: Finished difference Result 4621 states and 20653 transitions. [2022-11-03 03:42:38,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:42:38,356 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 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 9 [2022-11-03 03:42:38,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:38,375 INFO L225 Difference]: With dead ends: 4621 [2022-11-03 03:42:38,375 INFO L226 Difference]: Without dead ends: 4591 [2022-11-03 03:42:38,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2022-11-03 03:42:38,376 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 336 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:38,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 35 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:42:38,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2022-11-03 03:42:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 4219. [2022-11-03 03:42:38,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4219 states, 4024 states have (on average 4.879970178926441) internal successors, (19637), 4218 states have internal predecessors, (19637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:38,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4219 states to 4219 states and 19637 transitions. [2022-11-03 03:42:38,502 INFO L78 Accepts]: Start accepts. Automaton has 4219 states and 19637 transitions. Word has length 9 [2022-11-03 03:42:38,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:38,503 INFO L495 AbstractCegarLoop]: Abstraction has 4219 states and 19637 transitions. [2022-11-03 03:42:38,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 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-03 03:42:38,503 INFO L276 IsEmpty]: Start isEmpty. Operand 4219 states and 19637 transitions. [2022-11-03 03:42:38,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:42:38,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:38,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:38,529 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-03 03:42:38,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:38,707 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:38,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:38,707 INFO L85 PathProgramCache]: Analyzing trace with hash 755531986, now seen corresponding path program 1 times [2022-11-03 03:42:38,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:38,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502308503] [2022-11-03 03:42:38,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:38,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:38,759 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-03 03:42:38,759 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:38,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502308503] [2022-11-03 03:42:38,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502308503] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:42:38,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:42:38,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:42:38,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311232207] [2022-11-03 03:42:38,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:42:38,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:42:38,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:38,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:42:38,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:42:38,762 INFO L87 Difference]: Start difference. First operand 4219 states and 19637 transitions. Second operand has 4 states, 3 states have (on average 3.0) 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-03 03:42:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:38,923 INFO L93 Difference]: Finished difference Result 3863 states and 17692 transitions. [2022-11-03 03:42:38,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:42:38,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) 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 9 [2022-11-03 03:42:38,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:38,946 INFO L225 Difference]: With dead ends: 3863 [2022-11-03 03:42:38,947 INFO L226 Difference]: Without dead ends: 3863 [2022-11-03 03:42:38,947 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-03 03:42:38,948 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 54 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:38,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 6 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:42:38,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3863 states. [2022-11-03 03:42:39,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3863 to 3863. [2022-11-03 03:42:39,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3863 states, 3696 states have (on average 4.786796536796537) internal successors, (17692), 3862 states have internal predecessors, (17692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:39,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3863 states to 3863 states and 17692 transitions. [2022-11-03 03:42:39,061 INFO L78 Accepts]: Start accepts. Automaton has 3863 states and 17692 transitions. Word has length 9 [2022-11-03 03:42:39,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:39,062 INFO L495 AbstractCegarLoop]: Abstraction has 3863 states and 17692 transitions. [2022-11-03 03:42:39,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) 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-03 03:42:39,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3863 states and 17692 transitions. [2022-11-03 03:42:39,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:42:39,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:39,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:39,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-03 03:42:39,063 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:39,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:39,064 INFO L85 PathProgramCache]: Analyzing trace with hash 755531910, now seen corresponding path program 1 times [2022-11-03 03:42:39,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:39,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912811164] [2022-11-03 03:42:39,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:39,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:39,132 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-03 03:42:39,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:39,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912811164] [2022-11-03 03:42:39,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912811164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:42:39,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:42:39,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:42:39,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247014667] [2022-11-03 03:42:39,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:42:39,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:42:39,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:39,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:42:39,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:42:39,135 INFO L87 Difference]: Start difference. First operand 3863 states and 17692 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:39,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:39,348 INFO L93 Difference]: Finished difference Result 3823 states and 17483 transitions. [2022-11-03 03:42:39,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:42:39,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 03:42:39,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:39,366 INFO L225 Difference]: With dead ends: 3823 [2022-11-03 03:42:39,366 INFO L226 Difference]: Without dead ends: 3746 [2022-11-03 03:42:39,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:42:39,367 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 53 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:39,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 15 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:42:39,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2022-11-03 03:42:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 3746. [2022-11-03 03:42:39,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3746 states, 3579 states have (on average 4.837384744341995) internal successors, (17313), 3745 states have internal predecessors, (17313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3746 states to 3746 states and 17313 transitions. [2022-11-03 03:42:39,478 INFO L78 Accepts]: Start accepts. Automaton has 3746 states and 17313 transitions. Word has length 9 [2022-11-03 03:42:39,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:39,478 INFO L495 AbstractCegarLoop]: Abstraction has 3746 states and 17313 transitions. [2022-11-03 03:42:39,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:39,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3746 states and 17313 transitions. [2022-11-03 03:42:39,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 03:42:39,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:39,481 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2022-11-03 03:42:39,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-03 03:42:39,482 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:39,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:39,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1593710385, now seen corresponding path program 4 times [2022-11-03 03:42:39,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:39,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839827510] [2022-11-03 03:42:39,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:39,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:39,846 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-03 03:42:39,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:39,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839827510] [2022-11-03 03:42:39,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839827510] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:39,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966066917] [2022-11-03 03:42:39,846 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:42:39,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:39,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:39,851 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:39,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-03 03:42:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:40,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 03:42:40,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:40,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:40,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:40,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:40,333 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-03 03:42:40,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:40,432 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1296 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1296) |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-03 03:42:40,447 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:40,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:40,455 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:40,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:40,546 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-03 03:42:40,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966066917] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:40,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1605868655] [2022-11-03 03:42:40,547 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-03 03:42:40,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:40,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 03:42:40,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456783837] [2022-11-03 03:42:40,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:40,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 03:42:40,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:40,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 03:42:40,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=529, Unknown=1, NotChecked=46, Total=650 [2022-11-03 03:42:40,549 INFO L87 Difference]: Start difference. First operand 3746 states and 17313 transitions. Second operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 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-03 03:42:41,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:41,910 INFO L93 Difference]: Finished difference Result 4796 states and 19873 transitions. [2022-11-03 03:42:41,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 03:42:41,910 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 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-03 03:42:41,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:41,925 INFO L225 Difference]: With dead ends: 4796 [2022-11-03 03:42:41,925 INFO L226 Difference]: Without dead ends: 4796 [2022-11-03 03:42:41,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=168, Invalid=1095, Unknown=1, NotChecked=68, Total=1332 [2022-11-03 03:42:41,926 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 221 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:41,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 123 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1461 Invalid, 0 Unknown, 122 Unchecked, 0.9s Time] [2022-11-03 03:42:41,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4796 states. [2022-11-03 03:42:42,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4796 to 3746. [2022-11-03 03:42:42,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3746 states, 3579 states have (on average 4.837105336686225) internal successors, (17312), 3745 states have internal predecessors, (17312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:42,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3746 states to 3746 states and 17312 transitions. [2022-11-03 03:42:42,076 INFO L78 Accepts]: Start accepts. Automaton has 3746 states and 17312 transitions. Word has length 10 [2022-11-03 03:42:42,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:42,076 INFO L495 AbstractCegarLoop]: Abstraction has 3746 states and 17312 transitions. [2022-11-03 03:42:42,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 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-03 03:42:42,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3746 states and 17312 transitions. [2022-11-03 03:42:42,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 03:42:42,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:42,078 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2022-11-03 03:42:42,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-03 03:42:42,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:42,283 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:42,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:42,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1593710389, now seen corresponding path program 3 times [2022-11-03 03:42:42,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:42,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676442216] [2022-11-03 03:42:42,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:42,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:42,637 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-03 03:42:42,637 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:42,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676442216] [2022-11-03 03:42:42,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676442216] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:42,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838410808] [2022-11-03 03:42:42,638 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:42:42,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:42,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:42,639 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:42,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-03 03:42:42,927 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:42:42,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:42:42,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 03:42:42,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:42,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:43,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:43,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:43,120 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-03 03:42:43,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:43,217 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1343 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1343) |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-03 03:42:43,231 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:43,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:43,238 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:43,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:43,327 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-03 03:42:43,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838410808] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:43,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1563705097] [2022-11-03 03:42:43,327 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java: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-03 03:42:43,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:43,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 03:42:43,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255812236] [2022-11-03 03:42:43,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:43,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 03:42:43,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:43,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 03:42:43,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=529, Unknown=1, NotChecked=46, Total=650 [2022-11-03 03:42:43,329 INFO L87 Difference]: Start difference. First operand 3746 states and 17312 transitions. Second operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 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-03 03:42:44,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:44,468 INFO L93 Difference]: Finished difference Result 4795 states and 19871 transitions. [2022-11-03 03:42:44,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 03:42:44,469 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 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-03 03:42:44,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:44,484 INFO L225 Difference]: With dead ends: 4795 [2022-11-03 03:42:44,484 INFO L226 Difference]: Without dead ends: 4795 [2022-11-03 03:42:44,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=1095, Unknown=1, NotChecked=68, Total=1332 [2022-11-03 03:42:44,485 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 195 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:44,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 98 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1209 Invalid, 0 Unknown, 143 Unchecked, 0.7s Time] [2022-11-03 03:42:44,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4795 states. [2022-11-03 03:42:44,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4795 to 3746. [2022-11-03 03:42:44,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3746 states, 3579 states have (on average 4.836825929030455) internal successors, (17311), 3745 states have internal predecessors, (17311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3746 states to 3746 states and 17311 transitions. [2022-11-03 03:42:44,571 INFO L78 Accepts]: Start accepts. Automaton has 3746 states and 17311 transitions. Word has length 10 [2022-11-03 03:42:44,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:44,571 INFO L495 AbstractCegarLoop]: Abstraction has 3746 states and 17311 transitions. [2022-11-03 03:42:44,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 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-03 03:42:44,572 INFO L276 IsEmpty]: Start isEmpty. Operand 3746 states and 17311 transitions. [2022-11-03 03:42:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 03:42:44,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:44,572 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:44,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-03 03:42:44,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:44,779 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:44,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:44,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1220640092, now seen corresponding path program 2 times [2022-11-03 03:42:44,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:44,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177204747] [2022-11-03 03:42:44,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:44,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:45,128 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-03 03:42:45,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:45,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177204747] [2022-11-03 03:42:45,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177204747] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:45,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530262718] [2022-11-03 03:42:45,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:42:45,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:45,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:45,130 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:45,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-03 03:42:45,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:42:45,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:42:45,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 03:42:45,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:45,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:45,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:45,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:45,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:45,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:45,617 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-03 03:42:45,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:45,688 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1391 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1391) c_~A~0.base) (+ c_~A~0.offset 4)) 4294967296)) is different from false [2022-11-03 03:42:45,697 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1390) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1391) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 03:42:45,711 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:45,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:45,719 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:45,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 71 treesize of output 67 [2022-11-03 03:42:45,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-03 03:42:45,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-11-03 03:42:45,812 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-03 03:42:45,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530262718] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:45,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1958770542] [2022-11-03 03:42:45,813 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-03 03:42:45,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:45,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-03 03:42:45,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746349352] [2022-11-03 03:42:45,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:45,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 03:42:45,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:45,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 03:42:45,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=359, Unknown=2, NotChecked=78, Total=506 [2022-11-03 03:42:45,816 INFO L87 Difference]: Start difference. First operand 3746 states and 17311 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-03 03:42:46,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:46,893 INFO L93 Difference]: Finished difference Result 5378 states and 23026 transitions. [2022-11-03 03:42:46,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:42:46,893 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-03 03:42:46,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:46,929 INFO L225 Difference]: With dead ends: 5378 [2022-11-03 03:42:46,929 INFO L226 Difference]: Without dead ends: 5378 [2022-11-03 03:42:46,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=722, Unknown=2, NotChecked=114, Total=992 [2022-11-03 03:42:46,930 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 252 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 209 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:46,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 90 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 865 Invalid, 0 Unknown, 209 Unchecked, 0.6s Time] [2022-11-03 03:42:46,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5378 states. [2022-11-03 03:42:47,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5378 to 3761. [2022-11-03 03:42:47,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3761 states, 3594 states have (on average 4.8483583750695605) internal successors, (17425), 3760 states have internal predecessors, (17425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:47,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3761 states to 3761 states and 17425 transitions. [2022-11-03 03:42:47,079 INFO L78 Accepts]: Start accepts. Automaton has 3761 states and 17425 transitions. Word has length 10 [2022-11-03 03:42:47,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:47,079 INFO L495 AbstractCegarLoop]: Abstraction has 3761 states and 17425 transitions. [2022-11-03 03:42:47,079 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-03 03:42:47,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3761 states and 17425 transitions. [2022-11-03 03:42:47,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 03:42:47,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:47,080 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:47,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-11-03 03:42:47,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-03 03:42:47,281 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:47,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:47,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1220640090, now seen corresponding path program 1 times [2022-11-03 03:42:47,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:47,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048814603] [2022-11-03 03:42:47,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:47,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:47,638 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-03 03:42:47,638 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:47,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048814603] [2022-11-03 03:42:47,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048814603] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:47,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444977558] [2022-11-03 03:42:47,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:47,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:47,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:47,640 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:47,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-03 03:42:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:47,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 03:42:47,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:47,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:47,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:47,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:48,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:48,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:48,066 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-03 03:42:48,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:48,132 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1439 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1439) c_~A~0.base) (+ c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-11-03 03:42:48,140 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1439 (Array Int Int)) (v_ArrVal_1438 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1438) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1439) |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-03 03:42:48,150 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:48,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:48,162 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:48,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:48,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:48,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:48,265 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-03 03:42:48,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444977558] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:48,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1286718505] [2022-11-03 03:42:48,266 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-03 03:42:48,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:48,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-03 03:42:48,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817665231] [2022-11-03 03:42:48,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:48,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 03:42:48,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:48,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 03:42:48,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=359, Unknown=2, NotChecked=78, Total=506 [2022-11-03 03:42:48,269 INFO L87 Difference]: Start difference. First operand 3761 states and 17425 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-03 03:42:49,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:49,428 INFO L93 Difference]: Finished difference Result 5363 states and 22972 transitions. [2022-11-03 03:42:49,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:42:49,429 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-03 03:42:49,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:49,449 INFO L225 Difference]: With dead ends: 5363 [2022-11-03 03:42:49,450 INFO L226 Difference]: Without dead ends: 5363 [2022-11-03 03:42:49,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=722, Unknown=2, NotChecked=114, Total=992 [2022-11-03 03:42:49,450 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 198 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 245 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:49,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 91 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 919 Invalid, 0 Unknown, 245 Unchecked, 0.7s Time] [2022-11-03 03:42:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5363 states. [2022-11-03 03:42:49,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5363 to 3761. [2022-11-03 03:42:49,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3761 states, 3594 states have (on average 4.844184752365053) internal successors, (17410), 3760 states have internal predecessors, (17410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3761 states to 3761 states and 17410 transitions. [2022-11-03 03:42:49,542 INFO L78 Accepts]: Start accepts. Automaton has 3761 states and 17410 transitions. Word has length 10 [2022-11-03 03:42:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:49,542 INFO L495 AbstractCegarLoop]: Abstraction has 3761 states and 17410 transitions. [2022-11-03 03:42:49,542 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-03 03:42:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3761 states and 17410 transitions. [2022-11-03 03:42:49,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 03:42:49,543 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:49,543 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:49,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-03 03:42:49,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-03 03:42:49,747 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:49,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:49,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1220640087, now seen corresponding path program 1 times [2022-11-03 03:42:49,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:49,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326419065] [2022-11-03 03:42:49,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:49,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:49,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:42:49,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:49,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326419065] [2022-11-03 03:42:49,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326419065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:42:49,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:42:49,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:42:49,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758996210] [2022-11-03 03:42:49,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:42:49,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:42:49,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:49,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:42:49,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:42:49,817 INFO L87 Difference]: Start difference. First operand 3761 states and 17410 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-03 03:42:49,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:49,891 INFO L93 Difference]: Finished difference Result 3075 states and 13844 transitions. [2022-11-03 03:42:49,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:42:49,892 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-03 03:42:49,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:49,907 INFO L225 Difference]: With dead ends: 3075 [2022-11-03 03:42:49,907 INFO L226 Difference]: Without dead ends: 3075 [2022-11-03 03:42:49,908 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-03 03:42:49,908 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:49,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 3 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:42:49,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2022-11-03 03:42:49,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 3003. [2022-11-03 03:42:49,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3003 states, 2884 states have (on average 4.592579750346741) internal successors, (13245), 3002 states have internal predecessors, (13245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:49,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3003 states to 3003 states and 13245 transitions. [2022-11-03 03:42:49,972 INFO L78 Accepts]: Start accepts. Automaton has 3003 states and 13245 transitions. Word has length 10 [2022-11-03 03:42:49,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:49,972 INFO L495 AbstractCegarLoop]: Abstraction has 3003 states and 13245 transitions. [2022-11-03 03:42:49,972 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-03 03:42:49,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3003 states and 13245 transitions. [2022-11-03 03:42:49,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 03:42:49,973 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:49,973 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:49,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-03 03:42:49,973 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:49,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:49,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1220640086, now seen corresponding path program 1 times [2022-11-03 03:42:49,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:49,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96455225] [2022-11-03 03:42:49,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:49,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:50,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:42:50,052 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:50,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96455225] [2022-11-03 03:42:50,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96455225] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:42:50,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:42:50,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:42:50,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900042224] [2022-11-03 03:42:50,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:42:50,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:42:50,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:50,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:42:50,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:42:50,055 INFO L87 Difference]: Start difference. First operand 3003 states and 13245 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-03 03:42:50,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:50,120 INFO L93 Difference]: Finished difference Result 2457 states and 10582 transitions. [2022-11-03 03:42:50,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:42:50,120 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-03 03:42:50,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:50,132 INFO L225 Difference]: With dead ends: 2457 [2022-11-03 03:42:50,132 INFO L226 Difference]: Without dead ends: 2437 [2022-11-03 03:42:50,132 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-03 03:42:50,133 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:50,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:42:50,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2022-11-03 03:42:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 1993. [2022-11-03 03:42:50,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1993 states, 1914 states have (on average 4.425287356321839) internal successors, (8470), 1992 states have internal predecessors, (8470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:50,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 8470 transitions. [2022-11-03 03:42:50,188 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 8470 transitions. Word has length 10 [2022-11-03 03:42:50,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:50,188 INFO L495 AbstractCegarLoop]: Abstraction has 1993 states and 8470 transitions. [2022-11-03 03:42:50,189 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-03 03:42:50,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 8470 transitions. [2022-11-03 03:42:50,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 03:42:50,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:50,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:50,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-03 03:42:50,190 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:50,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:50,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1562877806, now seen corresponding path program 1 times [2022-11-03 03:42:50,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:50,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704102423] [2022-11-03 03:42:50,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:50,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:50,595 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-03 03:42:50,596 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:50,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704102423] [2022-11-03 03:42:50,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704102423] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:50,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460317915] [2022-11-03 03:42:50,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:50,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:50,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:50,599 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:50,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-03 03:42:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:50,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 03:42:50,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:50,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:50,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:50,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:51,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:51,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:51,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:51,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:51,242 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-03 03:42:51,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:51,545 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:51,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 35 [2022-11-03 03:42:51,556 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:51,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 343 treesize of output 331 [2022-11-03 03:42:51,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 314 treesize of output 266 [2022-11-03 03:42:51,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 266 treesize of output 242 [2022-11-03 03:42:51,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 242 treesize of output 230 [2022-11-03 03:42:51,923 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-03 03:42:51,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460317915] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:51,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1612830158] [2022-11-03 03:42:51,923 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-03 03:42:51,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:51,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-03 03:42:51,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550438796] [2022-11-03 03:42:51,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:51,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 03:42:51,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:51,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 03:42:51,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=314, Unknown=3, NotChecked=0, Total=380 [2022-11-03 03:42:51,925 INFO L87 Difference]: Start difference. First operand 1993 states and 8470 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-03 03:42:52,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:52,541 INFO L93 Difference]: Finished difference Result 1987 states and 8400 transitions. [2022-11-03 03:42:52,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:42:52,541 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-03 03:42:52,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:52,548 INFO L225 Difference]: With dead ends: 1987 [2022-11-03 03:42:52,549 INFO L226 Difference]: Without dead ends: 1987 [2022-11-03 03:42:52,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=489, Unknown=3, NotChecked=0, Total=600 [2022-11-03 03:42:52,550 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 82 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 396 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:52,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 66 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 383 Invalid, 0 Unknown, 396 Unchecked, 0.3s Time] [2022-11-03 03:42:52,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2022-11-03 03:42:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1979. [2022-11-03 03:42:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1979 states, 1900 states have (on average 4.416842105263158) internal successors, (8392), 1978 states have internal predecessors, (8392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:52,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 8392 transitions. [2022-11-03 03:42:52,603 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 8392 transitions. Word has length 10 [2022-11-03 03:42:52,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:52,603 INFO L495 AbstractCegarLoop]: Abstraction has 1979 states and 8392 transitions. [2022-11-03 03:42:52,603 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-03 03:42:52,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 8392 transitions. [2022-11-03 03:42:52,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 03:42:52,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:52,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:52,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-03 03:42:52,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:52,819 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:52,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:52,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1562877810, now seen corresponding path program 1 times [2022-11-03 03:42:52,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:52,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760615931] [2022-11-03 03:42:52,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:52,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:53,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-03 03:42:53,237 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:53,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760615931] [2022-11-03 03:42:53,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760615931] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:53,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422897420] [2022-11-03 03:42:53,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:53,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:53,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:53,239 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:53,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-03 03:42:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:53,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 03:42:53,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:53,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:53,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:53,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:53,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:53,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:53,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:53,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:53,925 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-03 03:42:53,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:54,215 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:54,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 33 [2022-11-03 03:42:54,227 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:54,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 155 treesize of output 151 [2022-11-03 03:42:54,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 136 treesize of output 124 [2022-11-03 03:42:54,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 100 [2022-11-03 03:42:54,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2022-11-03 03:42:54,476 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-03 03:42:54,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422897420] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:54,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [120546423] [2022-11-03 03:42:54,476 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-03 03:42:54,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:54,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-03 03:42:54,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938255631] [2022-11-03 03:42:54,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:54,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 03:42:54,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:54,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 03:42:54,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=314, Unknown=3, NotChecked=0, Total=380 [2022-11-03 03:42:54,478 INFO L87 Difference]: Start difference. First operand 1979 states and 8392 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-03 03:42:55,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:55,060 INFO L93 Difference]: Finished difference Result 1945 states and 8260 transitions. [2022-11-03 03:42:55,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:42:55,061 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-03 03:42:55,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:55,069 INFO L225 Difference]: With dead ends: 1945 [2022-11-03 03:42:55,069 INFO L226 Difference]: Without dead ends: 1820 [2022-11-03 03:42:55,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=489, Unknown=3, NotChecked=0, Total=600 [2022-11-03 03:42:55,073 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 76 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 305 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:55,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 63 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 0 Unknown, 305 Unchecked, 0.3s Time] [2022-11-03 03:42:55,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2022-11-03 03:42:55,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1820. [2022-11-03 03:42:55,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1820 states, 1741 states have (on average 4.518093049971281) internal successors, (7866), 1819 states have internal predecessors, (7866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:55,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 7866 transitions. [2022-11-03 03:42:55,128 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 7866 transitions. Word has length 10 [2022-11-03 03:42:55,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:55,128 INFO L495 AbstractCegarLoop]: Abstraction has 1820 states and 7866 transitions. [2022-11-03 03:42:55,129 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-03 03:42:55,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 7866 transitions. [2022-11-03 03:42:55,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:42:55,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:55,130 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:55,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-03 03:42:55,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:55,343 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:55,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:55,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1964472839, now seen corresponding path program 2 times [2022-11-03 03:42:55,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:55,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025142453] [2022-11-03 03:42:55,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:55,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:55,794 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-03 03:42:55,795 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:55,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025142453] [2022-11-03 03:42:55,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025142453] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:55,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800028680] [2022-11-03 03:42:55,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:42:55,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:55,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:55,796 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:55,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-03 03:42:56,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 03:42:56,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:42:56,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 03:42:56,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:56,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:56,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:56,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:56,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:56,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:56,575 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:42:56,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:56,907 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:56,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:56,918 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:56,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 89 treesize of output 85 [2022-11-03 03:42:56,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 56 [2022-11-03 03:42:56,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 24 [2022-11-03 03:42:57,244 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-03 03:42:57,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800028680] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:57,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1708576294] [2022-11-03 03:42:57,244 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-03 03:42:57,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:57,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-03 03:42:57,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450345251] [2022-11-03 03:42:57,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:57,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 03:42:57,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:57,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 03:42:57,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=711, Unknown=5, NotChecked=0, Total=812 [2022-11-03 03:42:57,246 INFO L87 Difference]: Start difference. First operand 1820 states and 7866 transitions. Second operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 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-03 03:42:57,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:57,860 INFO L93 Difference]: Finished difference Result 1838 states and 7921 transitions. [2022-11-03 03:42:57,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 03:42:57,860 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 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-03 03:42:57,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:57,866 INFO L225 Difference]: With dead ends: 1838 [2022-11-03 03:42:57,866 INFO L226 Difference]: Without dead ends: 1838 [2022-11-03 03:42:57,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=193, Invalid=1362, Unknown=5, NotChecked=0, Total=1560 [2022-11-03 03:42:57,867 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:57,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 52 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 102 Unchecked, 0.2s Time] [2022-11-03 03:42:57,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2022-11-03 03:42:57,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1834. [2022-11-03 03:42:57,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1755 states have (on average 4.507122507122507) internal successors, (7910), 1833 states have internal predecessors, (7910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:42:57,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 7910 transitions. [2022-11-03 03:42:57,905 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 7910 transitions. Word has length 11 [2022-11-03 03:42:57,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:57,905 INFO L495 AbstractCegarLoop]: Abstraction has 1834 states and 7910 transitions. [2022-11-03 03:42:57,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 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-03 03:42:57,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 7910 transitions. [2022-11-03 03:42:57,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:42:57,906 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:57,906 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:57,911 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-11-03 03:42:58,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:58,108 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:42:58,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:58,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1964472843, now seen corresponding path program 2 times [2022-11-03 03:42:58,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:58,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507289249] [2022-11-03 03:42:58,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:58,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:58,516 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-03 03:42:58,516 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:58,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507289249] [2022-11-03 03:42:58,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507289249] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:58,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360424326] [2022-11-03 03:42:58,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:42:58,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:58,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:58,519 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:58,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-03 03:42:58,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 03:42:58,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:42:58,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 03:42:58,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:59,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:59,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:59,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:59,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:59,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:42:59,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:59,642 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:59,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:42:59,653 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:42:59,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 157 treesize of output 145 [2022-11-03 03:42:59,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 106 [2022-11-03 03:42:59,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 94 [2022-11-03 03:43:00,011 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-03 03:43:00,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360424326] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:43:00,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1343389790] [2022-11-03 03:43:00,012 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-03 03:43:00,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:43:00,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-03 03:43:00,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333021259] [2022-11-03 03:43:00,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:43:00,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 03:43:00,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:00,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 03:43:00,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=713, Unknown=3, NotChecked=0, Total=812 [2022-11-03 03:43:00,013 INFO L87 Difference]: Start difference. First operand 1834 states and 7910 transitions. Second operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 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-03 03:43:00,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:00,707 INFO L93 Difference]: Finished difference Result 1952 states and 8206 transitions. [2022-11-03 03:43:00,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 03:43:00,707 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 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-03 03:43:00,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:00,713 INFO L225 Difference]: With dead ends: 1952 [2022-11-03 03:43:00,713 INFO L226 Difference]: Without dead ends: 1952 [2022-11-03 03:43:00,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=193, Invalid=1364, Unknown=3, NotChecked=0, Total=1560 [2022-11-03 03:43:00,714 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 20 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:00,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 94 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 413 Invalid, 0 Unknown, 129 Unchecked, 0.3s Time] [2022-11-03 03:43:00,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2022-11-03 03:43:00,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1834. [2022-11-03 03:43:00,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1755 states have (on average 4.504273504273504) internal successors, (7905), 1833 states have internal predecessors, (7905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:00,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 7905 transitions. [2022-11-03 03:43:00,751 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 7905 transitions. Word has length 11 [2022-11-03 03:43:00,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:00,751 INFO L495 AbstractCegarLoop]: Abstraction has 1834 states and 7905 transitions. [2022-11-03 03:43:00,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 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-03 03:43:00,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 7905 transitions. [2022-11-03 03:43:00,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:43:00,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:00,752 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:00,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-03 03:43:00,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-11-03 03:43:00,952 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:43:00,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:00,952 INFO L85 PathProgramCache]: Analyzing trace with hash 2134767587, now seen corresponding path program 3 times [2022-11-03 03:43:00,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:00,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285676979] [2022-11-03 03:43:00,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:00,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:01,380 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-03 03:43:01,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:01,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285676979] [2022-11-03 03:43:01,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285676979] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:43:01,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726714141] [2022-11-03 03:43:01,381 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:43:01,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:01,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:43:01,391 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:43:01,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-03 03:43:01,669 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:43:01,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:43:01,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 03:43:01,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:01,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:01,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:01,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:01,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:01,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:01,920 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-03 03:43:01,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:43:02,001 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1737 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1737) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 8)) 9223372039002259456))) is different from false [2022-11-03 03:43:02,006 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1737 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1737) c_~A~0.base) (+ c_~A~0.offset 8)) 9223372039002259456))) is different from false [2022-11-03 03:43:02,019 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1736) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1737) |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-03 03:43:02,030 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:02,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:02,038 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:02,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 159 treesize of output 149 [2022-11-03 03:43:02,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 67 treesize of output 59 [2022-11-03 03:43:02,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 126 treesize of output 110 [2022-11-03 03:43:02,190 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-03 03:43:02,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726714141] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:43:02,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [904873018] [2022-11-03 03:43:02,191 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-03 03:43:02,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:43:02,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-03 03:43:02,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625548963] [2022-11-03 03:43:02,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:43:02,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 03:43:02,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:02,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 03:43:02,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=584, Unknown=3, NotChecked=150, Total=812 [2022-11-03 03:43:02,192 INFO L87 Difference]: Start difference. First operand 1834 states and 7905 transitions. Second operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 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-03 03:43:03,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:03,668 INFO L93 Difference]: Finished difference Result 2277 states and 8849 transitions. [2022-11-03 03:43:03,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 03:43:03,668 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 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-03 03:43:03,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:03,674 INFO L225 Difference]: With dead ends: 2277 [2022-11-03 03:43:03,674 INFO L226 Difference]: Without dead ends: 2277 [2022-11-03 03:43:03,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=165, Invalid=1176, Unknown=3, NotChecked=216, Total=1560 [2022-11-03 03:43:03,675 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 270 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 270 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:03,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 114 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1150 Invalid, 0 Unknown, 270 Unchecked, 0.8s Time] [2022-11-03 03:43:03,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277 states. [2022-11-03 03:43:03,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 1834. [2022-11-03 03:43:03,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1755 states have (on average 4.498575498575499) internal successors, (7895), 1833 states have internal predecessors, (7895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:03,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 7895 transitions. [2022-11-03 03:43:03,728 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 7895 transitions. Word has length 11 [2022-11-03 03:43:03,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:03,729 INFO L495 AbstractCegarLoop]: Abstraction has 1834 states and 7895 transitions. [2022-11-03 03:43:03,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 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-03 03:43:03,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 7895 transitions. [2022-11-03 03:43:03,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:43:03,730 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:03,730 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:03,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-11-03 03:43:03,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-11-03 03:43:03,930 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:43:03,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:03,931 INFO L85 PathProgramCache]: Analyzing trace with hash 2134767583, now seen corresponding path program 3 times [2022-11-03 03:43:03,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:03,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746035277] [2022-11-03 03:43:03,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:03,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:04,343 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-03 03:43:04,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:04,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746035277] [2022-11-03 03:43:04,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746035277] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:43:04,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105118322] [2022-11-03 03:43:04,344 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:43:04,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:04,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:43:04,347 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:43:04,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-03 03:43:04,616 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:43:04,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:43:04,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 03:43:04,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:04,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:04,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:04,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:04,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:04,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:04,866 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-03 03:43:04,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:43:04,946 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1789 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1789) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 8)) 4294967296)) is different from false [2022-11-03 03:43:04,950 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1789 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1789) c_~A~0.base) (+ c_~A~0.offset 8)) 4294967296)) is different from false [2022-11-03 03:43:04,958 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1789 (Array Int Int)) (v_ArrVal_1788 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1788) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1789) |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-03 03:43:04,966 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:04,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:04,974 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:04,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:04,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:04,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:05,120 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-03 03:43:05,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105118322] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:43:05,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [617395951] [2022-11-03 03:43:05,121 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-03 03:43:05,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:43:05,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-03 03:43:05,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958225931] [2022-11-03 03:43:05,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:43:05,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 03:43:05,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:05,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 03:43:05,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=584, Unknown=3, NotChecked=150, Total=812 [2022-11-03 03:43:05,123 INFO L87 Difference]: Start difference. First operand 1834 states and 7895 transitions. Second operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 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-03 03:43:06,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:06,576 INFO L93 Difference]: Finished difference Result 2267 states and 8818 transitions. [2022-11-03 03:43:06,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 03:43:06,576 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 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-03 03:43:06,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:06,582 INFO L225 Difference]: With dead ends: 2267 [2022-11-03 03:43:06,582 INFO L226 Difference]: Without dead ends: 2267 [2022-11-03 03:43:06,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=165, Invalid=1176, Unknown=3, NotChecked=216, Total=1560 [2022-11-03 03:43:06,583 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 232 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 381 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:06,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 126 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1243 Invalid, 0 Unknown, 381 Unchecked, 0.8s Time] [2022-11-03 03:43:06,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2022-11-03 03:43:06,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 1834. [2022-11-03 03:43:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1755 states have (on average 4.492877492877493) internal successors, (7885), 1833 states have internal predecessors, (7885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:06,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 7885 transitions. [2022-11-03 03:43:06,634 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 7885 transitions. Word has length 11 [2022-11-03 03:43:06,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:06,634 INFO L495 AbstractCegarLoop]: Abstraction has 1834 states and 7885 transitions. [2022-11-03 03:43:06,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 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-03 03:43:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 7885 transitions. [2022-11-03 03:43:06,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:43:06,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:06,635 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:06,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-03 03:43:06,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:06,847 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:43:06,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:06,847 INFO L85 PathProgramCache]: Analyzing trace with hash 756164343, now seen corresponding path program 1 times [2022-11-03 03:43:06,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:06,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235148561] [2022-11-03 03:43:06,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:06,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:07,250 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-03 03:43:07,250 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:07,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235148561] [2022-11-03 03:43:07,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235148561] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:43:07,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384973677] [2022-11-03 03:43:07,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:07,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:07,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:43:07,252 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:43:07,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-03 03:43:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:07,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 03:43:07,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:07,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:07,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:07,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:07,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:07,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:07,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:07,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:07,843 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-03 03:43:07,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:43:07,897 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1842 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1842) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-11-03 03:43:07,905 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1842 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1842) c_~A~0.base) (+ c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-11-03 03:43:07,911 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1841 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1841) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1842) c_~A~0.base) (+ c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-11-03 03:43:07,922 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1840 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1840) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1841) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1842) |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-03 03:43:07,932 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:07,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 33 [2022-11-03 03:43:07,944 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:07,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1235 treesize of output 1189 [2022-11-03 03:43:07,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1174 treesize of output 1110 [2022-11-03 03:43:07,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 571 treesize of output 539 [2022-11-03 03:43:07,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1078 treesize of output 950 [2022-11-03 03:43:09,185 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-03 03:43:09,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384973677] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:43:09,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [385277139] [2022-11-03 03:43:09,186 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-03 03:43:09,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:43:09,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 03:43:09,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113852540] [2022-11-03 03:43:09,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:43:09,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 03:43:09,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:09,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 03:43:09,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=406, Unknown=4, NotChecked=172, Total=650 [2022-11-03 03:43:09,189 INFO L87 Difference]: Start difference. First operand 1834 states and 7885 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-03 03:43:10,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:10,234 INFO L93 Difference]: Finished difference Result 2506 states and 9659 transitions. [2022-11-03 03:43:10,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:43:10,235 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-03 03:43:10,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:10,241 INFO L225 Difference]: With dead ends: 2506 [2022-11-03 03:43:10,242 INFO L226 Difference]: Without dead ends: 2506 [2022-11-03 03:43:10,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=131, Invalid=693, Unknown=4, NotChecked=228, Total=1056 [2022-11-03 03:43:10,243 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 342 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 291 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:10,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 57 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 607 Invalid, 0 Unknown, 291 Unchecked, 0.5s Time] [2022-11-03 03:43:10,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2022-11-03 03:43:10,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1794. [2022-11-03 03:43:10,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1794 states, 1715 states have (on average 4.3988338192419825) internal successors, (7544), 1793 states have internal predecessors, (7544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 7544 transitions. [2022-11-03 03:43:10,277 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 7544 transitions. Word has length 11 [2022-11-03 03:43:10,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:10,278 INFO L495 AbstractCegarLoop]: Abstraction has 1794 states and 7544 transitions. [2022-11-03 03:43:10,278 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-03 03:43:10,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 7544 transitions. [2022-11-03 03:43:10,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:43:10,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:10,278 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:10,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-11-03 03:43:10,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-11-03 03:43:10,479 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:43:10,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:10,479 INFO L85 PathProgramCache]: Analyzing trace with hash 756164339, now seen corresponding path program 1 times [2022-11-03 03:43:10,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:10,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592814851] [2022-11-03 03:43:10,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:10,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:10,865 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-03 03:43:10,865 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:10,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592814851] [2022-11-03 03:43:10,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592814851] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:43:10,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219685093] [2022-11-03 03:43:10,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:10,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:10,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:43:10,866 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:43:10,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-11-03 03:43:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:11,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 03:43:11,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:11,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:11,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:11,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:11,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:11,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:11,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:11,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:11,358 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-03 03:43:11,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:43:11,404 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1895 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1895) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 4)) 4294967296)) is different from false [2022-11-03 03:43:11,417 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1895 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1895) c_~A~0.base) (+ c_~A~0.offset 4)) 4294967296)) is different from false [2022-11-03 03:43:11,423 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1895 (Array Int Int)) (v_ArrVal_1894 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1895) c_~A~0.base) (+ c_~A~0.offset 4)) 4294967296)) is different from false [2022-11-03 03:43:11,431 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1895 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1895) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 03:43:11,440 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:11,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 03:43:11,450 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:11,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1105 treesize of output 1059 [2022-11-03 03:43:11,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1046 treesize of output 982 [2022-11-03 03:43:11,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 982 treesize of output 854 [2022-11-03 03:43:11,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 854 treesize of output 822 [2022-11-03 03:43:13,448 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-03 03:43:13,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219685093] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:43:13,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [525300322] [2022-11-03 03:43:13,449 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-03 03:43:13,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:43:13,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 03:43:13,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905222821] [2022-11-03 03:43:13,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:43:13,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 03:43:13,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:13,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 03:43:13,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=407, Unknown=4, NotChecked=172, Total=650 [2022-11-03 03:43:13,452 INFO L87 Difference]: Start difference. First operand 1794 states and 7544 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-03 03:43:14,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:14,496 INFO L93 Difference]: Finished difference Result 2362 states and 9049 transitions. [2022-11-03 03:43:14,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:43:14,496 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-03 03:43:14,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:14,503 INFO L225 Difference]: With dead ends: 2362 [2022-11-03 03:43:14,503 INFO L226 Difference]: Without dead ends: 2356 [2022-11-03 03:43:14,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=130, Invalid=694, Unknown=4, NotChecked=228, Total=1056 [2022-11-03 03:43:14,503 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 303 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:14,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 59 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 629 Invalid, 0 Unknown, 298 Unchecked, 0.5s Time] [2022-11-03 03:43:14,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2022-11-03 03:43:14,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 1748. [2022-11-03 03:43:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1669 states have (on average 4.300778909526663) internal successors, (7178), 1747 states have internal predecessors, (7178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:14,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 7178 transitions. [2022-11-03 03:43:14,541 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 7178 transitions. Word has length 11 [2022-11-03 03:43:14,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:14,541 INFO L495 AbstractCegarLoop]: Abstraction has 1748 states and 7178 transitions. [2022-11-03 03:43:14,541 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-03 03:43:14,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 7178 transitions. [2022-11-03 03:43:14,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:43:14,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:14,542 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:14,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-11-03 03:43:14,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-11-03 03:43:14,742 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:43:14,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:14,743 INFO L85 PathProgramCache]: Analyzing trace with hash 820796806, now seen corresponding path program 2 times [2022-11-03 03:43:14,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:14,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652783205] [2022-11-03 03:43:14,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:14,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:15,305 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:15,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652783205] [2022-11-03 03:43:15,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652783205] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:43:15,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39111732] [2022-11-03 03:43:15,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:43:15,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:15,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:43:15,307 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:43:15,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-03 03:43:15,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:43:15,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:43:15,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 03:43:15,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:15,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:15,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 30 [2022-11-03 03:43:15,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:15,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-11-03 03:43:15,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:15,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-11-03 03:43:15,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:15,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-11-03 03:43:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:16,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:43:16,156 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~M~0 c_~N~0)) (forall ((v_ArrVal_1950 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1950) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 9223372039002259456)))) is different from false [2022-11-03 03:43:16,169 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1950 (Array Int Int)) (v_ArrVal_1949 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1949) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1950) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0)))))) (not (< c_~M~0 c_~N~0))) is different from false [2022-11-03 03:43:16,354 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:16,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 48 [2022-11-03 03:43:16,376 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:16,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 697 treesize of output 674 [2022-11-03 03:43:16,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 319 treesize of output 295 [2022-11-03 03:43:16,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 614 treesize of output 518 [2022-11-03 03:43:16,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 518 treesize of output 470 [2022-11-03 03:43:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:16,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39111732] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:43:16,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [520721584] [2022-11-03 03:43:16,844 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-03 03:43:16,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:43:16,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-03 03:43:16,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192787373] [2022-11-03 03:43:16,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:43:16,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 03:43:16,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:16,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 03:43:16,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=355, Unknown=3, NotChecked=78, Total=506 [2022-11-03 03:43:16,846 INFO L87 Difference]: Start difference. First operand 1748 states and 7178 transitions. Second operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 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-03 03:43:26,178 WARN L234 SmtUtils]: Spent 6.34s on a formula simplification. DAG size of input: 110 DAG size of output: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:43:28,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:28,801 INFO L93 Difference]: Finished difference Result 2306 states and 9824 transitions. [2022-11-03 03:43:28,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 03:43:28,802 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 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-03 03:43:28,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:28,808 INFO L225 Difference]: With dead ends: 2306 [2022-11-03 03:43:28,809 INFO L226 Difference]: Without dead ends: 2306 [2022-11-03 03:43:28,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=163, Invalid=712, Unknown=3, NotChecked=114, Total=992 [2022-11-03 03:43:28,809 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 260 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 383 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:28,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 80 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 508 Invalid, 0 Unknown, 383 Unchecked, 0.6s Time] [2022-11-03 03:43:28,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2022-11-03 03:43:28,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1943. [2022-11-03 03:43:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1943 states, 1864 states have (on average 4.622854077253219) internal successors, (8617), 1942 states have internal predecessors, (8617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:28,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1943 states and 8617 transitions. [2022-11-03 03:43:28,849 INFO L78 Accepts]: Start accepts. Automaton has 1943 states and 8617 transitions. Word has length 11 [2022-11-03 03:43:28,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:28,849 INFO L495 AbstractCegarLoop]: Abstraction has 1943 states and 8617 transitions. [2022-11-03 03:43:28,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 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-03 03:43:28,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 8617 transitions. [2022-11-03 03:43:28,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:43:28,850 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:28,850 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:28,878 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-11-03 03:43:29,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:29,051 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:43:29,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:29,051 INFO L85 PathProgramCache]: Analyzing trace with hash 820796810, now seen corresponding path program 2 times [2022-11-03 03:43:29,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:29,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030129801] [2022-11-03 03:43:29,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:29,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:29,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:29,676 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:29,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030129801] [2022-11-03 03:43:29,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030129801] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:43:29,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129194516] [2022-11-03 03:43:29,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:43:29,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:29,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:43:29,678 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:43:29,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-11-03 03:43:30,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:43:30,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:43:30,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-03 03:43:30,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:30,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:30,163 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-03 03:43:30,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:30,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:30,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:30,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:30,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:30,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:30,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:30,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:30,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:43:31,155 INFO L356 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-03 03:43:31,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 54 [2022-11-03 03:43:31,192 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:31,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 330 treesize of output 334 [2022-11-03 03:43:31,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 282 treesize of output 234 [2022-11-03 03:43:31,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 234 treesize of output 210 [2022-11-03 03:43:31,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 111 treesize of output 99 [2022-11-03 03:43:31,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:31,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129194516] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:43:31,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1450063829] [2022-11-03 03:43:31,683 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-03 03:43:31,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:43:31,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-03 03:43:31,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753471343] [2022-11-03 03:43:31,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:43:31,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 03:43:31,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:31,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 03:43:31,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=424, Unknown=4, NotChecked=0, Total=506 [2022-11-03 03:43:31,685 INFO L87 Difference]: Start difference. First operand 1943 states and 8617 transitions. Second operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 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-03 03:43:32,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:32,663 INFO L93 Difference]: Finished difference Result 2627 states and 11469 transitions. [2022-11-03 03:43:32,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 03:43:32,663 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 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-03 03:43:32,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:32,670 INFO L225 Difference]: With dead ends: 2627 [2022-11-03 03:43:32,670 INFO L226 Difference]: Without dead ends: 2575 [2022-11-03 03:43:32,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=161, Invalid=827, Unknown=4, NotChecked=0, Total=992 [2022-11-03 03:43:32,671 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 177 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 768 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:32,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 76 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 267 Invalid, 0 Unknown, 768 Unchecked, 0.3s Time] [2022-11-03 03:43:32,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2022-11-03 03:43:32,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2235. [2022-11-03 03:43:32,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2235 states, 2156 states have (on average 4.783395176252319) internal successors, (10313), 2234 states have internal predecessors, (10313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 10313 transitions. [2022-11-03 03:43:32,717 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 10313 transitions. Word has length 11 [2022-11-03 03:43:32,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:32,717 INFO L495 AbstractCegarLoop]: Abstraction has 2235 states and 10313 transitions. [2022-11-03 03:43:32,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 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-03 03:43:32,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 10313 transitions. [2022-11-03 03:43:32,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:43:32,718 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:32,718 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:32,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-11-03 03:43:32,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-11-03 03:43:32,923 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:43:32,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:32,923 INFO L85 PathProgramCache]: Analyzing trace with hash 820763568, now seen corresponding path program 1 times [2022-11-03 03:43:32,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:32,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716067213] [2022-11-03 03:43:32,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:32,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:33,552 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-03 03:43:33,553 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:33,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716067213] [2022-11-03 03:43:33,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716067213] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:43:33,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318127331] [2022-11-03 03:43:33,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:33,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:33,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:43:33,555 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:43:33,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-11-03 03:43:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:33,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 03:43:33,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:33,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:33,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:33,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:34,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:34,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:34,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:34,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:34,162 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-03 03:43:34,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:43:34,249 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2058 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2058) c_~A~0.base) (+ c_~A~0.offset 4)) 4294967296)) is different from false [2022-11-03 03:43:34,257 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2058 (Array Int Int)) (v_ArrVal_2057 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2058) c_~A~0.base) (+ c_~A~0.offset 4)) 4294967296)) is different from false [2022-11-03 03:43:34,267 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2058 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2056 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2056) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2058) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 03:43:34,277 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:34,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 03:43:34,286 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:34,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 277 treesize of output 267 [2022-11-03 03:43:34,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 254 treesize of output 238 [2022-11-03 03:43:34,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 238 treesize of output 206 [2022-11-03 03:43:34,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 98 [2022-11-03 03:43:34,568 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-03 03:43:34,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318127331] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:43:34,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [352525456] [2022-11-03 03:43:34,568 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-03 03:43:34,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:43:34,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 03:43:34,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059768362] [2022-11-03 03:43:34,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:43:34,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 03:43:34,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:34,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 03:43:34,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=437, Unknown=3, NotChecked=132, Total=650 [2022-11-03 03:43:34,570 INFO L87 Difference]: Start difference. First operand 2235 states and 10313 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-03 03:43:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:36,032 INFO L93 Difference]: Finished difference Result 3263 states and 14738 transitions. [2022-11-03 03:43:36,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:43:36,033 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-03 03:43:36,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:36,043 INFO L225 Difference]: With dead ends: 3263 [2022-11-03 03:43:36,043 INFO L226 Difference]: Without dead ends: 3263 [2022-11-03 03:43:36,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=168, Invalid=771, Unknown=3, NotChecked=180, Total=1122 [2022-11-03 03:43:36,044 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 327 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:36,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 69 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 691 Invalid, 0 Unknown, 175 Unchecked, 0.7s Time] [2022-11-03 03:43:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3263 states. [2022-11-03 03:43:36,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3263 to 2519. [2022-11-03 03:43:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2519 states, 2440 states have (on average 4.9557377049180324) internal successors, (12092), 2518 states have internal predecessors, (12092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:36,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 12092 transitions. [2022-11-03 03:43:36,099 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 12092 transitions. Word has length 11 [2022-11-03 03:43:36,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:36,100 INFO L495 AbstractCegarLoop]: Abstraction has 2519 states and 12092 transitions. [2022-11-03 03:43:36,100 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-03 03:43:36,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 12092 transitions. [2022-11-03 03:43:36,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:43:36,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:36,101 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:36,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-11-03 03:43:36,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2022-11-03 03:43:36,301 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:43:36,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:36,302 INFO L85 PathProgramCache]: Analyzing trace with hash 820763570, now seen corresponding path program 1 times [2022-11-03 03:43:36,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:36,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434056658] [2022-11-03 03:43:36,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:36,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:36,689 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-03 03:43:36,689 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:36,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434056658] [2022-11-03 03:43:36,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434056658] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:43:36,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648877164] [2022-11-03 03:43:36,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:36,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:36,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:43:36,691 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:43:36,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-11-03 03:43:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:37,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 03:43:37,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:37,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:37,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:37,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:37,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:37,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:37,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:37,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:37,291 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-03 03:43:37,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:43:37,365 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2111 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2111) c_~A~0.base) (+ c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-11-03 03:43:37,373 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2111 (Array Int Int)) (v_ArrVal_2110 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2110) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2111) c_~A~0.base) (+ c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-11-03 03:43:37,383 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2111 (Array Int Int)) (v_ArrVal_2110 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2109) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2110) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2111) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2022-11-03 03:43:37,392 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:37,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 33 [2022-11-03 03:43:37,403 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:37,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1235 treesize of output 1189 [2022-11-03 03:43:37,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1174 treesize of output 1046 [2022-11-03 03:43:37,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1046 treesize of output 1014 [2022-11-03 03:43:37,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1014 treesize of output 950 [2022-11-03 03:43:38,530 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-03 03:43:38,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648877164] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:43:38,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [311300990] [2022-11-03 03:43:38,531 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java: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-03 03:43:38,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:43:38,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 03:43:38,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064597582] [2022-11-03 03:43:38,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:43:38,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 03:43:38,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:38,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 03:43:38,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=435, Unknown=3, NotChecked=132, Total=650 [2022-11-03 03:43:38,532 INFO L87 Difference]: Start difference. First operand 2519 states and 12092 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-03 03:43:39,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:39,709 INFO L93 Difference]: Finished difference Result 3023 states and 13590 transitions. [2022-11-03 03:43:39,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:43:39,709 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-03 03:43:39,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:39,718 INFO L225 Difference]: With dead ends: 3023 [2022-11-03 03:43:39,719 INFO L226 Difference]: Without dead ends: 3023 [2022-11-03 03:43:39,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=170, Invalid=769, Unknown=3, NotChecked=180, Total=1122 [2022-11-03 03:43:39,719 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 272 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 194 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:39,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 52 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 531 Invalid, 0 Unknown, 194 Unchecked, 0.5s Time] [2022-11-03 03:43:39,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3023 states. [2022-11-03 03:43:39,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3023 to 2519. [2022-11-03 03:43:39,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2519 states, 2440 states have (on average 4.839344262295082) internal successors, (11808), 2518 states have internal predecessors, (11808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:39,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 11808 transitions. [2022-11-03 03:43:39,775 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 11808 transitions. Word has length 11 [2022-11-03 03:43:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:39,775 INFO L495 AbstractCegarLoop]: Abstraction has 2519 states and 11808 transitions. [2022-11-03 03:43:39,775 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-03 03:43:39,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 11808 transitions. [2022-11-03 03:43:39,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:43:39,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:39,776 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:39,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-11-03 03:43:40,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:40,003 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:43:40,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:40,003 INFO L85 PathProgramCache]: Analyzing trace with hash 814868794, now seen corresponding path program 3 times [2022-11-03 03:43:40,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:40,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660812510] [2022-11-03 03:43:40,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:40,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:40,160 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-03 03:43:40,160 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:40,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660812510] [2022-11-03 03:43:40,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660812510] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:43:40,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922753800] [2022-11-03 03:43:40,160 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:43:40,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:40,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:43:40,161 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:43:40,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-11-03 03:43:40,443 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:43:40,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:43:40,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 03:43:40,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:40,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:40,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:43:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:40,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922753800] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:43:40,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [200405549] [2022-11-03 03:43:40,702 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-03 03:43:40,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:43:40,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-11-03 03:43:40,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298028976] [2022-11-03 03:43:40,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:43:40,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 03:43:40,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:40,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 03:43:40,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-11-03 03:43:40,703 INFO L87 Difference]: Start difference. First operand 2519 states and 11808 transitions. Second operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 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-03 03:43:41,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:41,232 INFO L93 Difference]: Finished difference Result 2381 states and 11125 transitions. [2022-11-03 03:43:41,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:43:41,232 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 03:43:41,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:41,238 INFO L225 Difference]: With dead ends: 2381 [2022-11-03 03:43:41,238 INFO L226 Difference]: Without dead ends: 2090 [2022-11-03 03:43:41,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2022-11-03 03:43:41,239 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 167 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:41,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 42 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:43:41,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2022-11-03 03:43:41,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2090. [2022-11-03 03:43:41,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2090 states, 2011 states have (on average 5.063649925410243) internal successors, (10183), 2089 states have internal predecessors, (10183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:41,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 10183 transitions. [2022-11-03 03:43:41,279 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 10183 transitions. Word has length 11 [2022-11-03 03:43:41,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:41,279 INFO L495 AbstractCegarLoop]: Abstraction has 2090 states and 10183 transitions. [2022-11-03 03:43:41,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 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-03 03:43:41,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 10183 transitions. [2022-11-03 03:43:41,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 03:43:41,280 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:41,280 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2022-11-03 03:43:41,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-11-03 03:43:41,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:41,491 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:43:41,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:41,491 INFO L85 PathProgramCache]: Analyzing trace with hash 604914321, now seen corresponding path program 5 times [2022-11-03 03:43:41,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:41,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68431283] [2022-11-03 03:43:41,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:41,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:41,945 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-03 03:43:41,945 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:41,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68431283] [2022-11-03 03:43:41,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68431283] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:43:41,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149587996] [2022-11-03 03:43:41,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:43:41,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:41,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:43:41,947 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:43:41,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-11-03 03:43:42,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 03:43:42,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:43:42,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 03:43:42,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:42,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:42,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:42,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:42,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:43:42,991 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:42,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-03 03:43:43,005 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:43,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 43 [2022-11-03 03:43:43,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:43,347 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-03 03:43:43,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149587996] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:43:43,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2012735111] [2022-11-03 03:43:43,348 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-03 03:43:43,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:43:43,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-03 03:43:43,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803086902] [2022-11-03 03:43:43,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:43:43,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 03:43:43,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:43,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 03:43:43,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=871, Unknown=0, NotChecked=0, Total=992 [2022-11-03 03:43:43,351 INFO L87 Difference]: Start difference. First operand 2090 states and 10183 transitions. Second operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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-03 03:43:44,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:44,039 INFO L93 Difference]: Finished difference Result 2098 states and 10206 transitions. [2022-11-03 03:43:44,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 03:43:44,039 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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-03 03:43:44,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:44,046 INFO L225 Difference]: With dead ends: 2098 [2022-11-03 03:43:44,046 INFO L226 Difference]: Without dead ends: 2098 [2022-11-03 03:43:44,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=212, Invalid=1510, Unknown=0, NotChecked=0, Total=1722 [2022-11-03 03:43:44,047 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:44,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 67 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 349 Invalid, 0 Unknown, 89 Unchecked, 0.3s Time] [2022-11-03 03:43:44,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2022-11-03 03:43:44,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 2098. [2022-11-03 03:43:44,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 2019 states have (on average 5.054977711738484) internal successors, (10206), 2097 states have internal predecessors, (10206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:44,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 10206 transitions. [2022-11-03 03:43:44,093 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 10206 transitions. Word has length 12 [2022-11-03 03:43:44,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:44,093 INFO L495 AbstractCegarLoop]: Abstraction has 2098 states and 10206 transitions. [2022-11-03 03:43:44,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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-03 03:43:44,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 10206 transitions. [2022-11-03 03:43:44,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 03:43:44,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:44,094 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2022-11-03 03:43:44,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-11-03 03:43:44,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:44,295 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:43:44,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:44,295 INFO L85 PathProgramCache]: Analyzing trace with hash 604914317, now seen corresponding path program 4 times [2022-11-03 03:43:44,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:44,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691830515] [2022-11-03 03:43:44,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:44,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:44,752 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-03 03:43:44,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:44,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691830515] [2022-11-03 03:43:44,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691830515] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:43:44,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454814686] [2022-11-03 03:43:44,753 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:43:44,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:44,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:43:44,754 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:43:44,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-11-03 03:43:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:45,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 03:43:45,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:45,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:45,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:45,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:45,450 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-03 03:43:45,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:43:45,599 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2257 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2257) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 03:43:45,607 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:45,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:45,614 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:45,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:45,772 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-03 03:43:45,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454814686] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:43:45,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2011619946] [2022-11-03 03:43:45,772 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-03 03:43:45,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:43:45,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-03 03:43:45,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876213722] [2022-11-03 03:43:45,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:43:45,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 03:43:45,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:45,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 03:43:45,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=841, Unknown=1, NotChecked=58, Total=992 [2022-11-03 03:43:45,774 INFO L87 Difference]: Start difference. First operand 2098 states and 10206 transitions. Second operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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-03 03:43:47,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:47,145 INFO L93 Difference]: Finished difference Result 3737 states and 16255 transitions. [2022-11-03 03:43:47,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 03:43:47,146 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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-03 03:43:47,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:47,157 INFO L225 Difference]: With dead ends: 3737 [2022-11-03 03:43:47,157 INFO L226 Difference]: Without dead ends: 3737 [2022-11-03 03:43:47,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=203, Invalid=1692, Unknown=1, NotChecked=84, Total=1980 [2022-11-03 03:43:47,158 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 151 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:47,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 95 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1173 Invalid, 0 Unknown, 117 Unchecked, 0.8s Time] [2022-11-03 03:43:47,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3737 states. [2022-11-03 03:43:47,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3737 to 2098. [2022-11-03 03:43:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 2019 states have (on average 5.053987122337791) internal successors, (10204), 2097 states have internal predecessors, (10204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 10204 transitions. [2022-11-03 03:43:47,215 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 10204 transitions. Word has length 12 [2022-11-03 03:43:47,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:47,215 INFO L495 AbstractCegarLoop]: Abstraction has 2098 states and 10204 transitions. [2022-11-03 03:43:47,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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-03 03:43:47,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 10204 transitions. [2022-11-03 03:43:47,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 03:43:47,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:47,216 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:47,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-11-03 03:43:47,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-11-03 03:43:47,419 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:43:47,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:47,419 INFO L85 PathProgramCache]: Analyzing trace with hash -708877666, now seen corresponding path program 1 times [2022-11-03 03:43:47,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:47,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218712759] [2022-11-03 03:43:47,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:47,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:47,516 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-03 03:43:47,516 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:47,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218712759] [2022-11-03 03:43:47,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218712759] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:43:47,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381612408] [2022-11-03 03:43:47,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:47,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:47,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:43:47,519 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:43:47,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-11-03 03:43:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:47,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 03:43:47,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:47,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 03:43:47,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:43:47,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381612408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:47,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:43:47,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2022-11-03 03:43:47,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817446812] [2022-11-03 03:43:47,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:47,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:43:47,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:47,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:43:47,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:43:47,911 INFO L87 Difference]: Start difference. First operand 2098 states and 10204 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:47,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:47,971 INFO L93 Difference]: Finished difference Result 1760 states and 8400 transitions. [2022-11-03 03:43:47,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:43:47,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 03:43:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:47,979 INFO L225 Difference]: With dead ends: 1760 [2022-11-03 03:43:47,979 INFO L226 Difference]: Without dead ends: 1760 [2022-11-03 03:43:47,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:43:47,980 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3 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.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:47,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:43:47,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2022-11-03 03:43:48,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1405. [2022-11-03 03:43:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1361 states have (on average 4.347538574577516) internal successors, (5917), 1404 states have internal predecessors, (5917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 5917 transitions. [2022-11-03 03:43:48,023 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 5917 transitions. Word has length 12 [2022-11-03 03:43:48,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:48,023 INFO L495 AbstractCegarLoop]: Abstraction has 1405 states and 5917 transitions. [2022-11-03 03:43:48,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:48,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 5917 transitions. [2022-11-03 03:43:48,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 03:43:48,024 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:48,025 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:48,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-11-03 03:43:48,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-11-03 03:43:48,243 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:43:48,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:48,243 INFO L85 PathProgramCache]: Analyzing trace with hash -714805726, now seen corresponding path program 4 times [2022-11-03 03:43:48,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:48,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124889638] [2022-11-03 03:43:48,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:48,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:48,650 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-03 03:43:48,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:48,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124889638] [2022-11-03 03:43:48,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124889638] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:43:48,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014476685] [2022-11-03 03:43:48,651 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:43:48,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:48,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:43:48,652 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:43:48,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-11-03 03:43:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:49,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 03:43:49,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:49,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:49,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:49,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:49,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:49,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:49,312 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-03 03:43:49,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:43:49,433 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2361 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2361) c_~A~0.base) (+ c_~A~0.offset 8)) 4294967296)) is different from false [2022-11-03 03:43:49,443 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2360) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2361) |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-03 03:43:49,453 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:49,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:49,464 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:49,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:49,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 102 [2022-11-03 03:43:49,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:49,698 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-03 03:43:49,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014476685] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:43:49,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1806906742] [2022-11-03 03:43:49,699 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-03 03:43:49,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:43:49,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-03 03:43:49,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823354473] [2022-11-03 03:43:49,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:43:49,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 03:43:49,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:49,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 03:43:49,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=623, Unknown=2, NotChecked=102, Total=812 [2022-11-03 03:43:49,700 INFO L87 Difference]: Start difference. First operand 1405 states and 5917 transitions. Second operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 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-03 03:43:50,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:50,905 INFO L93 Difference]: Finished difference Result 1794 states and 7056 transitions. [2022-11-03 03:43:50,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 03:43:50,906 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 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-03 03:43:50,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:50,911 INFO L225 Difference]: With dead ends: 1794 [2022-11-03 03:43:50,911 INFO L226 Difference]: Without dead ends: 1794 [2022-11-03 03:43:50,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=184, Invalid=1154, Unknown=2, NotChecked=142, Total=1482 [2022-11-03 03:43:50,911 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 143 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:50,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 95 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 795 Invalid, 0 Unknown, 179 Unchecked, 0.6s Time] [2022-11-03 03:43:50,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2022-11-03 03:43:50,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1419. [2022-11-03 03:43:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1375 states have (on average 4.36) internal successors, (5995), 1418 states have internal predecessors, (5995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:50,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 5995 transitions. [2022-11-03 03:43:50,938 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 5995 transitions. Word has length 12 [2022-11-03 03:43:50,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:50,938 INFO L495 AbstractCegarLoop]: Abstraction has 1419 states and 5995 transitions. [2022-11-03 03:43:50,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 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-03 03:43:50,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 5995 transitions. [2022-11-03 03:43:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 03:43:50,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:50,939 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:50,969 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-11-03 03:43:51,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:51,150 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:43:51,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:51,151 INFO L85 PathProgramCache]: Analyzing trace with hash -714805724, now seen corresponding path program 2 times [2022-11-03 03:43:51,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:51,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979733789] [2022-11-03 03:43:51,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:51,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:51,551 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-03 03:43:51,551 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:51,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979733789] [2022-11-03 03:43:51,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979733789] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:43:51,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223302338] [2022-11-03 03:43:51,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:43:51,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:51,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:43:51,552 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:43:51,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-11-03 03:43:51,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 03:43:51,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:43:51,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 03:43:51,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:52,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:52,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:52,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:52,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:52,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:52,345 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:52,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:43:52,716 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:52,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:52,727 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:52,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:52,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 73 treesize of output 61 [2022-11-03 03:43:52,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 134 treesize of output 110 [2022-11-03 03:43:53,062 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-03 03:43:53,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223302338] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:43:53,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [19923101] [2022-11-03 03:43:53,063 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-03 03:43:53,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:43:53,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-03 03:43:53,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606564150] [2022-11-03 03:43:53,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:43:53,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 03:43:53,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:53,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 03:43:53,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=710, Unknown=6, NotChecked=0, Total=812 [2022-11-03 03:43:53,064 INFO L87 Difference]: Start difference. First operand 1419 states and 5995 transitions. Second operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 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-03 03:43:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:53,705 INFO L93 Difference]: Finished difference Result 1798 states and 7118 transitions. [2022-11-03 03:43:53,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 03:43:53,705 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 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-03 03:43:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:53,709 INFO L225 Difference]: With dead ends: 1798 [2022-11-03 03:43:53,710 INFO L226 Difference]: Without dead ends: 1798 [2022-11-03 03:43:53,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=170, Invalid=1230, Unknown=6, NotChecked=0, Total=1406 [2022-11-03 03:43:53,710 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 30 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:53,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 99 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 329 Invalid, 0 Unknown, 110 Unchecked, 0.2s Time] [2022-11-03 03:43:53,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2022-11-03 03:43:53,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1417. [2022-11-03 03:43:53,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1373 states have (on average 4.359796067006555) internal successors, (5986), 1416 states have internal predecessors, (5986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:53,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 5986 transitions. [2022-11-03 03:43:53,736 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 5986 transitions. Word has length 12 [2022-11-03 03:43:53,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:53,736 INFO L495 AbstractCegarLoop]: Abstraction has 1417 states and 5986 transitions. [2022-11-03 03:43:53,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 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-03 03:43:53,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 5986 transitions. [2022-11-03 03:43:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 03:43:53,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:53,737 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:53,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-11-03 03:43:53,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-11-03 03:43:53,943 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:43:53,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:53,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1753288981, now seen corresponding path program 4 times [2022-11-03 03:43:53,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:53,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550198819] [2022-11-03 03:43:53,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:53,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:54,088 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-03 03:43:54,088 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:54,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550198819] [2022-11-03 03:43:54,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550198819] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:43:54,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930822146] [2022-11-03 03:43:54,089 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:43:54,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:54,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:43:54,090 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:43:54,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-11-03 03:43:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:54,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 03:43:54,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:54,530 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:54,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:43:54,643 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:54,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930822146] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:43:54,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [118816205] [2022-11-03 03:43:54,644 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-03 03:43:54,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:43:54,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-11-03 03:43:54,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237954427] [2022-11-03 03:43:54,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:43:54,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-03 03:43:54,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:54,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-03 03:43:54,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2022-11-03 03:43:54,646 INFO L87 Difference]: Start difference. First operand 1417 states and 5986 transitions. Second operand has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:55,333 INFO L93 Difference]: Finished difference Result 3076 states and 11770 transitions. [2022-11-03 03:43:55,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 03:43:55,333 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 03:43:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:55,341 INFO L225 Difference]: With dead ends: 3076 [2022-11-03 03:43:55,341 INFO L226 Difference]: Without dead ends: 3074 [2022-11-03 03:43:55,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=278, Invalid=714, Unknown=0, NotChecked=0, Total=992 [2022-11-03 03:43:55,342 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 442 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:55,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 77 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:43:55,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3074 states. [2022-11-03 03:43:55,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3074 to 1859. [2022-11-03 03:43:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1815 states have (on average 4.40771349862259) internal successors, (8000), 1858 states have internal predecessors, (8000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:55,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 8000 transitions. [2022-11-03 03:43:55,419 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 8000 transitions. Word has length 12 [2022-11-03 03:43:55,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:55,419 INFO L495 AbstractCegarLoop]: Abstraction has 1859 states and 8000 transitions. [2022-11-03 03:43:55,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:55,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 8000 transitions. [2022-11-03 03:43:55,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 03:43:55,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:55,420 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1] [2022-11-03 03:43:55,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-11-03 03:43:55,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-11-03 03:43:55,621 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:43:55,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:55,622 INFO L85 PathProgramCache]: Analyzing trace with hash 429644457, now seen corresponding path program 6 times [2022-11-03 03:43:55,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:55,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122060851] [2022-11-03 03:43:55,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:55,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:56,152 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-03 03:43:56,152 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:56,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122060851] [2022-11-03 03:43:56,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122060851] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:43:56,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325968776] [2022-11-03 03:43:56,152 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:43:56,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:56,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:43:56,157 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:43:56,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-11-03 03:43:56,543 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:43:56,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:43:56,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-03 03:43:56,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:56,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:56,713 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 03:43:56,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 [2022-11-03 03:43:56,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:56,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:56,932 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-03 03:43:56,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:43:57,103 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2518 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2518) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-03 03:43:57,109 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2517 Int) (v_ArrVal_2518 (Array Int Int))) (< 0 (+ (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~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_2517)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2518) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-03 03:43:57,129 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-03 03:43:57,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2022-11-03 03:43:57,137 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:43:57,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:57,269 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-03 03:43:57,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325968776] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:43:57,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1854242657] [2022-11-03 03:43:57,270 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-03 03:43:57,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:43:57,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-03 03:43:57,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798768235] [2022-11-03 03:43:57,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:43:57,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 03:43:57,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:57,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 03:43:57,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=962, Unknown=2, NotChecked=126, Total=1190 [2022-11-03 03:43:57,272 INFO L87 Difference]: Start difference. First operand 1859 states and 8000 transitions. Second operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 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-03 03:43:58,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:58,664 INFO L93 Difference]: Finished difference Result 2323 states and 9253 transitions. [2022-11-03 03:43:58,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 03:43:58,665 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 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-03 03:43:58,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:58,671 INFO L225 Difference]: With dead ends: 2323 [2022-11-03 03:43:58,671 INFO L226 Difference]: Without dead ends: 2323 [2022-11-03 03:43:58,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=213, Invalid=1773, Unknown=2, NotChecked=174, Total=2162 [2022-11-03 03:43:58,672 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 134 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:58,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 99 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1174 Invalid, 0 Unknown, 165 Unchecked, 0.8s Time] [2022-11-03 03:43:58,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2022-11-03 03:43:58,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 1859. [2022-11-03 03:43:58,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1815 states have (on average 4.407162534435262) internal successors, (7999), 1858 states have internal predecessors, (7999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:58,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 7999 transitions. [2022-11-03 03:43:58,709 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 7999 transitions. Word has length 13 [2022-11-03 03:43:58,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:58,709 INFO L495 AbstractCegarLoop]: Abstraction has 1859 states and 7999 transitions. [2022-11-03 03:43:58,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 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-03 03:43:58,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 7999 transitions. [2022-11-03 03:43:58,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 03:43:58,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:58,710 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:58,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-11-03 03:43:58,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-11-03 03:43:58,910 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:43:58,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:58,911 INFO L85 PathProgramCache]: Analyzing trace with hash -944382505, now seen corresponding path program 5 times [2022-11-03 03:43:58,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:58,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217597146] [2022-11-03 03:43:58,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:58,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:59,401 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-03 03:43:59,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:59,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217597146] [2022-11-03 03:43:59,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217597146] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:43:59,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576864211] [2022-11-03 03:43:59,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:43:59,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:59,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:43:59,406 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:43:59,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-11-03 03:43:59,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 03:43:59,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:43:59,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-03 03:43:59,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:59,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:43:59,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:59,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:44:00,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:00,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:44:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:44:00,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:44:00,642 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:44:00,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:44:00,652 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:44:00,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 89 treesize of output 85 [2022-11-03 03:44:00,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 56 [2022-11-03 03:44:00,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 24 [2022-11-03 03:44:01,152 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-03 03:44:01,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576864211] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:44:01,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1092795069] [2022-11-03 03:44:01,152 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) WARNING: YOUR LOGFILE WAS TOO LONG, SOME LINES IN THE MIDDLE WERE REMOVED. 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-03 03:47:30,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:47:30,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2022-11-03 03:47:30,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139804306] [2022-11-03 03:47:30,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:47:30,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 03:47:30,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:47:30,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 03:47:30,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=857, Unknown=7, NotChecked=448, Total=1406 [2022-11-03 03:47:30,466 INFO L87 Difference]: Start difference. First operand 7809 states and 37178 transitions. Second operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:47:33,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:47:33,161 INFO L93 Difference]: Finished difference Result 11471 states and 49537 transitions. [2022-11-03 03:47:33,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 03:47:33,161 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 03:47:33,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:47:33,198 INFO L225 Difference]: With dead ends: 11471 [2022-11-03 03:47:33,198 INFO L226 Difference]: Without dead ends: 11471 [2022-11-03 03:47:33,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=205, Invalid=1622, Unknown=7, NotChecked=616, Total=2450 [2022-11-03 03:47:33,199 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 378 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 1941 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 2696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 704 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:47:33,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 218 Invalid, 2696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1941 Invalid, 0 Unknown, 704 Unchecked, 1.4s Time] [2022-11-03 03:47:33,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11471 states. [2022-11-03 03:47:33,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11471 to 8421. [2022-11-03 03:47:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8421 states, 8386 states have (on average 4.755664202241832) internal successors, (39881), 8420 states have internal predecessors, (39881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:47:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8421 states to 8421 states and 39881 transitions. [2022-11-03 03:47:33,411 INFO L78 Accepts]: Start accepts. Automaton has 8421 states and 39881 transitions. Word has length 15 [2022-11-03 03:47:33,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:47:33,411 INFO L495 AbstractCegarLoop]: Abstraction has 8421 states and 39881 transitions. [2022-11-03 03:47:33,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:47:33,411 INFO L276 IsEmpty]: Start isEmpty. Operand 8421 states and 39881 transitions. [2022-11-03 03:47:33,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 03:47:33,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:47:33,412 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:47:33,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Forceful destruction successful, exit code 0 [2022-11-03 03:47:33,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 93 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2022-11-03 03:47:33,613 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:47:33,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:47:33,613 INFO L85 PathProgramCache]: Analyzing trace with hash -663974038, now seen corresponding path program 7 times [2022-11-03 03:47:33,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:47:33,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672297439] [2022-11-03 03:47:33,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:47:33,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:47:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:47:34,147 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-03 03:47:34,147 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:47:34,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672297439] [2022-11-03 03:47:34,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672297439] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:47:34,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193454332] [2022-11-03 03:47:34,147 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:47:34,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:47:34,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:47:34,148 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:47:34,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2022-11-03 03:47:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:47:34,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 03:47:34,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:47:34,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:47:34,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:34,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:47:34,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:34,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:47:35,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:35,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:47:35,103 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-03 03:47:35,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:47:35,171 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5151 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5151) c_~A~0.base) (+ (* |c_thread2Thread1of1ForFork2_~i~1#1| 4) c_~A~0.offset 4)) 4294967296)) is different from false [2022-11-03 03:47:35,175 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5151 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5151) c_~A~0.base) (+ (* |c_thread2Thread1of1ForFork2_~i~1#1| 4) c_~A~0.offset 8)) 4294967296)) is different from false [2022-11-03 03:47:35,181 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5151 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5151) c_~A~0.base) (+ (* |c_thread2Thread1of1ForFork2_~i~1#1| 4) c_~A~0.offset 12)) 4294967296)) is different from false [2022-11-03 03:47:35,185 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5151 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5151) c_~A~0.base) (+ c_~A~0.offset 12)) 4294967296)) is different from false [2022-11-03 03:47:35,193 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5150 (Array Int Int)) (v_ArrVal_5151 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5150) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5151) c_~A~0.base) (+ c_~A~0.offset 12)) 4294967296)) is different from false [2022-11-03 03:47:35,202 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5149 (Array Int Int)) (v_ArrVal_5150 (Array Int Int)) (v_ArrVal_5151 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5149) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5150) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5151) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 03:47:35,211 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:47:35,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 03:47:35,221 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:47:35,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1105 treesize of output 1059 [2022-11-03 03:47:35,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1046 treesize of output 982 [2022-11-03 03:47:35,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 491 treesize of output 459 [2022-11-03 03:47:35,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 950 treesize of output 822 [2022-11-03 03:47:38,833 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-03 03:47:38,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193454332] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:47:38,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [24857459] [2022-11-03 03:47:38,834 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-03 03:47:38,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:47:38,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2022-11-03 03:47:38,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201023511] [2022-11-03 03:47:38,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:47:38,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 03:47:38,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:47:38,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 03:47:38,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=915, Unknown=6, NotChecked=390, Total=1406 [2022-11-03 03:47:38,836 INFO L87 Difference]: Start difference. First operand 8421 states and 39881 transitions. Second operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:47:41,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:47:41,324 INFO L93 Difference]: Finished difference Result 10889 states and 46995 transitions. [2022-11-03 03:47:41,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 03:47:41,324 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 03:47:41,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:47:41,359 INFO L225 Difference]: With dead ends: 10889 [2022-11-03 03:47:41,359 INFO L226 Difference]: Without dead ends: 10889 [2022-11-03 03:47:41,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=206, Invalid=1704, Unknown=6, NotChecked=534, Total=2450 [2022-11-03 03:47:41,359 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 359 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 2456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 668 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:47:41,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 191 Invalid, 2456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1739 Invalid, 0 Unknown, 668 Unchecked, 1.3s Time] [2022-11-03 03:47:41,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10889 states. [2022-11-03 03:47:41,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10889 to 6489. [2022-11-03 03:47:41,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6489 states, 6454 states have (on average 4.564920979237682) internal successors, (29462), 6488 states have internal predecessors, (29462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:47:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6489 states to 6489 states and 29462 transitions. [2022-11-03 03:47:41,522 INFO L78 Accepts]: Start accepts. Automaton has 6489 states and 29462 transitions. Word has length 15 [2022-11-03 03:47:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:47:41,523 INFO L495 AbstractCegarLoop]: Abstraction has 6489 states and 29462 transitions. [2022-11-03 03:47:41,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:47:41,523 INFO L276 IsEmpty]: Start isEmpty. Operand 6489 states and 29462 transitions. [2022-11-03 03:47:41,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 03:47:41,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:47:41,524 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2022-11-03 03:47:41,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Ended with exit code 0 [2022-11-03 03:47:41,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 94 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2022-11-03 03:47:41,725 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:47:41,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:47:41,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1787279441, now seen corresponding path program 9 times [2022-11-03 03:47:41,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:47:41,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789627215] [2022-11-03 03:47:41,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:47:41,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:47:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:47:42,355 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:47:42,355 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:47:42,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789627215] [2022-11-03 03:47:42,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789627215] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:47:42,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870621856] [2022-11-03 03:47:42,356 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:47:42,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:47:42,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:47:42,357 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:47:42,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2022-11-03 03:47:42,872 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:47:42,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:47:42,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-03 03:47:42,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:47:43,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:47:43,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:43,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:47:43,337 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:47:43,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:47:43,611 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5210 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5210) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-03 03:47:43,619 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:47:43,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:47:43,626 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:47:43,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:47:43,868 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-03 03:47:43,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870621856] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:47:43,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [953141599] [2022-11-03 03:47:43,868 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-03 03:47:43,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:47:43,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2022-11-03 03:47:43,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467515151] [2022-11-03 03:47:43,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:47:43,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-03 03:47:43,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:47:43,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-03 03:47:43,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1681, Unknown=1, NotChecked=82, Total=1892 [2022-11-03 03:47:43,870 INFO L87 Difference]: Start difference. First operand 6489 states and 29462 transitions. Second operand has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:47:46,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:47:46,109 INFO L93 Difference]: Finished difference Result 6811 states and 30340 transitions. [2022-11-03 03:47:46,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 03:47:46,110 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 03:47:46,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:47:46,130 INFO L225 Difference]: With dead ends: 6811 [2022-11-03 03:47:46,130 INFO L226 Difference]: Without dead ends: 6811 [2022-11-03 03:47:46,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=261, Invalid=3164, Unknown=1, NotChecked=114, Total=3540 [2022-11-03 03:47:46,130 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 172 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 2451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:47:46,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 210 Invalid, 2451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2330 Invalid, 0 Unknown, 91 Unchecked, 1.4s Time] [2022-11-03 03:47:46,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6811 states. [2022-11-03 03:47:46,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6811 to 6492. [2022-11-03 03:47:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6492 states, 6457 states have (on average 4.56465851014403) internal successors, (29474), 6491 states have internal predecessors, (29474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:47:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6492 states to 6492 states and 29474 transitions. [2022-11-03 03:47:46,257 INFO L78 Accepts]: Start accepts. Automaton has 6492 states and 29474 transitions. Word has length 16 [2022-11-03 03:47:46,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:47:46,257 INFO L495 AbstractCegarLoop]: Abstraction has 6492 states and 29474 transitions. [2022-11-03 03:47:46,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:47:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 6492 states and 29474 transitions. [2022-11-03 03:47:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 03:47:46,258 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:47:46,258 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2022-11-03 03:47:46,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Ended with exit code 0 [2022-11-03 03:47:46,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable104 [2022-11-03 03:47:46,459 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:47:46,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:47:46,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1787279437, now seen corresponding path program 7 times [2022-11-03 03:47:46,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:47:46,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953018514] [2022-11-03 03:47:46,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:47:46,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:47:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:47:47,035 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:47:47,035 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:47:47,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953018514] [2022-11-03 03:47:47,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953018514] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:47:47,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542331314] [2022-11-03 03:47:47,036 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:47:47,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:47:47,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:47:47,037 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:47:47,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2022-11-03 03:47:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:47:47,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-03 03:47:47,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:47:47,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:47:47,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:47,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:47:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:47:47,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:47:48,235 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5269 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5269) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 03:47:48,242 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:47:48,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:47:48,249 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:47:48,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:47:48,484 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-03 03:47:48,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542331314] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:47:48,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [817405848] [2022-11-03 03:47:48,485 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-03 03:47:48,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:47:48,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2022-11-03 03:47:48,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854003944] [2022-11-03 03:47:48,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:47:48,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-03 03:47:48,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:47:48,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-03 03:47:48,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1681, Unknown=1, NotChecked=82, Total=1892 [2022-11-03 03:47:48,486 INFO L87 Difference]: Start difference. First operand 6492 states and 29474 transitions. Second operand has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:47:50,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:47:50,581 INFO L93 Difference]: Finished difference Result 6847 states and 30438 transitions. [2022-11-03 03:47:50,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 03:47:50,581 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 03:47:50,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:47:50,602 INFO L225 Difference]: With dead ends: 6847 [2022-11-03 03:47:50,602 INFO L226 Difference]: Without dead ends: 6847 [2022-11-03 03:47:50,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=261, Invalid=3164, Unknown=1, NotChecked=114, Total=3540 [2022-11-03 03:47:50,603 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 180 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 2212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:47:50,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 184 Invalid, 2212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2085 Invalid, 0 Unknown, 103 Unchecked, 1.2s Time] [2022-11-03 03:47:50,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6847 states. [2022-11-03 03:47:50,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6847 to 6492. [2022-11-03 03:47:50,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6492 states, 6457 states have (on average 4.56419389809509) internal successors, (29471), 6491 states have internal predecessors, (29471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:47:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6492 states to 6492 states and 29471 transitions. [2022-11-03 03:47:50,782 INFO L78 Accepts]: Start accepts. Automaton has 6492 states and 29471 transitions. Word has length 16 [2022-11-03 03:47:50,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:47:50,782 INFO L495 AbstractCegarLoop]: Abstraction has 6492 states and 29471 transitions. [2022-11-03 03:47:50,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:47:50,782 INFO L276 IsEmpty]: Start isEmpty. Operand 6492 states and 29471 transitions. [2022-11-03 03:47:50,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 03:47:50,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:47:50,784 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:47:50,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2022-11-03 03:47:50,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable105 [2022-11-03 03:47:50,985 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:47:50,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:47:50,986 INFO L85 PathProgramCache]: Analyzing trace with hash -39612159, now seen corresponding path program 3 times [2022-11-03 03:47:50,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:47:50,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232578260] [2022-11-03 03:47:50,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:47:50,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:47:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:47:52,575 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-03 03:47:52,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:47:52,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232578260] [2022-11-03 03:47:52,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232578260] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:47:52,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355386997] [2022-11-03 03:47:52,576 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:47:52,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:47:52,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:47:52,577 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:47:52,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2022-11-03 03:47:53,133 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:47:53,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:47:53,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-03 03:47:53,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:47:53,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:47:53,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:47:53,310 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:47:53,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2022-11-03 03:47:53,432 INFO L356 Elim1Store]: treesize reduction 46, result has 48.9 percent of original size [2022-11-03 03:47:53,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 70 [2022-11-03 03:47:53,699 INFO L356 Elim1Store]: treesize reduction 66, result has 58.5 percent of original size [2022-11-03 03:47:53,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 124 [2022-11-03 03:47:54,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:54,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 58 [2022-11-03 03:47:54,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:54,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 58 [2022-11-03 03:47:54,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:54,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 58 [2022-11-03 03:47:54,861 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-03 03:47:54,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:47:56,196 INFO L356 Elim1Store]: treesize reduction 180, result has 42.1 percent of original size [2022-11-03 03:47:56,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 153 [2022-11-03 03:47:56,281 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:47:56,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 291 treesize of output 397 [2022-11-03 03:47:56,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 152 treesize of output 128 [2022-11-03 03:47:56,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 60 [2022-11-03 03:47:56,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:47:58,642 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:47:58,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355386997] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:47:58,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1456768055] [2022-11-03 03:47:58,643 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-03 03:47:58,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:47:58,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2022-11-03 03:47:58,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266091752] [2022-11-03 03:47:58,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:47:58,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-03 03:47:58,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:47:58,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-03 03:47:58,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=843, Unknown=60, NotChecked=0, Total=1056 [2022-11-03 03:47:58,644 INFO L87 Difference]: Start difference. First operand 6492 states and 29471 transitions. Second operand has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:48:02,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:48:02,307 INFO L93 Difference]: Finished difference Result 9292 states and 43106 transitions. [2022-11-03 03:48:02,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-03 03:48:02,308 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 03:48:02,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:48:02,338 INFO L225 Difference]: With dead ends: 9292 [2022-11-03 03:48:02,338 INFO L226 Difference]: Without dead ends: 9236 [2022-11-03 03:48:02,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=406, Invalid=2216, Unknown=134, NotChecked=0, Total=2756 [2022-11-03 03:48:02,338 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 174 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 870 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:48:02,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 111 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 309 Invalid, 0 Unknown, 870 Unchecked, 0.4s Time] [2022-11-03 03:48:02,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9236 states. [2022-11-03 03:48:02,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9236 to 7250. [2022-11-03 03:48:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7250 states, 7215 states have (on average 4.6911988911988916) internal successors, (33847), 7249 states have internal predecessors, (33847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:48:02,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7250 states to 7250 states and 33847 transitions. [2022-11-03 03:48:02,518 INFO L78 Accepts]: Start accepts. Automaton has 7250 states and 33847 transitions. Word has length 16 [2022-11-03 03:48:02,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:48:02,518 INFO L495 AbstractCegarLoop]: Abstraction has 7250 states and 33847 transitions. [2022-11-03 03:48:02,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:48:02,519 INFO L276 IsEmpty]: Start isEmpty. Operand 7250 states and 33847 transitions. [2022-11-03 03:48:02,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 03:48:02,520 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:48:02,520 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:48:02,553 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Ended with exit code 0 [2022-11-03 03:48:02,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 97 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable106 [2022-11-03 03:48:02,721 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:48:02,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:48:02,721 INFO L85 PathProgramCache]: Analyzing trace with hash 551754850, now seen corresponding path program 6 times [2022-11-03 03:48:02,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:48:02,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063801790] [2022-11-03 03:48:02,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:02,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:48:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:03,238 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:48:03,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:48:03,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063801790] [2022-11-03 03:48:03,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063801790] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:48:03,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986191395] [2022-11-03 03:48:03,239 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:48:03,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:48:03,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:48:03,240 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:48:03,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2022-11-03 03:48:03,771 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:48:03,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:48:03,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 03:48:03,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:48:03,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 16 [2022-11-03 03:48:03,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-03 03:48:03,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 03:48:03,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:48:04,157 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:48:04,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:48:04,333 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5406 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5406) c_~A~0.base) (+ c_~A~0.offset 16)) 4294967296)) is different from false [2022-11-03 03:48:04,341 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5406 (Array Int Int)) (v_ArrVal_5405 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5405) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5406) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 03:48:04,349 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:48:04,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:48:04,357 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:48:04,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:48:04,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:48:04,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:48:04,449 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 03:48:04,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986191395] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:48:04,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [213231322] [2022-11-03 03:48:04,450 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-03 03:48:04,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:48:04,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2022-11-03 03:48:04,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011003019] [2022-11-03 03:48:04,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:48:04,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 03:48:04,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:48:04,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 03:48:04,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1020, Unknown=2, NotChecked=130, Total=1260 [2022-11-03 03:48:04,451 INFO L87 Difference]: Start difference. First operand 7250 states and 33847 transitions. Second operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:48:05,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:48:05,890 INFO L93 Difference]: Finished difference Result 8293 states and 36984 transitions. [2022-11-03 03:48:05,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 03:48:05,890 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 03:48:05,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:48:05,915 INFO L225 Difference]: With dead ends: 8293 [2022-11-03 03:48:05,916 INFO L226 Difference]: Without dead ends: 8293 [2022-11-03 03:48:05,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=213, Invalid=1599, Unknown=2, NotChecked=166, Total=1980 [2022-11-03 03:48:05,916 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 227 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 1477 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 263 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:48:05,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 192 Invalid, 1773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1477 Invalid, 0 Unknown, 263 Unchecked, 1.0s Time] [2022-11-03 03:48:05,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8293 states. [2022-11-03 03:48:06,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8293 to 7314. [2022-11-03 03:48:06,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7314 states, 7279 states have (on average 4.6925401840912215) internal successors, (34157), 7313 states have internal predecessors, (34157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:48:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7314 states to 7314 states and 34157 transitions. [2022-11-03 03:48:06,069 INFO L78 Accepts]: Start accepts. Automaton has 7314 states and 34157 transitions. Word has length 16 [2022-11-03 03:48:06,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:48:06,069 INFO L495 AbstractCegarLoop]: Abstraction has 7314 states and 34157 transitions. [2022-11-03 03:48:06,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:48:06,069 INFO L276 IsEmpty]: Start isEmpty. Operand 7314 states and 34157 transitions. [2022-11-03 03:48:06,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 03:48:06,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:48:06,071 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:48:06,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Forceful destruction successful, exit code 0 [2022-11-03 03:48:06,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 98 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2022-11-03 03:48:06,271 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:48:06,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:48:06,271 INFO L85 PathProgramCache]: Analyzing trace with hash 551754852, now seen corresponding path program 5 times [2022-11-03 03:48:06,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:48:06,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510994177] [2022-11-03 03:48:06,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:06,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:48:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:48:06,781 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:48:06,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510994177] [2022-11-03 03:48:06,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510994177] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:48:06,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18015977] [2022-11-03 03:48:06,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:48:06,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:48:06,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:48:06,782 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:48:06,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-11-03 03:48:07,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 03:48:07,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:48:07,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-03 03:48:07,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:48:07,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:48:07,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:07,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:48:07,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:07,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:48:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:48:08,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:48:08,596 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:48:08,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:48:08,606 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:48:08,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 89 treesize of output 85 [2022-11-03 03:48:08,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 56 [2022-11-03 03:48:08,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 24 [2022-11-03 03:48:09,252 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:48:09,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18015977] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:48:09,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1687007972] [2022-11-03 03:48:09,253 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java: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-03 03:48:09,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:48:09,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2022-11-03 03:48:09,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510196044] [2022-11-03 03:48:09,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:48:09,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-03 03:48:09,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:48:09,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-03 03:48:09,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1464, Unknown=4, NotChecked=0, Total=1640 [2022-11-03 03:48:09,255 INFO L87 Difference]: Start difference. First operand 7314 states and 34157 transitions. Second operand has 41 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:48:10,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:48:10,393 INFO L93 Difference]: Finished difference Result 8227 states and 37259 transitions. [2022-11-03 03:48:10,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 03:48:10,394 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 03:48:10,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:48:10,420 INFO L225 Difference]: With dead ends: 8227 [2022-11-03 03:48:10,420 INFO L226 Difference]: Without dead ends: 8227 [2022-11-03 03:48:10,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=302, Invalid=2556, Unknown=4, NotChecked=0, Total=2862 [2022-11-03 03:48:10,420 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:48:10,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 301 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 509 Invalid, 0 Unknown, 210 Unchecked, 0.4s Time] [2022-11-03 03:48:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8227 states. [2022-11-03 03:48:10,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8227 to 7312. [2022-11-03 03:48:10,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7312 states, 7277 states have (on average 4.692730520819019) internal successors, (34149), 7311 states have internal predecessors, (34149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:48:10,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7312 states to 7312 states and 34149 transitions. [2022-11-03 03:48:10,577 INFO L78 Accepts]: Start accepts. Automaton has 7312 states and 34149 transitions. Word has length 16 [2022-11-03 03:48:10,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:48:10,577 INFO L495 AbstractCegarLoop]: Abstraction has 7312 states and 34149 transitions. [2022-11-03 03:48:10,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:48:10,577 INFO L276 IsEmpty]: Start isEmpty. Operand 7312 states and 34149 transitions. [2022-11-03 03:48:10,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 03:48:10,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:48:10,579 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:48:10,609 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Ended with exit code 0 [2022-11-03 03:48:10,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,99 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:48:10,779 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:48:10,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:48:10,779 INFO L85 PathProgramCache]: Analyzing trace with hash 573977699, now seen corresponding path program 4 times [2022-11-03 03:48:10,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:48:10,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959424664] [2022-11-03 03:48:10,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:10,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:48:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:12,278 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-03 03:48:12,278 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:48:12,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959424664] [2022-11-03 03:48:12,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959424664] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:48:12,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124130816] [2022-11-03 03:48:12,279 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:48:12,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:48:12,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:48:12,280 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:48:12,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2022-11-03 03:48:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:12,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-03 03:48:12,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:48:12,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:48:12,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:48:13,030 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:48:13,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2022-11-03 03:48:13,128 INFO L356 Elim1Store]: treesize reduction 64, result has 28.9 percent of original size [2022-11-03 03:48:13,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 53 [2022-11-03 03:48:13,221 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:48:13,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 56 treesize of output 64 [2022-11-03 03:48:13,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:13,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 54 [2022-11-03 03:48:13,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:13,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 54 [2022-11-03 03:48:13,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:13,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 54 [2022-11-03 03:48:13,807 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-03 03:48:13,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:48:14,939 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:48:14,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 87 [2022-11-03 03:48:14,974 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:48:14,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 399 treesize of output 407 [2022-11-03 03:48:14,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 314 treesize of output 266 [2022-11-03 03:48:15,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 266 treesize of output 242 [2022-11-03 03:48:15,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 126 treesize of output 114 [2022-11-03 03:48:15,363 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-03 03:48:15,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124130816] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:48:15,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1884793015] [2022-11-03 03:48:15,364 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java: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-03 03:48:15,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:48:15,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2022-11-03 03:48:15,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208925529] [2022-11-03 03:48:15,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:48:15,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-03 03:48:15,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:48:15,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-03 03:48:15,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=891, Unknown=13, NotChecked=0, Total=1056 [2022-11-03 03:48:15,367 INFO L87 Difference]: Start difference. First operand 7312 states and 34149 transitions. Second operand has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:48:20,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:48:20,688 INFO L93 Difference]: Finished difference Result 8900 states and 40516 transitions. [2022-11-03 03:48:20,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-03 03:48:20,689 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 03:48:20,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:48:20,717 INFO L225 Difference]: With dead ends: 8900 [2022-11-03 03:48:20,717 INFO L226 Difference]: Without dead ends: 8864 [2022-11-03 03:48:20,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=485, Invalid=2352, Unknown=25, NotChecked=0, Total=2862 [2022-11-03 03:48:20,718 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 304 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 619 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:48:20,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 196 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1268 Invalid, 0 Unknown, 619 Unchecked, 1.5s Time] [2022-11-03 03:48:20,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8864 states. [2022-11-03 03:48:20,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8864 to 7600. [2022-11-03 03:48:20,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7600 states, 7565 states have (on average 4.664771976206213) internal successors, (35289), 7599 states have internal predecessors, (35289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:48:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7600 states to 7600 states and 35289 transitions. [2022-11-03 03:48:20,880 INFO L78 Accepts]: Start accepts. Automaton has 7600 states and 35289 transitions. Word has length 16 [2022-11-03 03:48:20,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:48:20,880 INFO L495 AbstractCegarLoop]: Abstraction has 7600 states and 35289 transitions. [2022-11-03 03:48:20,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:48:20,880 INFO L276 IsEmpty]: Start isEmpty. Operand 7600 states and 35289 transitions. [2022-11-03 03:48:20,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 03:48:20,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:48:20,882 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:48:20,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Ended with exit code 0 [2022-11-03 03:48:21,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,100 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:48:21,083 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:48:21,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:48:21,083 INFO L85 PathProgramCache]: Analyzing trace with hash 892123444, now seen corresponding path program 8 times [2022-11-03 03:48:21,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:48:21,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910971910] [2022-11-03 03:48:21,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:21,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:48:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:21,272 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:48:21,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:48:21,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910971910] [2022-11-03 03:48:21,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910971910] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:48:21,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363235159] [2022-11-03 03:48:21,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:48:21,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:48:21,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:48:21,274 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:48:21,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2022-11-03 03:48:21,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 03:48:21,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:48:21,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-03 03:48:21,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:48:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:48:22,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:48:22,304 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:48:22,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363235159] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:48:22,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [753055899] [2022-11-03 03:48:22,304 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java: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-03 03:48:22,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:48:22,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-11-03 03:48:22,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518838931] [2022-11-03 03:48:22,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:48:22,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-03 03:48:22,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:48:22,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-03 03:48:22,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2022-11-03 03:48:22,307 INFO L87 Difference]: Start difference. First operand 7600 states and 35289 transitions. Second operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:48:23,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:48:23,023 INFO L93 Difference]: Finished difference Result 7646 states and 35278 transitions. [2022-11-03 03:48:23,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 03:48:23,024 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 03:48:23,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:48:23,045 INFO L225 Difference]: With dead ends: 7646 [2022-11-03 03:48:23,045 INFO L226 Difference]: Without dead ends: 7249 [2022-11-03 03:48:23,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=292, Invalid=968, Unknown=0, NotChecked=0, Total=1260 [2022-11-03 03:48:23,046 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 260 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:48:23,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 72 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:48:23,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7249 states. [2022-11-03 03:48:23,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7249 to 7249. [2022-11-03 03:48:23,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7249 states, 7214 states have (on average 4.7047407818131415) internal successors, (33940), 7248 states have internal predecessors, (33940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:48:23,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7249 states to 7249 states and 33940 transitions. [2022-11-03 03:48:23,192 INFO L78 Accepts]: Start accepts. Automaton has 7249 states and 33940 transitions. Word has length 16 [2022-11-03 03:48:23,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:48:23,192 INFO L495 AbstractCegarLoop]: Abstraction has 7249 states and 33940 transitions. [2022-11-03 03:48:23,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:48:23,193 INFO L276 IsEmpty]: Start isEmpty. Operand 7249 states and 33940 transitions. [2022-11-03 03:48:23,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:48:23,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:48:23,194 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:48:23,231 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Ended with exit code 0 [2022-11-03 03:48:23,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,101 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:48:23,395 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:48:23,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:48:23,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1973711405, now seen corresponding path program 2 times [2022-11-03 03:48:23,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:48:23,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285384958] [2022-11-03 03:48:23,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:23,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:48:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:48:26,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:48:26,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285384958] [2022-11-03 03:48:26,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285384958] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:48:26,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673629521] [2022-11-03 03:48:26,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:48:26,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:48:26,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:48:26,451 INFO L229 MonitoredProcess]: Starting monitored process 102 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:48:26,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2022-11-03 03:48:27,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-03 03:48:27,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:48:27,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-03 03:48:27,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:48:27,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:48:27,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 30 [2022-11-03 03:48:27,387 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:48:27,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2022-11-03 03:48:27,500 INFO L356 Elim1Store]: treesize reduction 48, result has 48.9 percent of original size [2022-11-03 03:48:27,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 72 [2022-11-03 03:48:27,841 INFO L356 Elim1Store]: treesize reduction 70, result has 58.1 percent of original size [2022-11-03 03:48:27,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 129 [2022-11-03 03:48:29,206 INFO L356 Elim1Store]: treesize reduction 114, result has 46.0 percent of original size [2022-11-03 03:48:29,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 136 treesize of output 187 [2022-11-03 03:48:31,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:31,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 81 treesize of output 73 [2022-11-03 03:48:31,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:31,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 81 treesize of output 73 [2022-11-03 03:48:31,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:31,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 81 treesize of output 73 [2022-11-03 03:48:32,313 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:48:32,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:48:32,562 WARN L833 $PredicateComparison]: unable to prove that (or (not (< (+ c_~M~0 1) c_~N~0)) (forall ((v_ArrVal_5678 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5678) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0) 4)) 9223372039002259456)))) is different from false [2022-11-03 03:48:32,576 WARN L833 $PredicateComparison]: unable to prove that (or (not (< (+ c_~M~0 1) c_~N~0)) (forall ((v_ArrVal_5677 (Array Int Int)) (v_ArrVal_5678 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5677) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5678) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0) 4)) 9223372039002259456)))) is different from false [2022-11-03 03:48:34,083 INFO L356 Elim1Store]: treesize reduction 334, result has 35.3 percent of original size [2022-11-03 03:48:34,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 case distinctions, treesize of input 73 treesize of output 205 [2022-11-03 03:48:34,231 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:48:34,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 529 treesize of output 686 [2022-11-03 03:48:34,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 164 treesize of output 150 [2022-11-03 03:48:34,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 314 treesize of output 258 [2022-11-03 03:48:34,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 258 treesize of output 230 [2022-11-03 03:48:42,139 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 26 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:48:42,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673629521] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:48:42,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [663688858] [2022-11-03 03:48:42,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-03 03:48:42,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:48:42,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2022-11-03 03:48:42,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988650460] [2022-11-03 03:48:42,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:48:42,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-03 03:48:42,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:48:42,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-03 03:48:42,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1226, Unknown=61, NotChecked=150, Total=1640 [2022-11-03 03:48:42,142 INFO L87 Difference]: Start difference. First operand 7249 states and 33940 transitions. Second operand has 41 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:48:43,841 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1))) (and (or (forall ((~M~0 Int) (v_ArrVal_5677 (Array Int Int)) (v_ArrVal_5676 (Array Int Int)) (v_ArrVal_5678 (Array Int Int)) (v_ArrVal_5674 Int)) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse0 .cse1 v_ArrVal_5674)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5676) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5677) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5678) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< ~M~0 0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ v_ArrVal_5674 2147483648) 0))) (< .cse2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_620| Int) (~M~0 Int) (v_ArrVal_5677 (Array Int Int)) (v_ArrVal_5676 (Array Int Int)) (v_ArrVal_5678 (Array Int Int)) (v_ArrVal_5674 Int) (v_ArrVal_5673 Int) (v_ArrVal_5671 Int)) (or (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_620| .cse2)) (< (+ 2 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_620|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~M~0 0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ v_ArrVal_5674 2147483648) 0) (< (+ v_ArrVal_5671 2147483648) 0) (< (+ v_ArrVal_5673 2147483648) 0) (< 0 (+ 9223372039002259456 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (let ((.cse3 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_620| 4))) (store (store (store .cse0 .cse1 v_ArrVal_5671) (+ .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_5673) (+ .cse3 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_5674))) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5676) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5677) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5678) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (or (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~M~0 Int) (v_ArrVal_5677 (Array Int Int)) (v_ArrVal_5676 (Array Int Int)) (v_ArrVal_5678 (Array Int Int)) (v_ArrVal_5674 Int) (v_ArrVal_5673 Int)) (or (< ~M~0 0) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse0 .cse1 v_ArrVal_5673) (+ .cse4 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_5674)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5676) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5677) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5678) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ v_ArrVal_5674 2147483648) 0) (< (+ v_ArrVal_5673 2147483648) 0)))) (or (forall ((~M~0 Int) (v_ArrVal_5677 (Array Int Int)) (v_ArrVal_5676 (Array Int Int)) (v_ArrVal_5678 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5676) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5677) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5678) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< ~M~0 0) (not (< (+ ~M~0 1) c_~N~0)))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_621| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_620| Int) (v_ArrVal_5669 Int) (~M~0 Int) (v_ArrVal_5677 (Array Int Int)) (v_ArrVal_5676 (Array Int Int)) (v_ArrVal_5678 (Array Int Int)) (v_ArrVal_5674 Int) (v_ArrVal_5673 Int) (v_ArrVal_5671 Int)) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (let ((.cse5 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_620| 4))) (store (store (store (store .cse0 .cse1 v_ArrVal_5669) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_621| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_5671) (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_5673) (+ .cse5 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_5674))) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5676) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5677) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5678) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< (+ 2 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_620|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< (+ v_ArrVal_5669 2147483648) 0) (< ~M~0 0) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_621| .cse2)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ v_ArrVal_5674 2147483648) 0) (< (+ v_ArrVal_5671 2147483648) 0) (< (+ v_ArrVal_5673 2147483648) 0) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_620| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_621| 1)))))))) is different from false [2022-11-03 03:48:44,596 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (let ((.cse2 (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or (forall ((~M~0 Int) (v_ArrVal_5677 (Array Int Int)) (v_ArrVal_5676 (Array Int Int)) (v_ArrVal_5678 (Array Int Int)) (v_ArrVal_5674 Int)) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse0 .cse1 v_ArrVal_5674)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5676) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5677) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5678) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< ~M~0 0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ v_ArrVal_5674 2147483648) 0))) (< .cse2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_620| Int) (~M~0 Int) (v_ArrVal_5677 (Array Int Int)) (v_ArrVal_5676 (Array Int Int)) (v_ArrVal_5678 (Array Int Int)) (v_ArrVal_5674 Int) (v_ArrVal_5673 Int) (v_ArrVal_5671 Int)) (or (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_620| .cse2)) (< (+ 2 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_620|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~M~0 0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ v_ArrVal_5674 2147483648) 0) (< (+ v_ArrVal_5671 2147483648) 0) (< (+ v_ArrVal_5673 2147483648) 0) (< 0 (+ 9223372039002259456 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (let ((.cse3 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_620| 4))) (store (store (store .cse0 .cse1 v_ArrVal_5671) (+ .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_5673) (+ .cse3 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_5674))) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5676) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5677) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5678) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (or (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~M~0 Int) (v_ArrVal_5677 (Array Int Int)) (v_ArrVal_5676 (Array Int Int)) (v_ArrVal_5678 (Array Int Int)) (v_ArrVal_5674 Int) (v_ArrVal_5673 Int)) (or (< ~M~0 0) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse0 .cse1 v_ArrVal_5673) (+ .cse4 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_5674)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5676) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5677) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5678) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ v_ArrVal_5674 2147483648) 0) (< (+ v_ArrVal_5673 2147483648) 0)))) (or (forall ((~M~0 Int) (v_ArrVal_5677 (Array Int Int)) (v_ArrVal_5676 (Array Int Int)) (v_ArrVal_5678 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5676) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5677) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5678) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< ~M~0 0) (not (< (+ ~M~0 1) c_~N~0)))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|))))) is different from false [2022-11-03 03:48:46,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:48:46,182 INFO L93 Difference]: Finished difference Result 7504 states and 34827 transitions. [2022-11-03 03:48:46,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-03 03:48:46,182 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:48:46,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:48:46,206 INFO L225 Difference]: With dead ends: 7504 [2022-11-03 03:48:46,206 INFO L226 Difference]: Without dead ends: 7504 [2022-11-03 03:48:46,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=445, Invalid=2680, Unknown=83, NotChecked=452, Total=3660 [2022-11-03 03:48:46,207 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 49 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 356 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:48:46,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 124 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 253 Invalid, 0 Unknown, 356 Unchecked, 0.3s Time] [2022-11-03 03:48:46,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7504 states. [2022-11-03 03:48:46,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7504 to 7243. [2022-11-03 03:48:46,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7243 states, 7208 states have (on average 4.706714761376249) internal successors, (33926), 7242 states have internal predecessors, (33926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:48:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7243 states to 7243 states and 33926 transitions. [2022-11-03 03:48:46,356 INFO L78 Accepts]: Start accepts. Automaton has 7243 states and 33926 transitions. Word has length 17 [2022-11-03 03:48:46,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:48:46,356 INFO L495 AbstractCegarLoop]: Abstraction has 7243 states and 33926 transitions. [2022-11-03 03:48:46,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:48:46,356 INFO L276 IsEmpty]: Start isEmpty. Operand 7243 states and 33926 transitions. [2022-11-03 03:48:46,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:48:46,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:48:46,358 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:48:46,364 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Ended with exit code 0 [2022-11-03 03:48:46,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2022-11-03 03:48:46,558 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:48:46,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:48:46,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1001017237, now seen corresponding path program 1 times [2022-11-03 03:48:46,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:48:46,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725594267] [2022-11-03 03:48:46,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:46,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:48:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:49,531 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-03 03:48:49,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:48:49,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725594267] [2022-11-03 03:48:49,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725594267] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:48:49,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40204716] [2022-11-03 03:48:49,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:49,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:48:49,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:48:49,532 INFO L229 MonitoredProcess]: Starting monitored process 103 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:48:49,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2022-11-03 03:48:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:50,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-03 03:48:50,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:48:50,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:48:50,291 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-03 03:48:50,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 23 [2022-11-03 03:48:50,380 INFO L356 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2022-11-03 03:48:50,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2022-11-03 03:48:50,450 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:48:50,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 39 treesize of output 44 [2022-11-03 03:48:50,595 INFO L356 Elim1Store]: treesize reduction 62, result has 48.8 percent of original size [2022-11-03 03:48:50,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 83 [2022-11-03 03:48:50,807 INFO L356 Elim1Store]: treesize reduction 102, result has 36.6 percent of original size [2022-11-03 03:48:50,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 62 treesize of output 97 [2022-11-03 03:48:51,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:51,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 56 [2022-11-03 03:48:51,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:51,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 56 [2022-11-03 03:48:51,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:51,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 56 [2022-11-03 03:48:51,658 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-03 03:48:51,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:48:53,245 INFO L356 Elim1Store]: treesize reduction 216, result has 42.1 percent of original size [2022-11-03 03:48:53,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 case distinctions, treesize of input 71 treesize of output 177 [2022-11-03 03:48:53,356 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:48:53,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1376 treesize of output 1448 [2022-11-03 03:48:53,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1158 treesize of output 1062 [2022-11-03 03:48:53,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1062 treesize of output 1014 [2022-11-03 03:48:53,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1014 treesize of output 822 [2022-11-03 03:48:56,578 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:48:56,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40204716] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:48:56,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [56804527] [2022-11-03 03:48:56,579 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-03 03:48:56,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:48:56,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 35 [2022-11-03 03:48:56,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272092489] [2022-11-03 03:48:56,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:48:56,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 03:48:56,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:48:56,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 03:48:56,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1081, Unknown=64, NotChecked=0, Total=1332 [2022-11-03 03:48:56,580 INFO L87 Difference]: Start difference. First operand 7243 states and 33926 transitions. Second operand has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:48:57,537 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (let ((.cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (.cse6 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse2 (+ .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ .cse7 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or (forall ((v_ArrVal_5756 (Array Int Int)) (v_ArrVal_5755 (Array Int Int)) (v_ArrVal_5757 (Array Int Int)) (|v_thread3Thread1of1ForFork0_~i~2#1_125| Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5755) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5756) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5757) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_125| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |v_thread3Thread1of1ForFork0_~i~2#1_125| c_~N~0)) (< |v_thread3Thread1of1ForFork0_~i~2#1_125| 0))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< .cse0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((v_ArrVal_5756 (Array Int Int)) (v_ArrVal_5753 Int) (v_ArrVal_5755 (Array Int Int)) (v_ArrVal_5757 (Array Int Int)) (|v_thread3Thread1of1ForFork0_~i~2#1_125| Int)) (or (< 2147483647 v_ArrVal_5753) (not (< |v_thread3Thread1of1ForFork0_~i~2#1_125| c_~N~0)) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse1 .cse2 v_ArrVal_5753)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5755) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5756) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5757) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_125| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (< |v_thread3Thread1of1ForFork0_~i~2#1_125| 0)))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_633| Int) (v_ArrVal_5756 (Array Int Int)) (v_ArrVal_5753 Int) (v_ArrVal_5755 (Array Int Int)) (v_ArrVal_5751 Int) (v_ArrVal_5757 (Array Int Int)) (v_ArrVal_5750 Int) (|v_thread3Thread1of1ForFork0_~i~2#1_125| Int)) (or (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_633| .cse0)) (< 2147483647 v_ArrVal_5751) (< 2147483647 v_ArrVal_5753) (< (+ 2 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_633|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< 2147483647 v_ArrVal_5750) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (let ((.cse3 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_633| 4))) (store (store (store .cse1 .cse2 v_ArrVal_5750) (+ .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_5751) (+ .cse3 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_5753))) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5755) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5756) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5757) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_125| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |v_thread3Thread1of1ForFork0_~i~2#1_125| c_~N~0)) (< |v_thread3Thread1of1ForFork0_~i~2#1_125| 0))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_633| Int) (v_ArrVal_5747 Int) (v_ArrVal_5756 (Array Int Int)) (v_ArrVal_5753 Int) (v_ArrVal_5755 (Array Int Int)) (v_ArrVal_5751 Int) (v_ArrVal_5757 (Array Int Int)) (v_ArrVal_5750 Int) (|v_thread3Thread1of1ForFork0_~i~2#1_125| Int)) (or (< 2147483647 v_ArrVal_5751) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (let ((.cse5 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_633| 4))) (store (store (store (store .cse1 .cse2 v_ArrVal_5747) .cse4 v_ArrVal_5750) (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_5751) (+ .cse5 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_5753))) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5755) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5756) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5757) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_125| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (< 2147483647 v_ArrVal_5753) (< (+ 2 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_633|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< 2147483647 v_ArrVal_5750) (not (< |v_thread3Thread1of1ForFork0_~i~2#1_125| c_~N~0)) (< 2147483647 v_ArrVal_5747) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_633| .cse6)) (< |v_thread3Thread1of1ForFork0_~i~2#1_125| 0))) (or (< .cse6 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((v_ArrVal_5756 (Array Int Int)) (v_ArrVal_5753 Int) (v_ArrVal_5755 (Array Int Int)) (v_ArrVal_5751 Int) (v_ArrVal_5757 (Array Int Int)) (|v_thread3Thread1of1ForFork0_~i~2#1_125| Int)) (or (< 2147483647 v_ArrVal_5751) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse1 .cse2 v_ArrVal_5751) .cse4 v_ArrVal_5753)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5755) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5756) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5757) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_125| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (< 2147483647 v_ArrVal_5753) (not (< |v_thread3Thread1of1ForFork0_~i~2#1_125| c_~N~0)) (< |v_thread3Thread1of1ForFork0_~i~2#1_125| 0))))))) is different from false [2022-11-03 03:48:57,546 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (let ((.cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse2 (+ .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or (forall ((v_ArrVal_5756 (Array Int Int)) (v_ArrVal_5755 (Array Int Int)) (v_ArrVal_5757 (Array Int Int)) (|v_thread3Thread1of1ForFork0_~i~2#1_125| Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5755) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5756) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5757) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_125| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |v_thread3Thread1of1ForFork0_~i~2#1_125| c_~N~0)) (< |v_thread3Thread1of1ForFork0_~i~2#1_125| 0))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< .cse0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((v_ArrVal_5756 (Array Int Int)) (v_ArrVal_5753 Int) (v_ArrVal_5755 (Array Int Int)) (v_ArrVal_5757 (Array Int Int)) (|v_thread3Thread1of1ForFork0_~i~2#1_125| Int)) (or (< 2147483647 v_ArrVal_5753) (not (< |v_thread3Thread1of1ForFork0_~i~2#1_125| c_~N~0)) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse1 .cse2 v_ArrVal_5753)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5755) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5756) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5757) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_125| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (< |v_thread3Thread1of1ForFork0_~i~2#1_125| 0)))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_633| Int) (v_ArrVal_5756 (Array Int Int)) (v_ArrVal_5753 Int) (v_ArrVal_5755 (Array Int Int)) (v_ArrVal_5751 Int) (v_ArrVal_5757 (Array Int Int)) (v_ArrVal_5750 Int) (|v_thread3Thread1of1ForFork0_~i~2#1_125| Int)) (or (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_633| .cse0)) (< 2147483647 v_ArrVal_5751) (< 2147483647 v_ArrVal_5753) (< (+ 2 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_633|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< 2147483647 v_ArrVal_5750) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (let ((.cse3 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_633| 4))) (store (store (store .cse1 .cse2 v_ArrVal_5750) (+ .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_5751) (+ .cse3 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_5753))) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5755) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5756) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5757) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_125| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |v_thread3Thread1of1ForFork0_~i~2#1_125| c_~N~0)) (< |v_thread3Thread1of1ForFork0_~i~2#1_125| 0))) (or (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((v_ArrVal_5756 (Array Int Int)) (v_ArrVal_5753 Int) (v_ArrVal_5755 (Array Int Int)) (v_ArrVal_5751 Int) (v_ArrVal_5757 (Array Int Int)) (|v_thread3Thread1of1ForFork0_~i~2#1_125| Int)) (or (< 2147483647 v_ArrVal_5751) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse1 .cse2 v_ArrVal_5751) (+ .cse4 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_5753)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5755) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5756) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5757) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_125| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (< 2147483647 v_ArrVal_5753) (not (< |v_thread3Thread1of1ForFork0_~i~2#1_125| c_~N~0)) (< |v_thread3Thread1of1ForFork0_~i~2#1_125| 0))))))) is different from false [2022-11-03 03:48:59,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:48:59,071 INFO L93 Difference]: Finished difference Result 7653 states and 35670 transitions. [2022-11-03 03:48:59,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-03 03:48:59,072 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:48:59,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:48:59,096 INFO L225 Difference]: With dead ends: 7653 [2022-11-03 03:48:59,096 INFO L226 Difference]: Without dead ends: 7653 [2022-11-03 03:48:59,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=388, Invalid=2300, Unknown=76, NotChecked=206, Total=2970 [2022-11-03 03:48:59,096 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 34 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:48:59,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 112 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 232 Invalid, 0 Unknown, 346 Unchecked, 0.3s Time] [2022-11-03 03:48:59,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7653 states. [2022-11-03 03:48:59,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7653 to 7303. [2022-11-03 03:48:59,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7303 states, 7268 states have (on average 4.7142267473858) internal successors, (34263), 7302 states have internal predecessors, (34263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:48:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 34263 transitions. [2022-11-03 03:48:59,248 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 34263 transitions. Word has length 17 [2022-11-03 03:48:59,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:48:59,249 INFO L495 AbstractCegarLoop]: Abstraction has 7303 states and 34263 transitions. [2022-11-03 03:48:59,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:48:59,249 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 34263 transitions. [2022-11-03 03:48:59,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:48:59,250 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:48:59,250 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:48:59,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Ended with exit code 0 [2022-11-03 03:48:59,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112,103 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:48:59,451 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:48:59,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:48:59,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1001017640, now seen corresponding path program 1 times [2022-11-03 03:48:59,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:48:59,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392835176] [2022-11-03 03:48:59,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:59,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:48:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:01,551 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-03 03:49:01,551 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:01,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392835176] [2022-11-03 03:49:01,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392835176] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:49:01,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799321950] [2022-11-03 03:49:01,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:01,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:01,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:49:01,553 INFO L229 MonitoredProcess]: Starting monitored process 104 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:49:01,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2022-11-03 03:49:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:02,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-03 03:49:02,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:49:02,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:02,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 28 [2022-11-03 03:49:02,326 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:49:02,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 43 [2022-11-03 03:49:02,418 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:49:02,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 53 treesize of output 58 [2022-11-03 03:49:02,528 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:49:02,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 48 treesize of output 56 [2022-11-03 03:49:02,633 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:49:02,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 57 treesize of output 68 [2022-11-03 03:49:02,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:49:02,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 51 [2022-11-03 03:49:02,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:49:02,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 51 [2022-11-03 03:49:03,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:49:03,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 51 [2022-11-03 03:49:03,260 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-03 03:49:03,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:49:04,633 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:49:04,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 case distinctions, treesize of input 72 treesize of output 98 [2022-11-03 03:49:04,679 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:49:04,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1293 treesize of output 1258 [2022-11-03 03:49:04,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1158 treesize of output 1110 [2022-11-03 03:49:04,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1110 treesize of output 1014 [2022-11-03 03:49:04,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1014 treesize of output 822 [2022-11-03 03:49:04,882 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-03 03:49:05,681 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-03 03:49:05,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799321950] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:49:05,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [475774853] [2022-11-03 03:49:05,682 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-03 03:49:05,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:49:05,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-03 03:49:05,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68057351] [2022-11-03 03:49:05,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:49:05,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 03:49:05,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:05,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 03:49:05,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=997, Unknown=18, NotChecked=0, Total=1190 [2022-11-03 03:49:05,683 INFO L87 Difference]: Start difference. First operand 7303 states and 34263 transitions. Second operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:09,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:09,047 INFO L93 Difference]: Finished difference Result 11767 states and 54230 transitions. [2022-11-03 03:49:09,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 03:49:09,047 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:49:09,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:09,086 INFO L225 Difference]: With dead ends: 11767 [2022-11-03 03:49:09,086 INFO L226 Difference]: Without dead ends: 11767 [2022-11-03 03:49:09,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=394, Invalid=2018, Unknown=38, NotChecked=0, Total=2450 [2022-11-03 03:49:09,086 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 223 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 633 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:09,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 139 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 601 Invalid, 0 Unknown, 633 Unchecked, 0.8s Time] [2022-11-03 03:49:09,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11767 states. [2022-11-03 03:49:09,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11767 to 8069. [2022-11-03 03:49:09,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8069 states, 8034 states have (on average 4.723425441872044) internal successors, (37948), 8068 states have internal predecessors, (37948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:09,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8069 states to 8069 states and 37948 transitions. [2022-11-03 03:49:09,282 INFO L78 Accepts]: Start accepts. Automaton has 8069 states and 37948 transitions. Word has length 17 [2022-11-03 03:49:09,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:09,282 INFO L495 AbstractCegarLoop]: Abstraction has 8069 states and 37948 transitions. [2022-11-03 03:49:09,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:09,282 INFO L276 IsEmpty]: Start isEmpty. Operand 8069 states and 37948 transitions. [2022-11-03 03:49:09,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:49:09,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:09,284 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:09,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Forceful destruction successful, exit code 0 [2022-11-03 03:49:09,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 104 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2022-11-03 03:49:09,485 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:49:09,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:09,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1065257961, now seen corresponding path program 8 times [2022-11-03 03:49:09,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:09,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184143365] [2022-11-03 03:49:09,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:09,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:10,134 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:10,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184143365] [2022-11-03 03:49:10,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184143365] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:49:10,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724098162] [2022-11-03 03:49:10,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:49:10,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:10,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:49:10,136 INFO L229 MonitoredProcess]: Starting monitored process 105 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:49:10,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2022-11-03 03:49:10,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 03:49:10,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:49:10,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-03 03:49:10,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:49:11,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:11,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:49:11,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:11,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:49:11,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:11,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:49:12,375 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:49:12,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:12,386 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:49:12,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:12,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 134 [2022-11-03 03:49:12,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 134 treesize of output 110 [2022-11-03 03:49:13,138 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:13,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724098162] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:49:13,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1695198677] [2022-11-03 03:49:13,139 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-03 03:49:13,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:49:13,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2022-11-03 03:49:13,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579641263] [2022-11-03 03:49:13,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:49:13,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-03 03:49:13,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:13,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-03 03:49:13,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1939, Unknown=4, NotChecked=0, Total=2162 [2022-11-03 03:49:13,140 INFO L87 Difference]: Start difference. First operand 8069 states and 37948 transitions. Second operand has 47 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:14,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:14,464 INFO L93 Difference]: Finished difference Result 8079 states and 37980 transitions. [2022-11-03 03:49:14,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-03 03:49:14,465 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:49:14,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:14,489 INFO L225 Difference]: With dead ends: 8079 [2022-11-03 03:49:14,490 INFO L226 Difference]: Without dead ends: 8079 [2022-11-03 03:49:14,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=406, Invalid=3622, Unknown=4, NotChecked=0, Total=4032 [2022-11-03 03:49:14,490 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:14,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 96 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 369 Invalid, 0 Unknown, 147 Unchecked, 0.3s Time] [2022-11-03 03:49:14,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8079 states. [2022-11-03 03:49:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8079 to 8073. [2022-11-03 03:49:14,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8073 states, 8038 states have (on average 4.722816621050012) internal successors, (37962), 8072 states have internal predecessors, (37962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:14,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8073 states to 8073 states and 37962 transitions. [2022-11-03 03:49:14,651 INFO L78 Accepts]: Start accepts. Automaton has 8073 states and 37962 transitions. Word has length 17 [2022-11-03 03:49:14,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:14,651 INFO L495 AbstractCegarLoop]: Abstraction has 8073 states and 37962 transitions. [2022-11-03 03:49:14,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:14,651 INFO L276 IsEmpty]: Start isEmpty. Operand 8073 states and 37962 transitions. [2022-11-03 03:49:14,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:49:14,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:14,653 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:14,682 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Ended with exit code 0 [2022-11-03 03:49:14,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 105 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2022-11-03 03:49:14,854 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:49:14,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:14,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1065257965, now seen corresponding path program 7 times [2022-11-03 03:49:14,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:14,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016306736] [2022-11-03 03:49:14,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:14,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:15,433 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:15,433 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:15,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016306736] [2022-11-03 03:49:15,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016306736] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:49:15,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254770992] [2022-11-03 03:49:15,433 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:49:15,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:15,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:49:15,434 INFO L229 MonitoredProcess]: Starting monitored process 106 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:49:15,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2022-11-03 03:49:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:16,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 03:49:16,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:49:16,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:16,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:49:16,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:16,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:49:16,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:16,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:49:16,874 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5964 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5964) c_~A~0.base) (+ c_~A~0.offset 20)) 4294967296)) is different from false [2022-11-03 03:49:16,882 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5964 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5963) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5964) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 03:49:16,891 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:49:16,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:16,898 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:49:16,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 71 treesize of output 67 [2022-11-03 03:49:16,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:16,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-11-03 03:49:17,223 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-03 03:49:17,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254770992] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:49:17,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [325151723] [2022-11-03 03:49:17,224 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-03 03:49:17,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:49:17,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2022-11-03 03:49:17,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226989940] [2022-11-03 03:49:17,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:49:17,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-03 03:49:17,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:17,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-03 03:49:17,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1847, Unknown=2, NotChecked=174, Total=2162 [2022-11-03 03:49:17,225 INFO L87 Difference]: Start difference. First operand 8073 states and 37962 transitions. Second operand has 47 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:20,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:20,091 INFO L93 Difference]: Finished difference Result 9143 states and 41190 transitions. [2022-11-03 03:49:20,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 03:49:20,092 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:49:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:20,121 INFO L225 Difference]: With dead ends: 9143 [2022-11-03 03:49:20,121 INFO L226 Difference]: Without dead ends: 9143 [2022-11-03 03:49:20,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=288, Invalid=3378, Unknown=2, NotChecked=238, Total=3906 [2022-11-03 03:49:20,121 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 288 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 2448 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 2699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:20,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 263 Invalid, 2699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2448 Invalid, 0 Unknown, 187 Unchecked, 1.6s Time] [2022-11-03 03:49:20,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9143 states. [2022-11-03 03:49:20,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9143 to 8139. [2022-11-03 03:49:20,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8139 states, 8104 states have (on average 4.729269496544916) internal successors, (38326), 8138 states have internal predecessors, (38326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:20,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8139 states to 8139 states and 38326 transitions. [2022-11-03 03:49:20,381 INFO L78 Accepts]: Start accepts. Automaton has 8139 states and 38326 transitions. Word has length 17 [2022-11-03 03:49:20,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:20,381 INFO L495 AbstractCegarLoop]: Abstraction has 8139 states and 38326 transitions. [2022-11-03 03:49:20,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:20,381 INFO L276 IsEmpty]: Start isEmpty. Operand 8139 states and 38326 transitions. [2022-11-03 03:49:20,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:49:20,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:20,383 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:20,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Ended with exit code 0 [2022-11-03 03:49:20,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115,106 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:20,584 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:49:20,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:20,585 INFO L85 PathProgramCache]: Analyzing trace with hash 990527762, now seen corresponding path program 1 times [2022-11-03 03:49:20,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:20,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388962619] [2022-11-03 03:49:20,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:20,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:22,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:22,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388962619] [2022-11-03 03:49:22,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388962619] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:49:22,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184408087] [2022-11-03 03:49:22,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:22,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:22,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:49:22,581 INFO L229 MonitoredProcess]: Starting monitored process 107 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:49:22,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2022-11-03 03:49:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:23,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-03 03:49:23,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:49:23,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:23,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 30 [2022-11-03 03:49:23,461 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:49:23,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2022-11-03 03:49:23,543 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:49:23,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 47 treesize of output 52 [2022-11-03 03:49:23,702 INFO L356 Elim1Store]: treesize reduction 64, result has 48.8 percent of original size [2022-11-03 03:49:23,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 92 [2022-11-03 03:49:23,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:49:23,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 58 [2022-11-03 03:49:24,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:49:24,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 58 [2022-11-03 03:49:24,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:49:24,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 58 [2022-11-03 03:49:24,611 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:24,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:49:26,092 INFO L356 Elim1Store]: treesize reduction 89, result has 54.4 percent of original size [2022-11-03 03:49:26,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 129 [2022-11-03 03:49:26,174 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:49:26,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 452 treesize of output 513 [2022-11-03 03:49:26,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 328 treesize of output 300 [2022-11-03 03:49:26,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 300 treesize of output 244 [2022-11-03 03:49:26,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 128 treesize of output 114 [2022-11-03 03:49:27,307 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:27,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184408087] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:49:27,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [328558948] [2022-11-03 03:49:27,308 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-03 03:49:27,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:49:27,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2022-11-03 03:49:27,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389288980] [2022-11-03 03:49:27,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:49:27,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 03:49:27,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:27,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 03:49:27,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1167, Unknown=62, NotChecked=0, Total=1406 [2022-11-03 03:49:27,310 INFO L87 Difference]: Start difference. First operand 8139 states and 38326 transitions. Second operand has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:28,365 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (let ((.cse3 (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_131| Int) (v_ArrVal_6039 (Array Int Int)) (v_ArrVal_6037 Int) (v_ArrVal_6041 (Array Int Int)) (v_ArrVal_6035 Int) (v_ArrVal_6040 (Array Int Int)) (v_ArrVal_6034 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_679| Int)) (or (< (+ v_ArrVal_6034 2147483648) 0) (< (+ v_ArrVal_6035 2147483648) 0) (< 0 (+ 9223372039002259456 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store .cse0 .cse1 v_ArrVal_6034) (+ .cse2 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_6035) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_679| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_6037)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_6039) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6041) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_131| 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (+ v_ArrVal_6037 2147483648) 0) (< |v_thread3Thread1of1ForFork0_~i~2#1_131| 0) (not (< (+ |v_thread3Thread1of1ForFork0_~i~2#1_131| 1) c_~N~0)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_679| (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_679| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_131| Int) (v_ArrVal_6039 (Array Int Int)) (v_ArrVal_6037 Int) (v_ArrVal_6041 (Array Int Int)) (v_ArrVal_6040 (Array Int Int))) (or (< (+ v_ArrVal_6037 2147483648) 0) (< |v_thread3Thread1of1ForFork0_~i~2#1_131| 0) (not (< (+ |v_thread3Thread1of1ForFork0_~i~2#1_131| 1) c_~N~0)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse0 .cse1 v_ArrVal_6037)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_6039) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6041) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_131| 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) (< .cse3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_131| Int) (v_ArrVal_6039 (Array Int Int)) (v_ArrVal_6041 (Array Int Int)) (v_ArrVal_6040 (Array Int Int))) (or (< |v_thread3Thread1of1ForFork0_~i~2#1_131| 0) (not (< (+ |v_thread3Thread1of1ForFork0_~i~2#1_131| 1) c_~N~0)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_6039) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6041) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_131| 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))))) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_131| Int) (v_ArrVal_6039 (Array Int Int)) (v_ArrVal_6037 Int) (v_ArrVal_6041 (Array Int Int)) (v_ArrVal_6035 Int) (v_ArrVal_6040 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_679| Int)) (or (< (+ v_ArrVal_6035 2147483648) 0) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_679| .cse3)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse0 .cse1 v_ArrVal_6035) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_679| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_6037)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_6039) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6041) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_131| 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< (+ v_ArrVal_6037 2147483648) 0) (< |v_thread3Thread1of1ForFork0_~i~2#1_131| 0) (not (< (+ |v_thread3Thread1of1ForFork0_~i~2#1_131| 1) c_~N~0)) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_679| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)))))) is different from false [2022-11-03 03:49:28,509 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_131| Int) (v_ArrVal_6039 (Array Int Int)) (v_ArrVal_6037 Int) (v_ArrVal_6041 (Array Int Int)) (v_ArrVal_6040 (Array Int Int))) (or (< (+ v_ArrVal_6037 2147483648) 0) (< |v_thread3Thread1of1ForFork0_~i~2#1_131| 0) (not (< (+ |v_thread3Thread1of1ForFork0_~i~2#1_131| 1) c_~N~0)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse0 .cse1 v_ArrVal_6037)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_6039) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6041) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_131| 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) (< .cse2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_131| Int) (v_ArrVal_6039 (Array Int Int)) (v_ArrVal_6041 (Array Int Int)) (v_ArrVal_6040 (Array Int Int))) (or (< |v_thread3Thread1of1ForFork0_~i~2#1_131| 0) (not (< (+ |v_thread3Thread1of1ForFork0_~i~2#1_131| 1) c_~N~0)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_6039) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6041) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_131| 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))))) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_131| Int) (v_ArrVal_6039 (Array Int Int)) (v_ArrVal_6037 Int) (v_ArrVal_6041 (Array Int Int)) (v_ArrVal_6035 Int) (v_ArrVal_6040 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_679| Int)) (or (< (+ v_ArrVal_6035 2147483648) 0) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_679| .cse2)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse0 .cse1 v_ArrVal_6035) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_679| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_6037)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_6039) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6041) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_131| 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< (+ v_ArrVal_6037 2147483648) 0) (< |v_thread3Thread1of1ForFork0_~i~2#1_131| 0) (not (< (+ |v_thread3Thread1of1ForFork0_~i~2#1_131| 1) c_~N~0)) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_679| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))))) is different from false [2022-11-03 03:49:29,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:29,640 INFO L93 Difference]: Finished difference Result 8412 states and 39280 transitions. [2022-11-03 03:49:29,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-03 03:49:29,640 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:49:29,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:29,667 INFO L225 Difference]: With dead ends: 8412 [2022-11-03 03:49:29,667 INFO L226 Difference]: Without dead ends: 8412 [2022-11-03 03:49:29,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=337, Invalid=2245, Unknown=78, NotChecked=202, Total=2862 [2022-11-03 03:49:29,668 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 247 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:29,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 135 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 336 Invalid, 0 Unknown, 247 Unchecked, 0.4s Time] [2022-11-03 03:49:29,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8412 states. [2022-11-03 03:49:29,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8412 to 8158. [2022-11-03 03:49:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8158 states, 8123 states have (on average 4.7247322417825925) internal successors, (38379), 8157 states have internal predecessors, (38379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8158 states to 8158 states and 38379 transitions. [2022-11-03 03:49:29,838 INFO L78 Accepts]: Start accepts. Automaton has 8158 states and 38379 transitions. Word has length 17 [2022-11-03 03:49:29,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:29,839 INFO L495 AbstractCegarLoop]: Abstraction has 8158 states and 38379 transitions. [2022-11-03 03:49:29,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand 8158 states and 38379 transitions. [2022-11-03 03:49:29,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:49:29,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:29,841 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:29,868 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Ended with exit code 0 [2022-11-03 03:49:30,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 107 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable116 [2022-11-03 03:49:30,041 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:49:30,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:30,042 INFO L85 PathProgramCache]: Analyzing trace with hash 985933562, now seen corresponding path program 2 times [2022-11-03 03:49:30,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:30,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732273869] [2022-11-03 03:49:30,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:30,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:31,802 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:31,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:31,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732273869] [2022-11-03 03:49:31,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732273869] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:49:31,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562992662] [2022-11-03 03:49:31,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:49:31,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:31,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:49:31,803 INFO L229 MonitoredProcess]: Starting monitored process 108 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:49:31,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2022-11-03 03:49:32,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 03:49:32,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:49:32,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-03 03:49:32,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:49:32,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:32,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 24 [2022-11-03 03:49:32,899 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:49:32,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2022-11-03 03:49:32,975 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:49:32,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 47 treesize of output 52 [2022-11-03 03:49:33,121 INFO L356 Elim1Store]: treesize reduction 64, result has 48.8 percent of original size [2022-11-03 03:49:33,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 92 [2022-11-03 03:49:33,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:49:33,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 58 [2022-11-03 03:49:33,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:49:33,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 58 [2022-11-03 03:49:33,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:49:33,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 58 [2022-11-03 03:49:34,005 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:34,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:49:35,402 INFO L356 Elim1Store]: treesize reduction 89, result has 54.4 percent of original size [2022-11-03 03:49:35,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 128 [2022-11-03 03:49:35,479 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:49:35,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1456 treesize of output 1469 [2022-11-03 03:49:35,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1286 treesize of output 1238 [2022-11-03 03:49:35,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1238 treesize of output 1142 [2022-11-03 03:49:35,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1142 treesize of output 950 [2022-11-03 03:49:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:37,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562992662] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:49:37,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [766399256] [2022-11-03 03:49:37,540 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-03 03:49:37,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:49:37,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2022-11-03 03:49:37,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389684476] [2022-11-03 03:49:37,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:49:37,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 03:49:37,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:37,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 03:49:37,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1198, Unknown=31, NotChecked=0, Total=1406 [2022-11-03 03:49:37,542 INFO L87 Difference]: Start difference. First operand 8158 states and 38379 transitions. Second operand has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:38,433 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (let ((.cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse2 (+ .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_134| Int) (v_ArrVal_6117 (Array Int Int)) (v_ArrVal_6116 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_691| Int) (v_ArrVal_6118 (Array Int Int)) (v_ArrVal_6114 Int) (v_ArrVal_6112 Int)) (or (< (+ v_ArrVal_6114 2147483648) 0) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_691| .cse0)) (< |v_thread3Thread1of1ForFork0_~i~2#1_134| 1) (not (< |v_thread3Thread1of1ForFork0_~i~2#1_134| c_~N~0)) (< (+ v_ArrVal_6112 2147483648) 0) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse1 .cse2 v_ArrVal_6112) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_691| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_6114)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_6116) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6117) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6118) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_134| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_691| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_134| Int) (v_ArrVal_6117 (Array Int Int)) (v_ArrVal_6116 (Array Int Int)) (v_ArrVal_6118 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_6116) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6117) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6118) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_134| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< |v_thread3Thread1of1ForFork0_~i~2#1_134| 1) (not (< |v_thread3Thread1of1ForFork0_~i~2#1_134| c_~N~0))))) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_134| Int) (v_ArrVal_6117 (Array Int Int)) (v_ArrVal_6116 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_691| Int) (v_ArrVal_6118 (Array Int Int)) (v_ArrVal_6114 Int) (v_ArrVal_6112 Int) (v_ArrVal_6110 Int)) (or (< (+ v_ArrVal_6114 2147483648) 0) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store .cse1 .cse2 v_ArrVal_6110) (+ .cse3 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_6112) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_691| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_6114)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_6116) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6117) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6118) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_134| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_691| (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (< |v_thread3Thread1of1ForFork0_~i~2#1_134| 1) (not (< |v_thread3Thread1of1ForFork0_~i~2#1_134| c_~N~0)) (< (+ v_ArrVal_6112 2147483648) 0) (< (+ v_ArrVal_6110 2147483648) 0) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_691| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (< .cse0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_134| Int) (v_ArrVal_6117 (Array Int Int)) (v_ArrVal_6116 (Array Int Int)) (v_ArrVal_6118 (Array Int Int)) (v_ArrVal_6114 Int)) (or (< (+ v_ArrVal_6114 2147483648) 0) (< |v_thread3Thread1of1ForFork0_~i~2#1_134| 1) (not (< |v_thread3Thread1of1ForFork0_~i~2#1_134| c_~N~0)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse1 .cse2 v_ArrVal_6114)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_6116) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6117) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6118) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_134| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))))))) is different from false [2022-11-03 03:49:40,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:40,845 INFO L93 Difference]: Finished difference Result 13721 states and 64951 transitions. [2022-11-03 03:49:40,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-03 03:49:40,845 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:49:40,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:40,894 INFO L225 Difference]: With dead ends: 13721 [2022-11-03 03:49:40,894 INFO L226 Difference]: Without dead ends: 13709 [2022-11-03 03:49:40,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=426, Invalid=2719, Unknown=51, NotChecked=110, Total=3306 [2022-11-03 03:49:40,894 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 336 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1018 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:40,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 127 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 403 Invalid, 0 Unknown, 1018 Unchecked, 0.6s Time] [2022-11-03 03:49:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13709 states. [2022-11-03 03:49:41,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13709 to 11134. [2022-11-03 03:49:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11134 states, 11099 states have (on average 4.973871519956753) internal successors, (55205), 11133 states have internal predecessors, (55205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:41,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11134 states to 11134 states and 55205 transitions. [2022-11-03 03:49:41,177 INFO L78 Accepts]: Start accepts. Automaton has 11134 states and 55205 transitions. Word has length 17 [2022-11-03 03:49:41,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:41,177 INFO L495 AbstractCegarLoop]: Abstraction has 11134 states and 55205 transitions. [2022-11-03 03:49:41,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:41,177 INFO L276 IsEmpty]: Start isEmpty. Operand 11134 states and 55205 transitions. [2022-11-03 03:49:41,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:49:41,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:41,180 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:41,186 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Ended with exit code 0 [2022-11-03 03:49:41,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 108 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable117 [2022-11-03 03:49:41,380 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:49:41,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:41,380 INFO L85 PathProgramCache]: Analyzing trace with hash -415831940, now seen corresponding path program 6 times [2022-11-03 03:49:41,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:41,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155745234] [2022-11-03 03:49:41,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:41,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:41,911 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:41,911 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:41,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155745234] [2022-11-03 03:49:41,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155745234] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:49:41,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029981821] [2022-11-03 03:49:41,912 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:49:41,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:41,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:49:41,913 INFO L229 MonitoredProcess]: Starting monitored process 109 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:49:41,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2022-11-03 03:49:42,499 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:49:42,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:49:42,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-03 03:49:42,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:49:42,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:42,726 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 03:49:42,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 [2022-11-03 03:49:42,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:49:42,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:42,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:49:42,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:43,047 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:43,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:49:43,274 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6184 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6184) c_~A~0.base) (+ c_~A~0.offset 16)) 9223372039002259456))) is different from false [2022-11-03 03:49:43,282 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6184 (Array Int Int)) (v_ArrVal_6183 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_6183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6184) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-03 03:49:43,289 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6181 Int) (v_ArrVal_6184 (Array Int Int)) (v_ArrVal_6183 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (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~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_6181)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_6183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6184) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2022-11-03 03:49:43,312 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-03 03:49:43,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 42 [2022-11-03 03:49:43,321 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:49:43,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:43,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:43,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-11-03 03:49:43,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029981821] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:49:43,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1344385649] [2022-11-03 03:49:43,586 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-03 03:49:43,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:49:43,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2022-11-03 03:49:43,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931248339] [2022-11-03 03:49:43,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:49:43,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-03 03:49:43,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:43,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-03 03:49:43,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1520, Unknown=3, NotChecked=240, Total=1892 [2022-11-03 03:49:43,588 INFO L87 Difference]: Start difference. First operand 11134 states and 55205 transitions. Second operand has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:46,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:46,004 INFO L93 Difference]: Finished difference Result 11977 states and 57658 transitions. [2022-11-03 03:49:46,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 03:49:46,005 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:49:46,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:46,047 INFO L225 Difference]: With dead ends: 11977 [2022-11-03 03:49:46,047 INFO L226 Difference]: Without dead ends: 11977 [2022-11-03 03:49:46,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=284, Invalid=2695, Unknown=3, NotChecked=324, Total=3306 [2022-11-03 03:49:46,048 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 201 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 1691 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 236 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:46,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 199 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1691 Invalid, 0 Unknown, 236 Unchecked, 1.2s Time] [2022-11-03 03:49:46,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11977 states. [2022-11-03 03:49:46,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11977 to 11134. [2022-11-03 03:49:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11134 states, 11099 states have (on average 4.96684385980719) internal successors, (55127), 11133 states have internal predecessors, (55127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:46,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11134 states to 11134 states and 55127 transitions. [2022-11-03 03:49:46,407 INFO L78 Accepts]: Start accepts. Automaton has 11134 states and 55127 transitions. Word has length 17 [2022-11-03 03:49:46,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:46,407 INFO L495 AbstractCegarLoop]: Abstraction has 11134 states and 55127 transitions. [2022-11-03 03:49:46,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:46,408 INFO L276 IsEmpty]: Start isEmpty. Operand 11134 states and 55127 transitions. [2022-11-03 03:49:46,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:49:46,410 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:46,410 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:46,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Ended with exit code 0 [2022-11-03 03:49:46,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118,109 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:46,611 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:49:46,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:46,611 INFO L85 PathProgramCache]: Analyzing trace with hash 601145837, now seen corresponding path program 9 times [2022-11-03 03:49:46,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:46,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546562871] [2022-11-03 03:49:46,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:46,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:47,227 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:47,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:47,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546562871] [2022-11-03 03:49:47,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546562871] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:49:47,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646327813] [2022-11-03 03:49:47,228 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:49:47,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:47,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:49:47,229 INFO L229 MonitoredProcess]: Starting monitored process 110 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:49:47,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2022-11-03 03:49:47,823 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:49:47,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:49:47,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 03:49:47,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:49:48,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:48,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:49:48,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:48,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:49:48,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:48,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:49:48,701 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6248 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6248) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 20))))) is different from false [2022-11-03 03:49:48,706 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6248 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6248) c_~A~0.base) (+ c_~A~0.offset 20)) 9223372039002259456))) is different from false [2022-11-03 03:49:48,715 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6247 (Array Int Int)) (v_ArrVal_6248 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_6247) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6248) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-03 03:49:48,723 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:49:48,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:48,731 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:49:48,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:48,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:48,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-03 03:49:49,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646327813] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:49:49,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1336583190] [2022-11-03 03:49:49,076 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-03 03:49:49,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:49:49,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2022-11-03 03:49:49,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002114472] [2022-11-03 03:49:49,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:49:49,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-03 03:49:49,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:49,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-03 03:49:49,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1778, Unknown=3, NotChecked=258, Total=2162 [2022-11-03 03:49:49,077 INFO L87 Difference]: Start difference. First operand 11134 states and 55127 transitions. Second operand has 47 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:52,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:52,378 INFO L93 Difference]: Finished difference Result 12438 states and 59135 transitions. [2022-11-03 03:49:52,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 03:49:52,379 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:49:52,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:52,423 INFO L225 Difference]: With dead ends: 12438 [2022-11-03 03:49:52,424 INFO L226 Difference]: Without dead ends: 12438 [2022-11-03 03:49:52,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=250, Invalid=3299, Unknown=3, NotChecked=354, Total=3906 [2022-11-03 03:49:52,424 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 286 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 2760 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 3187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 373 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:52,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 291 Invalid, 3187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2760 Invalid, 0 Unknown, 373 Unchecked, 1.9s Time] [2022-11-03 03:49:52,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12438 states. [2022-11-03 03:49:52,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12438 to 11134. [2022-11-03 03:49:52,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11134 states, 11099 states have (on average 4.959636003243536) internal successors, (55047), 11133 states have internal predecessors, (55047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11134 states to 11134 states and 55047 transitions. [2022-11-03 03:49:52,801 INFO L78 Accepts]: Start accepts. Automaton has 11134 states and 55047 transitions. Word has length 17 [2022-11-03 03:49:52,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:52,801 INFO L495 AbstractCegarLoop]: Abstraction has 11134 states and 55047 transitions. [2022-11-03 03:49:52,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:52,801 INFO L276 IsEmpty]: Start isEmpty. Operand 11134 states and 55047 transitions. [2022-11-03 03:49:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:49:52,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:52,804 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1] [2022-11-03 03:49:52,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Ended with exit code 0 [2022-11-03 03:49:53,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,110 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:53,005 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:49:53,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:53,005 INFO L85 PathProgramCache]: Analyzing trace with hash -428908957, now seen corresponding path program 8 times [2022-11-03 03:49:53,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:53,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528180669] [2022-11-03 03:49:53,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:53,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:53,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:53,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528180669] [2022-11-03 03:49:53,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528180669] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:49:53,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785541501] [2022-11-03 03:49:53,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:49:53,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:53,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:49:53,259 INFO L229 MonitoredProcess]: Starting monitored process 111 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:49:53,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2022-11-03 03:49:53,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 03:49:53,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:49:53,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-03 03:49:53,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:49:54,263 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:54,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:49:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:54,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785541501] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:49:54,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1171006668] [2022-11-03 03:49:54,501 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-03 03:49:54,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:49:54,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 37 [2022-11-03 03:49:54,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272909611] [2022-11-03 03:49:54,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:49:54,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-03 03:49:54,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:54,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-03 03:49:54,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=1111, Unknown=0, NotChecked=0, Total=1482 [2022-11-03 03:49:54,503 INFO L87 Difference]: Start difference. First operand 11134 states and 55047 transitions. Second operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:56,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:56,447 INFO L93 Difference]: Finished difference Result 15638 states and 71172 transitions. [2022-11-03 03:49:56,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-03 03:49:56,447 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:49:56,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:56,503 INFO L225 Difference]: With dead ends: 15638 [2022-11-03 03:49:56,503 INFO L226 Difference]: Without dead ends: 15632 [2022-11-03 03:49:56,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1344 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1066, Invalid=2966, Unknown=0, NotChecked=0, Total=4032 [2022-11-03 03:49:56,504 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 610 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 1978 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:56,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 254 Invalid, 2013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1978 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-03 03:49:56,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15632 states. [2022-11-03 03:49:56,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15632 to 11528. [2022-11-03 03:49:56,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11528 states, 11493 states have (on average 4.976768467762986) internal successors, (57198), 11527 states have internal predecessors, (57198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:56,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11528 states to 11528 states and 57198 transitions. [2022-11-03 03:49:56,797 INFO L78 Accepts]: Start accepts. Automaton has 11528 states and 57198 transitions. Word has length 17 [2022-11-03 03:49:56,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:56,797 INFO L495 AbstractCegarLoop]: Abstraction has 11528 states and 57198 transitions. [2022-11-03 03:49:56,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:56,797 INFO L276 IsEmpty]: Start isEmpty. Operand 11528 states and 57198 transitions. [2022-11-03 03:49:56,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:49:56,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:56,800 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:56,806 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Ended with exit code 0 [2022-11-03 03:49:57,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,111 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:57,000 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:49:57,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:57,001 INFO L85 PathProgramCache]: Analyzing trace with hash -890811815, now seen corresponding path program 5 times [2022-11-03 03:49:57,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:57,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365401263] [2022-11-03 03:49:57,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:57,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:57,701 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:57,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:57,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365401263] [2022-11-03 03:49:57,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365401263] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:49:57,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675085821] [2022-11-03 03:49:57,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:49:57,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:57,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:49:57,703 INFO L229 MonitoredProcess]: Starting monitored process 112 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:49:57,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2022-11-03 03:49:58,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 03:49:58,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:49:58,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-03 03:49:58,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:49:58,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:58,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:49:58,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:58,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:49:58,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:59,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:49:59,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:59,328 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:59,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:49:59,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:49:59,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 35 [2022-11-03 03:49:59,973 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:49:59,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 343 treesize of output 331 [2022-11-03 03:49:59,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 314 treesize of output 266 [2022-11-03 03:49:59,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 133 treesize of output 121 [2022-11-03 03:49:59,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 254 treesize of output 230 [2022-11-03 03:50:00,706 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:00,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675085821] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:50:00,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [302410218] [2022-11-03 03:50:00,706 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-03 03:50:00,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:50:00,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2022-11-03 03:50:00,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294820250] [2022-11-03 03:50:00,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:50:00,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-03 03:50:00,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:00,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-03 03:50:00,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1699, Unknown=15, NotChecked=0, Total=1892 [2022-11-03 03:50:00,708 INFO L87 Difference]: Start difference. First operand 11528 states and 57198 transitions. Second operand has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:02,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:02,011 INFO L93 Difference]: Finished difference Result 12352 states and 61282 transitions. [2022-11-03 03:50:02,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-03 03:50:02,012 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:50:02,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:02,058 INFO L225 Difference]: With dead ends: 12352 [2022-11-03 03:50:02,058 INFO L226 Difference]: Without dead ends: 12352 [2022-11-03 03:50:02,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=340, Invalid=3184, Unknown=16, NotChecked=0, Total=3540 [2022-11-03 03:50:02,058 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 127 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 533 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:02,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 254 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 289 Invalid, 0 Unknown, 533 Unchecked, 0.2s Time] [2022-11-03 03:50:02,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12352 states. [2022-11-03 03:50:02,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12352 to 12102. [2022-11-03 03:50:02,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12102 states, 12067 states have (on average 4.993287478246457) internal successors, (60254), 12101 states have internal predecessors, (60254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12102 states to 12102 states and 60254 transitions. [2022-11-03 03:50:02,338 INFO L78 Accepts]: Start accepts. Automaton has 12102 states and 60254 transitions. Word has length 17 [2022-11-03 03:50:02,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:02,338 INFO L495 AbstractCegarLoop]: Abstraction has 12102 states and 60254 transitions. [2022-11-03 03:50:02,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:02,338 INFO L276 IsEmpty]: Start isEmpty. Operand 12102 states and 60254 transitions. [2022-11-03 03:50:02,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:50:02,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:02,341 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:50:02,371 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Ended with exit code 0 [2022-11-03 03:50:02,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,112 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:02,542 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:50:02,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:02,542 INFO L85 PathProgramCache]: Analyzing trace with hash -890811819, now seen corresponding path program 5 times [2022-11-03 03:50:02,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:02,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391371617] [2022-11-03 03:50:02,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:02,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:03,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:03,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391371617] [2022-11-03 03:50:03,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391371617] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:50:03,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200342344] [2022-11-03 03:50:03,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:50:03,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:03,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:50:03,144 INFO L229 MonitoredProcess]: Starting monitored process 113 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:50:03,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2022-11-03 03:50:03,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 03:50:03,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:50:03,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-03 03:50:03,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:50:04,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:04,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:50:04,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:04,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:50:04,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:04,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:50:04,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:04,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:50:05,268 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:50:05,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 33 [2022-11-03 03:50:05,281 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:50:05,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1233 treesize of output 1173 [2022-11-03 03:50:05,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1158 treesize of output 1062 [2022-11-03 03:50:05,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 555 treesize of output 507 [2022-11-03 03:50:05,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1014 treesize of output 822 [2022-11-03 03:50:06,155 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:06,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200342344] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:50:06,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1332802725] [2022-11-03 03:50:06,156 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-03 03:50:06,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:50:06,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2022-11-03 03:50:06,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512187736] [2022-11-03 03:50:06,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:50:06,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-03 03:50:06,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:06,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-03 03:50:06,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1700, Unknown=14, NotChecked=0, Total=1892 [2022-11-03 03:50:06,157 INFO L87 Difference]: Start difference. First operand 12102 states and 60254 transitions. Second operand has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:07,405 INFO L93 Difference]: Finished difference Result 12159 states and 60491 transitions. [2022-11-03 03:50:07,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-03 03:50:07,405 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:50:07,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:07,449 INFO L225 Difference]: With dead ends: 12159 [2022-11-03 03:50:07,449 INFO L226 Difference]: Without dead ends: 12159 [2022-11-03 03:50:07,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=340, Invalid=3185, Unknown=15, NotChecked=0, Total=3540 [2022-11-03 03:50:07,450 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 46 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:07,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 166 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 279 Invalid, 0 Unknown, 128 Unchecked, 0.2s Time] [2022-11-03 03:50:07,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12159 states. [2022-11-03 03:50:07,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12159 to 12102. [2022-11-03 03:50:07,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12102 states, 12067 states have (on average 4.993038866329659) internal successors, (60251), 12101 states have internal predecessors, (60251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12102 states to 12102 states and 60251 transitions. [2022-11-03 03:50:07,730 INFO L78 Accepts]: Start accepts. Automaton has 12102 states and 60251 transitions. Word has length 17 [2022-11-03 03:50:07,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:07,730 INFO L495 AbstractCegarLoop]: Abstraction has 12102 states and 60251 transitions. [2022-11-03 03:50:07,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 12102 states and 60251 transitions. [2022-11-03 03:50:07,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:50:07,734 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:07,734 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:50:07,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Ended with exit code 0 [2022-11-03 03:50:07,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable122 [2022-11-03 03:50:07,935 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:50:07,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:07,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1223279375, now seen corresponding path program 6 times [2022-11-03 03:50:07,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:07,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134251153] [2022-11-03 03:50:07,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:07,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:08,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:08,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134251153] [2022-11-03 03:50:08,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134251153] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:50:08,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114483663] [2022-11-03 03:50:08,523 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:50:08,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:08,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:50:08,527 INFO L229 MonitoredProcess]: Starting monitored process 114 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:50:08,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2022-11-03 03:50:09,227 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:50:09,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:50:09,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 03:50:09,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:50:09,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 16 [2022-11-03 03:50:09,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 03:50:09,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-03 03:50:09,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 22 [2022-11-03 03:50:09,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:09,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:50:10,612 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:50:10,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 35 [2022-11-03 03:50:10,624 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:50:10,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 683 treesize of output 655 [2022-11-03 03:50:10,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 319 treesize of output 295 [2022-11-03 03:50:10,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 614 treesize of output 518 [2022-11-03 03:50:10,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 518 treesize of output 470 [2022-11-03 03:50:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:11,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114483663] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:50:11,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1484361672] [2022-11-03 03:50:11,472 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-03 03:50:11,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:50:11,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2022-11-03 03:50:11,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868302356] [2022-11-03 03:50:11,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:50:11,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-03 03:50:11,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:11,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-03 03:50:11,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1702, Unknown=15, NotChecked=0, Total=1892 [2022-11-03 03:50:11,474 INFO L87 Difference]: Start difference. First operand 12102 states and 60251 transitions. Second operand has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:13,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:13,847 INFO L93 Difference]: Finished difference Result 13548 states and 67586 transitions. [2022-11-03 03:50:13,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-03 03:50:13,848 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:50:13,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:13,898 INFO L225 Difference]: With dead ends: 13548 [2022-11-03 03:50:13,898 INFO L226 Difference]: Without dead ends: 13548 [2022-11-03 03:50:13,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=570, Invalid=4965, Unknown=15, NotChecked=0, Total=5550 [2022-11-03 03:50:13,899 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 270 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1531 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:13,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 408 Invalid, 2198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 664 Invalid, 0 Unknown, 1531 Unchecked, 0.5s Time] [2022-11-03 03:50:13,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13548 states. [2022-11-03 03:50:14,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13548 to 12506. [2022-11-03 03:50:14,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12506 states, 12471 states have (on average 5.006013952369497) internal successors, (62430), 12505 states have internal predecessors, (62430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:14,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 62430 transitions. [2022-11-03 03:50:14,216 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 62430 transitions. Word has length 17 [2022-11-03 03:50:14,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:14,216 INFO L495 AbstractCegarLoop]: Abstraction has 12506 states and 62430 transitions. [2022-11-03 03:50:14,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:14,216 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 62430 transitions. [2022-11-03 03:50:14,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:50:14,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:14,220 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:50:14,247 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Ended with exit code 0 [2022-11-03 03:50:14,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123,114 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:14,420 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:50:14,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:14,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1223279379, now seen corresponding path program 6 times [2022-11-03 03:50:14,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:14,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109631127] [2022-11-03 03:50:14,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:14,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:15,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:15,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109631127] [2022-11-03 03:50:15,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109631127] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:50:15,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805233421] [2022-11-03 03:50:15,145 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:50:15,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:15,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:50:15,146 INFO L229 MonitoredProcess]: Starting monitored process 115 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:50:15,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2022-11-03 03:50:15,771 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:50:15,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:50:15,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-03 03:50:15,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:50:16,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:16,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:50:16,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:16,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:50:16,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:16,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:50:16,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:16,549 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:16,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:50:17,164 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:50:17,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 33 [2022-11-03 03:50:17,177 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:50:17,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2465 treesize of output 2341 [2022-11-03 03:50:17,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2326 treesize of output 2134 [2022-11-03 03:50:17,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1067 treesize of output 971 [2022-11-03 03:50:17,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2038 treesize of output 1654 [2022-11-03 03:50:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:21,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805233421] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:50:21,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [193862407] [2022-11-03 03:50:21,905 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-03 03:50:21,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:50:21,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2022-11-03 03:50:21,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643756008] [2022-11-03 03:50:21,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:50:21,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-03 03:50:21,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:21,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-03 03:50:21,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1706, Unknown=11, NotChecked=0, Total=1892 [2022-11-03 03:50:21,906 INFO L87 Difference]: Start difference. First operand 12506 states and 62430 transitions. Second operand has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:23,437 INFO L93 Difference]: Finished difference Result 12567 states and 62679 transitions. [2022-11-03 03:50:23,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-03 03:50:23,437 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:50:23,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:23,483 INFO L225 Difference]: With dead ends: 12567 [2022-11-03 03:50:23,483 INFO L226 Difference]: Without dead ends: 12567 [2022-11-03 03:50:23,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=422, Invalid=3726, Unknown=12, NotChecked=0, Total=4160 [2022-11-03 03:50:23,484 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 54 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:23,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 169 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 287 Invalid, 0 Unknown, 110 Unchecked, 0.2s Time] [2022-11-03 03:50:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12567 states. [2022-11-03 03:50:23,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12567 to 12506. [2022-11-03 03:50:23,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12506 states, 12471 states have (on average 5.005853580306311) internal successors, (62428), 12505 states have internal predecessors, (62428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:23,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 62428 transitions. [2022-11-03 03:50:23,805 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 62428 transitions. Word has length 17 [2022-11-03 03:50:23,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:23,806 INFO L495 AbstractCegarLoop]: Abstraction has 12506 states and 62428 transitions. [2022-11-03 03:50:23,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 62428 transitions. [2022-11-03 03:50:23,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:50:23,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:23,809 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:50:23,832 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Ended with exit code 0 [2022-11-03 03:50:24,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 115 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124 [2022-11-03 03:50:24,009 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:50:24,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:24,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1234004135, now seen corresponding path program 7 times [2022-11-03 03:50:24,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:24,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486503956] [2022-11-03 03:50:24,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:24,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:24,773 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:24,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486503956] [2022-11-03 03:50:24,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486503956] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:50:24,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328174169] [2022-11-03 03:50:24,774 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:50:24,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:24,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:50:24,775 INFO L229 MonitoredProcess]: Starting monitored process 116 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:50:24,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2022-11-03 03:50:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:25,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-03 03:50:25,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:50:25,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:25,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:50:25,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:25,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:50:25,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:25,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:50:25,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:26,017 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:26,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:50:26,137 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6634 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6634) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 8)) 9223372039002259456))) is different from false [2022-11-03 03:50:26,142 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6634 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6634) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 12)) 9223372039002259456))) is different from false [2022-11-03 03:50:26,147 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6634 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6634) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 16))))) is different from false [2022-11-03 03:50:26,155 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6634 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6634) c_~A~0.base) (+ c_~A~0.offset 16)) 9223372039002259456))) is different from false [2022-11-03 03:50:26,161 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6634 (Array Int Int)) (v_ArrVal_6633 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6633) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6634) c_~A~0.base) (+ c_~A~0.offset 16)) 9223372039002259456))) is different from false [2022-11-03 03:50:26,170 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6632 (Array Int Int)) (v_ArrVal_6634 (Array Int Int)) (v_ArrVal_6633 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_6632) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6633) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6634) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-03 03:50:26,179 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:50:26,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 33 [2022-11-03 03:50:26,187 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:50:26,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 157 treesize of output 153 [2022-11-03 03:50:26,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 138 treesize of output 122 [2022-11-03 03:50:26,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:26,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 54 [2022-11-03 03:50:26,552 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-11-03 03:50:26,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328174169] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:50:26,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [301384558] [2022-11-03 03:50:26,553 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-03 03:50:26,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:50:26,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2022-11-03 03:50:26,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093012207] [2022-11-03 03:50:26,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:50:26,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-03 03:50:26,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:26,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-03 03:50:26,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1313, Unknown=6, NotChecked=462, Total=1892 [2022-11-03 03:50:26,555 INFO L87 Difference]: Start difference. First operand 12506 states and 62428 transitions. Second operand has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:30,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:30,015 INFO L93 Difference]: Finished difference Result 20711 states and 95133 transitions. [2022-11-03 03:50:30,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 03:50:30,016 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:50:30,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:30,096 INFO L225 Difference]: With dead ends: 20711 [2022-11-03 03:50:30,096 INFO L226 Difference]: Without dead ends: 20711 [2022-11-03 03:50:30,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=227, Invalid=2341, Unknown=6, NotChecked=618, Total=3192 [2022-11-03 03:50:30,096 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 457 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 2638 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 3521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 812 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:30,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 272 Invalid, 3521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2638 Invalid, 0 Unknown, 812 Unchecked, 1.9s Time] [2022-11-03 03:50:30,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20711 states. [2022-11-03 03:50:30,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20711 to 12296. [2022-11-03 03:50:30,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12296 states, 12261 states have (on average 5.033928717070386) internal successors, (61721), 12295 states have internal predecessors, (61721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:30,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12296 states to 12296 states and 61721 transitions. [2022-11-03 03:50:30,468 INFO L78 Accepts]: Start accepts. Automaton has 12296 states and 61721 transitions. Word has length 17 [2022-11-03 03:50:30,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:30,468 INFO L495 AbstractCegarLoop]: Abstraction has 12296 states and 61721 transitions. [2022-11-03 03:50:30,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:30,469 INFO L276 IsEmpty]: Start isEmpty. Operand 12296 states and 61721 transitions. [2022-11-03 03:50:30,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:50:30,471 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:30,471 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:50:30,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Ended with exit code 0 [2022-11-03 03:50:30,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2022-11-03 03:50:30,672 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:50:30,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:30,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1234004139, now seen corresponding path program 7 times [2022-11-03 03:50:30,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:30,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133092008] [2022-11-03 03:50:30,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:30,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:31,372 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:31,373 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:31,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133092008] [2022-11-03 03:50:31,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133092008] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:50:31,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665623665] [2022-11-03 03:50:31,373 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:50:31,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:31,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:50:31,374 INFO L229 MonitoredProcess]: Starting monitored process 117 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:50:31,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2022-11-03 03:50:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:32,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-03 03:50:32,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:50:32,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:32,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:50:32,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:32,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:50:32,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:32,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:50:32,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:32,596 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:32,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:50:32,715 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6699 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6699) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 8)) 4294967296)) is different from false [2022-11-03 03:50:32,720 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6699 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6699) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 12)) 4294967296)) is different from false [2022-11-03 03:50:32,725 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6699 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6699) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 16)) 4294967296)) is different from false [2022-11-03 03:50:32,732 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6699 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6699) c_~A~0.base) (+ c_~A~0.offset 16)) 4294967296)) is different from false [2022-11-03 03:50:32,738 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6698 (Array Int Int)) (v_ArrVal_6699 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6698) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6699) c_~A~0.base) (+ c_~A~0.offset 16)) 4294967296)) is different from false [2022-11-03 03:50:32,747 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6698 (Array Int Int)) (v_ArrVal_6697 (Array Int Int)) (v_ArrVal_6699 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_6697) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6698) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6699) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 03:50:32,756 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:50:32,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 03:50:32,764 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:50:32,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 277 treesize of output 267 [2022-11-03 03:50:32,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 254 treesize of output 238 [2022-11-03 03:50:32,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:32,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 230 treesize of output 198 [2022-11-03 03:50:33,147 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-11-03 03:50:33,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665623665] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:50:33,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1164014528] [2022-11-03 03:50:33,148 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-03 03:50:33,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:50:33,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2022-11-03 03:50:33,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158573717] [2022-11-03 03:50:33,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:50:33,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-03 03:50:33,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:33,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-03 03:50:33,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1313, Unknown=6, NotChecked=462, Total=1892 [2022-11-03 03:50:33,150 INFO L87 Difference]: Start difference. First operand 12296 states and 61721 transitions. Second operand has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:36,797 INFO L93 Difference]: Finished difference Result 19086 states and 86170 transitions. [2022-11-03 03:50:36,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 03:50:36,798 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:50:36,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:36,867 INFO L225 Difference]: With dead ends: 19086 [2022-11-03 03:50:36,867 INFO L226 Difference]: Without dead ends: 18960 [2022-11-03 03:50:36,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=227, Invalid=2341, Unknown=6, NotChecked=618, Total=3192 [2022-11-03 03:50:36,867 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 458 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 2962 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 3792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 759 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:36,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 310 Invalid, 3792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2962 Invalid, 0 Unknown, 759 Unchecked, 2.1s Time] [2022-11-03 03:50:36,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18960 states. [2022-11-03 03:50:37,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18960 to 11501. [2022-11-03 03:50:37,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11501 states, 11466 states have (on average 4.8746729461015175) internal successors, (55893), 11500 states have internal predecessors, (55893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:37,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11501 states to 11501 states and 55893 transitions. [2022-11-03 03:50:37,194 INFO L78 Accepts]: Start accepts. Automaton has 11501 states and 55893 transitions. Word has length 17 [2022-11-03 03:50:37,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:37,194 INFO L495 AbstractCegarLoop]: Abstraction has 11501 states and 55893 transitions. [2022-11-03 03:50:37,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:37,194 INFO L276 IsEmpty]: Start isEmpty. Operand 11501 states and 55893 transitions. [2022-11-03 03:50:37,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:50:37,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:37,197 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:50:37,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Forceful destruction successful, exit code 0 [2022-11-03 03:50:37,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126,117 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:37,398 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:50:37,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:37,399 INFO L85 PathProgramCache]: Analyzing trace with hash -557909754, now seen corresponding path program 9 times [2022-11-03 03:50:37,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:37,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686697823] [2022-11-03 03:50:37,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:37,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:38,376 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:38,376 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:38,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686697823] [2022-11-03 03:50:38,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686697823] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:50:38,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615318263] [2022-11-03 03:50:38,376 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:50:38,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:38,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:50:38,378 INFO L229 MonitoredProcess]: Starting monitored process 118 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:50:38,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2022-11-03 03:50:39,020 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:50:39,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:50:39,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-03 03:50:39,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:50:39,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:39,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:50:39,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:39,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:50:39,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:39,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:50:39,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:39,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:50:39,941 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6764 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6764) c_~A~0.base) (+ c_~A~0.offset 16)) 4294967296)) is different from false [2022-11-03 03:50:39,949 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6764 (Array Int Int)) (v_ArrVal_6763 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6763) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6764) c_~A~0.base) (+ c_~A~0.offset 16)) 4294967296)) is different from false [2022-11-03 03:50:39,958 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6762 (Array Int Int)) (v_ArrVal_6764 (Array Int Int)) (v_ArrVal_6763 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_6762) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6763) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6764) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 03:50:39,967 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:50:39,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 03:50:39,975 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:50:39,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 139 treesize of output 135 [2022-11-03 03:50:39,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 106 [2022-11-03 03:50:39,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 98 [2022-11-03 03:50:39,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-11-03 03:50:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 03:50:40,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615318263] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:50:40,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [19241775] [2022-11-03 03:50:40,382 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-03 03:50:40,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:50:40,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2022-11-03 03:50:40,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057085738] [2022-11-03 03:50:40,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:50:40,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-03 03:50:40,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:40,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-03 03:50:40,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1520, Unknown=3, NotChecked=240, Total=1892 [2022-11-03 03:50:40,384 INFO L87 Difference]: Start difference. First operand 11501 states and 55893 transitions. Second operand has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:43,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:43,907 INFO L93 Difference]: Finished difference Result 18156 states and 82111 transitions. [2022-11-03 03:50:43,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 03:50:43,915 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:50:43,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:43,981 INFO L225 Difference]: With dead ends: 18156 [2022-11-03 03:50:43,981 INFO L226 Difference]: Without dead ends: 18156 [2022-11-03 03:50:43,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=282, Invalid=2697, Unknown=3, NotChecked=324, Total=3306 [2022-11-03 03:50:43,982 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 540 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 2214 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 2699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 412 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:43,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 250 Invalid, 2699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2214 Invalid, 0 Unknown, 412 Unchecked, 1.9s Time] [2022-11-03 03:50:44,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18156 states. [2022-11-03 03:50:44,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18156 to 12715. [2022-11-03 03:50:44,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12715 states, 12680 states have (on average 5.009779179810725) internal successors, (63524), 12714 states have internal predecessors, (63524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:44,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12715 states to 12715 states and 63524 transitions. [2022-11-03 03:50:44,550 INFO L78 Accepts]: Start accepts. Automaton has 12715 states and 63524 transitions. Word has length 17 [2022-11-03 03:50:44,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:44,551 INFO L495 AbstractCegarLoop]: Abstraction has 12715 states and 63524 transitions. [2022-11-03 03:50:44,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:44,551 INFO L276 IsEmpty]: Start isEmpty. Operand 12715 states and 63524 transitions. [2022-11-03 03:50:44,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:50:44,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:44,554 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:50:44,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Forceful destruction successful, exit code 0 [2022-11-03 03:50:44,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 118 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable127 [2022-11-03 03:50:44,759 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:50:44,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:44,761 INFO L85 PathProgramCache]: Analyzing trace with hash -557909752, now seen corresponding path program 7 times [2022-11-03 03:50:44,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:44,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766931029] [2022-11-03 03:50:44,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:44,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:45,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:45,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766931029] [2022-11-03 03:50:45,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766931029] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:50:45,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757778638] [2022-11-03 03:50:45,434 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:50:45,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:45,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:50:45,435 INFO L229 MonitoredProcess]: Starting monitored process 119 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:50:45,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2022-11-03 03:50:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:46,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-03 03:50:46,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:50:46,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:46,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:50:46,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:46,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:50:46,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:46,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:50:46,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:46,652 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:46,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:50:46,877 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6829 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6829) c_~A~0.base) (+ c_~A~0.offset 16)) 9223372039002259456))) is different from false [2022-11-03 03:50:46,884 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6829 (Array Int Int)) (v_ArrVal_6828 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6828) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6829) c_~A~0.base) (+ c_~A~0.offset 16)) 9223372039002259456))) is different from false [2022-11-03 03:50:46,894 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6827 (Array Int Int)) (v_ArrVal_6829 (Array Int Int)) (v_ArrVal_6828 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_6827) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6828) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6829) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-03 03:50:46,903 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:50:46,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 33 [2022-11-03 03:50:46,914 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:50:46,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1235 treesize of output 1189 [2022-11-03 03:50:46,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 587 treesize of output 555 [2022-11-03 03:50:46,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1142 treesize of output 1078 [2022-11-03 03:50:46,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1078 treesize of output 950 [2022-11-03 03:50:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 03:50:47,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757778638] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:50:47,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1774837799] [2022-11-03 03:50:47,381 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-03 03:50:47,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:50:47,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2022-11-03 03:50:47,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075742606] [2022-11-03 03:50:47,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:50:47,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-03 03:50:47,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:47,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-03 03:50:47,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1515, Unknown=3, NotChecked=240, Total=1892 [2022-11-03 03:50:47,383 INFO L87 Difference]: Start difference. First operand 12715 states and 63524 transitions. Second operand has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:50,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:50,446 INFO L93 Difference]: Finished difference Result 17366 states and 78051 transitions. [2022-11-03 03:50:50,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 03:50:50,447 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:50:50,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:50,507 INFO L225 Difference]: With dead ends: 17366 [2022-11-03 03:50:50,507 INFO L226 Difference]: Without dead ends: 17366 [2022-11-03 03:50:50,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=287, Invalid=2692, Unknown=3, NotChecked=324, Total=3306 [2022-11-03 03:50:50,508 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 487 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 2138 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 2675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 472 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:50,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 237 Invalid, 2675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2138 Invalid, 0 Unknown, 472 Unchecked, 1.6s Time] [2022-11-03 03:50:50,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17366 states. [2022-11-03 03:50:50,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17366 to 12715. [2022-11-03 03:50:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12715 states, 12680 states have (on average 4.91403785488959) internal successors, (62310), 12714 states have internal predecessors, (62310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:51,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12715 states to 12715 states and 62310 transitions. [2022-11-03 03:50:51,043 INFO L78 Accepts]: Start accepts. Automaton has 12715 states and 62310 transitions. Word has length 17 [2022-11-03 03:50:51,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:51,043 INFO L495 AbstractCegarLoop]: Abstraction has 12715 states and 62310 transitions. [2022-11-03 03:50:51,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:51,044 INFO L276 IsEmpty]: Start isEmpty. Operand 12715 states and 62310 transitions. [2022-11-03 03:50:51,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:50:51,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:51,046 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:50:51,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Forceful destruction successful, exit code 0 [2022-11-03 03:50:51,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128 [2022-11-03 03:50:51,247 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:50:51,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:51,247 INFO L85 PathProgramCache]: Analyzing trace with hash -75462852, now seen corresponding path program 7 times [2022-11-03 03:50:51,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:51,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398293775] [2022-11-03 03:50:51,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:51,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:51,556 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:51,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398293775] [2022-11-03 03:50:51,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398293775] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:50:51,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91504746] [2022-11-03 03:50:51,556 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:50:51,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:51,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:50:51,557 INFO L229 MonitoredProcess]: Starting monitored process 120 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:50:51,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2022-11-03 03:50:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:52,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-03 03:50:52,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:50:52,561 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:52,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:50:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:52,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91504746] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:50:52,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [100300151] [2022-11-03 03:50:52,821 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java: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-03 03:50:52,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:50:52,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2022-11-03 03:50:52,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323739921] [2022-11-03 03:50:52,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:50:52,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 03:50:52,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:52,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 03:50:52,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=944, Unknown=0, NotChecked=0, Total=1190 [2022-11-03 03:50:52,822 INFO L87 Difference]: Start difference. First operand 12715 states and 62310 transitions. Second operand has 35 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:53,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:53,808 INFO L93 Difference]: Finished difference Result 12616 states and 61425 transitions. [2022-11-03 03:50:53,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 03:50:53,808 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:50:53,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:53,847 INFO L225 Difference]: With dead ends: 12616 [2022-11-03 03:50:53,847 INFO L226 Difference]: Without dead ends: 11305 [2022-11-03 03:50:53,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=389, Invalid=1333, Unknown=0, NotChecked=0, Total=1722 [2022-11-03 03:50:53,848 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 245 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:53,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 78 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 03:50:53,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11305 states. [2022-11-03 03:50:54,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11305 to 11305. [2022-11-03 03:50:54,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11305 states, 11270 states have (on average 4.995563442768412) internal successors, (56300), 11304 states have internal predecessors, (56300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:54,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11305 states to 11305 states and 56300 transitions. [2022-11-03 03:50:54,200 INFO L78 Accepts]: Start accepts. Automaton has 11305 states and 56300 transitions. Word has length 17 [2022-11-03 03:50:54,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:54,200 INFO L495 AbstractCegarLoop]: Abstraction has 11305 states and 56300 transitions. [2022-11-03 03:50:54,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:54,201 INFO L276 IsEmpty]: Start isEmpty. Operand 11305 states and 56300 transitions. [2022-11-03 03:50:54,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 03:50:54,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:54,203 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:50:54,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Forceful destruction successful, exit code 0 [2022-11-03 03:50:54,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 120 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable129 [2022-11-03 03:50:54,404 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:50:54,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:54,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1060108286, now seen corresponding path program 2 times [2022-11-03 03:50:54,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:54,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687339807] [2022-11-03 03:50:54,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:54,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:57,351 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:57,352 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:57,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687339807] [2022-11-03 03:50:57,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687339807] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:50:57,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340645849] [2022-11-03 03:50:57,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:50:57,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:57,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:50:57,355 INFO L229 MonitoredProcess]: Starting monitored process 121 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:50:57,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2022-11-03 03:50:58,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-03 03:50:58,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:50:58,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-03 03:50:58,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:50:58,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:50:58,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 28 [2022-11-03 03:50:58,464 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:50:58,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 43 [2022-11-03 03:50:58,557 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:50:58,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 53 treesize of output 58 [2022-11-03 03:50:58,642 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:50:58,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 65 treesize of output 73 [2022-11-03 03:50:58,753 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:50:58,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 59 treesize of output 70 [2022-11-03 03:50:58,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:50:58,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 61 treesize of output 53 [2022-11-03 03:50:59,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:50:59,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 61 treesize of output 53 [2022-11-03 03:50:59,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:50:59,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 61 treesize of output 53 [2022-11-03 03:50:59,504 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:59,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:50:59,723 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_6968 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6968) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0) 4)) 4294967296)) (not (< (+ c_~M~0 1) c_~N~0))) is different from false [2022-11-03 03:50:59,735 WARN L833 $PredicateComparison]: unable to prove that (or (not (< (+ c_~M~0 1) c_~N~0)) (forall ((v_ArrVal_6968 (Array Int Int)) (v_ArrVal_6967 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6967) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6968) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0) 4)) 4294967296))) is different from false [2022-11-03 03:51:00,769 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:51:00,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 case distinctions, treesize of input 73 treesize of output 99 [2022-11-03 03:51:00,811 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:51:00,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1357 treesize of output 1314 [2022-11-03 03:51:00,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 607 treesize of output 551 [2022-11-03 03:51:00,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1158 treesize of output 1046 [2022-11-03 03:51:00,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1046 treesize of output 822 [2022-11-03 03:51:01,030 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-03 03:51:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:01,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340645849] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:01,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1310301098] [2022-11-03 03:51:01,981 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-03 03:51:01,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:51:01,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2022-11-03 03:51:01,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506537920] [2022-11-03 03:51:01,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:01,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-03 03:51:01,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:01,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-03 03:51:01,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1271, Unknown=17, NotChecked=150, Total=1640 [2022-11-03 03:51:01,982 INFO L87 Difference]: Start difference. First operand 11305 states and 56300 transitions. Second operand has 41 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:07,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:07,567 INFO L93 Difference]: Finished difference Result 18193 states and 88969 transitions. [2022-11-03 03:51:07,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-03 03:51:07,568 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 03:51:07,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:07,645 INFO L225 Difference]: With dead ends: 18193 [2022-11-03 03:51:07,645 INFO L226 Difference]: Without dead ends: 18193 [2022-11-03 03:51:07,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=524, Invalid=3108, Unknown=36, NotChecked=238, Total=3906 [2022-11-03 03:51:07,646 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 245 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 1601 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 274 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:07,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 230 Invalid, 1907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1601 Invalid, 0 Unknown, 274 Unchecked, 1.8s Time] [2022-11-03 03:51:07,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18193 states. [2022-11-03 03:51:08,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18193 to 12170. [2022-11-03 03:51:08,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12170 states, 12135 states have (on average 5.012278533168521) internal successors, (60824), 12169 states have internal predecessors, (60824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:08,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12170 states to 12170 states and 60824 transitions. [2022-11-03 03:51:08,187 INFO L78 Accepts]: Start accepts. Automaton has 12170 states and 60824 transitions. Word has length 18 [2022-11-03 03:51:08,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:08,188 INFO L495 AbstractCegarLoop]: Abstraction has 12170 states and 60824 transitions. [2022-11-03 03:51:08,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand 12170 states and 60824 transitions. [2022-11-03 03:51:08,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 03:51:08,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:08,190 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2022-11-03 03:51:08,217 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Ended with exit code 0 [2022-11-03 03:51:08,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,121 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:08,391 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:51:08,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:08,391 INFO L85 PathProgramCache]: Analyzing trace with hash -359328433, now seen corresponding path program 10 times [2022-11-03 03:51:08,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:08,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893287792] [2022-11-03 03:51:08,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:08,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:09,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:09,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893287792] [2022-11-03 03:51:09,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893287792] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:09,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758585529] [2022-11-03 03:51:09,129 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:51:09,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:09,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:09,130 INFO L229 MonitoredProcess]: Starting monitored process 122 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:09,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2022-11-03 03:51:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:09,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 03:51:09,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:10,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:10,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:10,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:10,396 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:10,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:10,726 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7031 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7031) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-03 03:51:10,734 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:51:10,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:10,745 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:51:10,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:11,064 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-03 03:51:11,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758585529] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:11,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1233239202] [2022-11-03 03:51:11,064 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-03 03:51:11,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:51:11,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2022-11-03 03:51:11,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831392303] [2022-11-03 03:51:11,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:11,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-03 03:51:11,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:11,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-03 03:51:11,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2209, Unknown=1, NotChecked=94, Total=2450 [2022-11-03 03:51:11,066 INFO L87 Difference]: Start difference. First operand 12170 states and 60824 transitions. Second operand has 50 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:13,453 INFO L93 Difference]: Finished difference Result 13062 states and 63950 transitions. [2022-11-03 03:51:13,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 03:51:13,453 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 03:51:13,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:13,505 INFO L225 Difference]: With dead ends: 13062 [2022-11-03 03:51:13,505 INFO L226 Difference]: Without dead ends: 13062 [2022-11-03 03:51:13,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=296, Invalid=4129, Unknown=1, NotChecked=130, Total=4556 [2022-11-03 03:51:13,506 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 139 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 2098 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:13,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 152 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2098 Invalid, 0 Unknown, 59 Unchecked, 1.3s Time] [2022-11-03 03:51:13,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13062 states. [2022-11-03 03:51:13,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13062 to 12176. [2022-11-03 03:51:13,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12176 states, 12141 states have (on average 5.011778271971007) internal successors, (60848), 12175 states have internal predecessors, (60848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:13,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12176 states to 12176 states and 60848 transitions. [2022-11-03 03:51:13,880 INFO L78 Accepts]: Start accepts. Automaton has 12176 states and 60848 transitions. Word has length 18 [2022-11-03 03:51:13,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:13,880 INFO L495 AbstractCegarLoop]: Abstraction has 12176 states and 60848 transitions. [2022-11-03 03:51:13,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:13,881 INFO L276 IsEmpty]: Start isEmpty. Operand 12176 states and 60848 transitions. [2022-11-03 03:51:13,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 03:51:13,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:13,883 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2022-11-03 03:51:13,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:14,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131,122 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:14,084 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:51:14,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:14,084 INFO L85 PathProgramCache]: Analyzing trace with hash -359328437, now seen corresponding path program 9 times [2022-11-03 03:51:14,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:14,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860759183] [2022-11-03 03:51:14,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:14,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:14,688 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:14,688 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:14,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860759183] [2022-11-03 03:51:14,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860759183] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:14,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802083322] [2022-11-03 03:51:14,688 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:51:14,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:14,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:14,691 INFO L229 MonitoredProcess]: Starting monitored process 123 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:14,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2022-11-03 03:51:15,381 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:51:15,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:51:15,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 03:51:15,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:15,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:15,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:15,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:16,069 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:16,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:16,386 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7094 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7094) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 03:51:16,394 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:51:16,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:16,402 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:51:16,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:16,713 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-03 03:51:16,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802083322] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:16,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1412938055] [2022-11-03 03:51:16,713 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-03 03:51:16,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:51:16,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2022-11-03 03:51:16,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711341821] [2022-11-03 03:51:16,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:16,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-03 03:51:16,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:16,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-03 03:51:16,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2209, Unknown=1, NotChecked=94, Total=2450 [2022-11-03 03:51:16,715 INFO L87 Difference]: Start difference. First operand 12176 states and 60848 transitions. Second operand has 50 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:19,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:19,022 INFO L93 Difference]: Finished difference Result 13008 states and 63635 transitions. [2022-11-03 03:51:19,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 03:51:19,023 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 03:51:19,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:19,075 INFO L225 Difference]: With dead ends: 13008 [2022-11-03 03:51:19,075 INFO L226 Difference]: Without dead ends: 13008 [2022-11-03 03:51:19,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=296, Invalid=4129, Unknown=1, NotChecked=130, Total=4556 [2022-11-03 03:51:19,076 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 149 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 2084 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 2205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:19,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 150 Invalid, 2205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2084 Invalid, 0 Unknown, 94 Unchecked, 1.2s Time] [2022-11-03 03:51:19,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13008 states. [2022-11-03 03:51:19,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13008 to 12176. [2022-11-03 03:51:19,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12176 states, 12141 states have (on average 5.011284078741455) internal successors, (60842), 12175 states have internal predecessors, (60842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12176 states to 12176 states and 60842 transitions. [2022-11-03 03:51:19,555 INFO L78 Accepts]: Start accepts. Automaton has 12176 states and 60842 transitions. Word has length 18 [2022-11-03 03:51:19,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:19,556 INFO L495 AbstractCegarLoop]: Abstraction has 12176 states and 60842 transitions. [2022-11-03 03:51:19,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:19,556 INFO L276 IsEmpty]: Start isEmpty. Operand 12176 states and 60842 transitions. [2022-11-03 03:51:19,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 03:51:19,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:19,560 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:19,584 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Ended with exit code 0 [2022-11-03 03:51:19,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132,123 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:19,761 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:51:19,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:19,761 INFO L85 PathProgramCache]: Analyzing trace with hash -5882332, now seen corresponding path program 8 times [2022-11-03 03:51:19,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:19,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465163120] [2022-11-03 03:51:19,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:19,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:20,543 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:20,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:20,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465163120] [2022-11-03 03:51:20,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465163120] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:20,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352990366] [2022-11-03 03:51:20,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:51:20,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:20,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:20,544 INFO L229 MonitoredProcess]: Starting monitored process 124 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:20,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2022-11-03 03:51:21,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 03:51:21,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:51:21,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-03 03:51:21,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:21,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:21,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:21,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:21,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:21,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:22,242 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:22,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:23,003 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:51:23,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:23,013 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:51:23,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:23,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:23,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:23,706 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:23,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352990366] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:23,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1227493504] [2022-11-03 03:51:23,706 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-03 03:51:23,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:51:23,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2022-11-03 03:51:23,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151980666] [2022-11-03 03:51:23,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:23,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-03 03:51:23,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:23,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-03 03:51:23,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1940, Unknown=3, NotChecked=0, Total=2162 [2022-11-03 03:51:23,709 INFO L87 Difference]: Start difference. First operand 12176 states and 60842 transitions. Second operand has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:25,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:25,077 INFO L93 Difference]: Finished difference Result 12493 states and 62067 transitions. [2022-11-03 03:51:25,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 03:51:25,078 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 03:51:25,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:25,128 INFO L225 Difference]: With dead ends: 12493 [2022-11-03 03:51:25,129 INFO L226 Difference]: Without dead ends: 12493 [2022-11-03 03:51:25,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=383, Invalid=3396, Unknown=3, NotChecked=0, Total=3782 [2022-11-03 03:51:25,129 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 68 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:25,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 209 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 579 Invalid, 0 Unknown, 174 Unchecked, 0.4s Time] [2022-11-03 03:51:25,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12493 states. [2022-11-03 03:51:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12493 to 12166. [2022-11-03 03:51:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12166 states, 12131 states have (on average 5.013271783035199) internal successors, (60816), 12165 states have internal predecessors, (60816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12166 states to 12166 states and 60816 transitions. [2022-11-03 03:51:25,642 INFO L78 Accepts]: Start accepts. Automaton has 12166 states and 60816 transitions. Word has length 18 [2022-11-03 03:51:25,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:25,642 INFO L495 AbstractCegarLoop]: Abstraction has 12166 states and 60816 transitions. [2022-11-03 03:51:25,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:25,642 INFO L276 IsEmpty]: Start isEmpty. Operand 12166 states and 60816 transitions. [2022-11-03 03:51:25,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 03:51:25,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:25,645 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:25,652 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Ended with exit code 0 [2022-11-03 03:51:25,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 124 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable133 [2022-11-03 03:51:25,846 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:51:25,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:25,847 INFO L85 PathProgramCache]: Analyzing trace with hash -5882330, now seen corresponding path program 7 times [2022-11-03 03:51:25,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:25,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438919199] [2022-11-03 03:51:25,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:25,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:26,407 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:26,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438919199] [2022-11-03 03:51:26,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438919199] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:26,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423394623] [2022-11-03 03:51:26,408 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:51:26,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:26,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:26,409 INFO L229 MonitoredProcess]: Starting monitored process 125 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:26,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2022-11-03 03:51:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:27,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 03:51:27,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:27,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:27,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:27,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:27,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:27,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:27,691 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:27,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:28,096 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7222 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7222) c_~A~0.base) (+ c_~A~0.offset 20)) 9223372039002259456))) is different from false [2022-11-03 03:51:28,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7222 (Array Int Int)) (v_ArrVal_7221 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7221) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7222) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-03 03:51:28,114 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:51:28,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:28,121 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:51:28,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:28,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 28 [2022-11-03 03:51:28,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 50 [2022-11-03 03:51:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-03 03:51:28,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423394623] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:28,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [916766795] [2022-11-03 03:51:28,438 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-03 03:51:28,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:51:28,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2022-11-03 03:51:28,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111759650] [2022-11-03 03:51:28,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:28,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-03 03:51:28,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:28,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-03 03:51:28,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1847, Unknown=2, NotChecked=174, Total=2162 [2022-11-03 03:51:28,440 INFO L87 Difference]: Start difference. First operand 12166 states and 60816 transitions. Second operand has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:31,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:31,110 INFO L93 Difference]: Finished difference Result 13194 states and 63985 transitions. [2022-11-03 03:51:31,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 03:51:31,111 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 03:51:31,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:31,162 INFO L225 Difference]: With dead ends: 13194 [2022-11-03 03:51:31,162 INFO L226 Difference]: Without dead ends: 13194 [2022-11-03 03:51:31,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=295, Invalid=3371, Unknown=2, NotChecked=238, Total=3906 [2022-11-03 03:51:31,163 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 198 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 1965 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 2126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:31,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 231 Invalid, 2126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1965 Invalid, 0 Unknown, 123 Unchecked, 1.3s Time] [2022-11-03 03:51:31,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13194 states. [2022-11-03 03:51:31,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13194 to 12228. [2022-11-03 03:51:31,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12228 states, 12193 states have (on average 5.015582711391782) internal successors, (61155), 12227 states have internal predecessors, (61155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:31,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12228 states to 12228 states and 61155 transitions. [2022-11-03 03:51:31,604 INFO L78 Accepts]: Start accepts. Automaton has 12228 states and 61155 transitions. Word has length 18 [2022-11-03 03:51:31,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:31,604 INFO L495 AbstractCegarLoop]: Abstraction has 12228 states and 61155 transitions. [2022-11-03 03:51:31,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:31,605 INFO L276 IsEmpty]: Start isEmpty. Operand 12228 states and 61155 transitions. [2022-11-03 03:51:31,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 03:51:31,609 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:31,609 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:31,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:31,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134,125 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:31,810 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:51:31,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:31,810 INFO L85 PathProgramCache]: Analyzing trace with hash -630246351, now seen corresponding path program 1 times [2022-11-03 03:51:31,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:31,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456455490] [2022-11-03 03:51:31,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:31,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:32,568 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:32,568 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:32,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456455490] [2022-11-03 03:51:32,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456455490] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:32,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280536914] [2022-11-03 03:51:32,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:32,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:32,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:32,569 INFO L229 MonitoredProcess]: Starting monitored process 126 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:32,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2022-11-03 03:51:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:33,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 03:51:33,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:33,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:33,525 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 03:51:33,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 [2022-11-03 03:51:33,590 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 03:51:33,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 [2022-11-03 03:51:33,653 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 03:51:33,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 [2022-11-03 03:51:33,711 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 03:51:33,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 [2022-11-03 03:51:33,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:33,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:33,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:33,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:33,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:33,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:34,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:34,248 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7299 (Array Int Int)) (~M~0 Int)) (or (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7299) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 9223372039002259456)) (< (+ |c_thread2Thread1of1ForFork2_~i~1#1| 1) ~M~0) (not (< |c_thread2Thread1of1ForFork2_~i~1#1| ~M~0)))) is different from false [2022-11-03 03:51:34,259 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7299 (Array Int Int)) (~M~0 Int)) (or (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7299) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 9223372039002259456)) (not (< 0 ~M~0)) (< 1 ~M~0))) is different from false [2022-11-03 03:51:34,281 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7299 (Array Int Int)) (v_ArrVal_7298 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< 1 ~M~0) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7298) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7299) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 9223372039002259456)))) is different from false [2022-11-03 03:51:34,303 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7299 (Array Int Int)) (v_ArrVal_7298 (Array Int Int)) (~M~0 Int) (v_ArrVal_7297 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7297) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7298) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7299) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< 0 ~M~0)) (< 1 ~M~0))) is different from false [2022-11-03 03:51:34,317 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7299 (Array Int Int)) (v_ArrVal_7296 Int) (v_ArrVal_7298 (Array Int Int)) (~M~0 Int) (v_ArrVal_7297 (Array Int Int))) (or (not (< 0 ~M~0)) (< 0 (+ (select (select (store (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~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7296)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7297) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7298) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7299) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< 1 ~M~0))) is different from false [2022-11-03 03:51:34,339 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7299 (Array Int Int)) (v_ArrVal_7296 Int) (v_ArrVal_7298 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_885| Int) (v_ArrVal_7294 Int) (~M~0 Int) (v_ArrVal_7297 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (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~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7294) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_885| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7296)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7297) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7298) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7299) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< 0 ~M~0)) (< 1 ~M~0) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_885|)))) is different from false [2022-11-03 03:51:34,368 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7299 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_886| Int) (v_ArrVal_7296 Int) (v_ArrVal_7298 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_885| Int) (v_ArrVal_7294 Int) (~M~0 Int) (v_ArrVal_7291 Int) (v_ArrVal_7297 (Array Int Int))) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_886|)) (not (< 0 ~M~0)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_886| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_885|)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (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~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7291) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_886| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7294) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_885| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7296)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7297) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7298) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7299) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< 1 ~M~0))) is different from false [2022-11-03 03:51:34,401 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_887| Int) (v_ArrVal_7299 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_886| Int) (v_ArrVal_7296 Int) (v_ArrVal_7298 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_885| Int) (v_ArrVal_7294 Int) (~M~0 Int) (v_ArrVal_7291 Int) (v_ArrVal_7289 Int) (v_ArrVal_7297 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (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~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7289) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_887| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7291) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_886| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7294) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_885| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7296)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7297) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7298) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7299) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_887| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_886|)) (not (< 0 ~M~0)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_886| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_885|)) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_887|)) (< 1 ~M~0))) is different from false [2022-11-03 03:51:34,503 INFO L356 Elim1Store]: treesize reduction 364, result has 14.4 percent of original size [2022-11-03 03:51:34,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 83 [2022-11-03 03:51:34,517 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:51:34,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 683 treesize of output 655 [2022-11-03 03:51:34,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 319 treesize of output 295 [2022-11-03 03:51:34,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 614 treesize of output 566 [2022-11-03 03:51:34,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 566 treesize of output 470 [2022-11-03 03:51:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 20 not checked. [2022-11-03 03:51:35,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280536914] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:35,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [845617972] [2022-11-03 03:51:35,355 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-03 03:51:35,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:51:35,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2022-11-03 03:51:35,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152935427] [2022-11-03 03:51:35,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:35,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-03 03:51:35,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:35,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-03 03:51:35,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1154, Unknown=8, NotChecked=600, Total=1892 [2022-11-03 03:51:35,357 INFO L87 Difference]: Start difference. First operand 12228 states and 61155 transitions. Second operand has 44 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:36,516 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_887| Int) (v_ArrVal_7299 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_886| Int) (v_ArrVal_7296 Int) (v_ArrVal_7298 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_885| Int) (v_ArrVal_7294 Int) (~M~0 Int) (v_ArrVal_7291 Int) (v_ArrVal_7289 Int) (v_ArrVal_7297 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (store .cse0 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7289) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_887| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7291) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_886| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7294) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_885| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7296)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7297) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7298) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7299) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_887| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_886|)) (not (< 0 ~M~0)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_886| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_885|)) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_887|)) (< 1 ~M~0))) (<= (+ (div (- |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) 2) |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-11-03 03:51:37,342 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ (div (- |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) 3) |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 3 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (forall ((v_ArrVal_7299 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_886| Int) (v_ArrVal_7296 Int) (v_ArrVal_7298 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_885| Int) (v_ArrVal_7294 Int) (~M~0 Int) (v_ArrVal_7291 Int) (v_ArrVal_7297 (Array Int Int))) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_886|)) (not (< 0 ~M~0)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_886| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_885|)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store .cse0 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7291) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_886| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7294) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_885| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7296)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7297) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7298) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7299) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< 1 ~M~0))) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-11-03 03:51:38,171 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (forall ((v_ArrVal_7299 (Array Int Int)) (v_ArrVal_7296 Int) (v_ArrVal_7298 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_885| Int) (v_ArrVal_7294 Int) (~M~0 Int) (v_ArrVal_7297 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse0 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7294) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_885| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7296)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7297) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7298) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7299) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< 0 ~M~0)) (< 1 ~M~0) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_885|)))) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (+ (div (- |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) 4) |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-11-03 03:51:38,711 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse2 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (not (= .cse1 4)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 5 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base|) (forall ((v_ArrVal_7299 (Array Int Int)) (v_ArrVal_7296 Int) (v_ArrVal_7298 (Array Int Int)) (~M~0 Int) (v_ArrVal_7297 (Array Int Int))) (or (not (< 0 ~M~0)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse0 .cse1 v_ArrVal_7296)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7297) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7298) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7299) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< 1 ~M~0))) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-11-03 03:51:41,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:41,391 INFO L93 Difference]: Finished difference Result 14891 states and 70328 transitions. [2022-11-03 03:51:41,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-03 03:51:41,392 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 03:51:41,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:41,449 INFO L225 Difference]: With dead ends: 14891 [2022-11-03 03:51:41,449 INFO L226 Difference]: Without dead ends: 14891 [2022-11-03 03:51:41,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=336, Invalid=2150, Unknown=12, NotChecked=1284, Total=3782 [2022-11-03 03:51:41,450 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 311 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 2342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 945 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:41,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 126 Invalid, 2342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1353 Invalid, 0 Unknown, 945 Unchecked, 1.2s Time] [2022-11-03 03:51:41,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14891 states. [2022-11-03 03:51:41,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14891 to 12479. [2022-11-03 03:51:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12479 states, 12444 states have (on average 4.9729990356798455) internal successors, (61884), 12478 states have internal predecessors, (61884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12479 states to 12479 states and 61884 transitions. [2022-11-03 03:51:41,844 INFO L78 Accepts]: Start accepts. Automaton has 12479 states and 61884 transitions. Word has length 18 [2022-11-03 03:51:41,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:41,844 INFO L495 AbstractCegarLoop]: Abstraction has 12479 states and 61884 transitions. [2022-11-03 03:51:41,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:41,844 INFO L276 IsEmpty]: Start isEmpty. Operand 12479 states and 61884 transitions. [2022-11-03 03:51:41,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 03:51:41,847 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:41,847 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:41,873 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Ended with exit code 0 [2022-11-03 03:51:42,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 126 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2022-11-03 03:51:42,047 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:51:42,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:42,048 INFO L85 PathProgramCache]: Analyzing trace with hash -630228092, now seen corresponding path program 1 times [2022-11-03 03:51:42,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:42,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749051648] [2022-11-03 03:51:42,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:42,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:44,093 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-03 03:51:44,093 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:44,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749051648] [2022-11-03 03:51:44,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749051648] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:44,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85652684] [2022-11-03 03:51:44,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:44,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:44,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:44,095 INFO L229 MonitoredProcess]: Starting monitored process 127 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:44,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2022-11-03 03:51:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:44,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-03 03:51:44,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:44,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:45,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 24 [2022-11-03 03:51:45,108 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-03 03:51:45,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-11-03 03:51:45,221 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-11-03 03:51:45,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 58 [2022-11-03 03:51:45,321 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:51:45,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 58 treesize of output 66 [2022-11-03 03:51:45,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:45,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2022-11-03 03:51:45,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:45,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2022-11-03 03:51:45,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:45,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2022-11-03 03:51:46,101 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-03 03:51:46,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:47,426 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:51:47,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 87 [2022-11-03 03:51:47,462 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:51:47,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 739 treesize of output 731 [2022-11-03 03:51:47,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 638 treesize of output 590 [2022-11-03 03:51:47,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 590 treesize of output 494 [2022-11-03 03:51:47,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 259 treesize of output 235 [2022-11-03 03:51:48,776 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-03 03:51:48,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85652684] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:48,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [699796852] [2022-11-03 03:51:48,776 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-03 03:51:48,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:51:48,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2022-11-03 03:51:48,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258455874] [2022-11-03 03:51:48,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:48,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-03 03:51:48,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:48,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-03 03:51:48,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1433, Unknown=25, NotChecked=0, Total=1640 [2022-11-03 03:51:48,778 INFO L87 Difference]: Start difference. First operand 12479 states and 61884 transitions. Second operand has 41 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:53,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:53,268 INFO L93 Difference]: Finished difference Result 19127 states and 94908 transitions. [2022-11-03 03:51:53,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-03 03:51:53,269 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 03:51:53,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:53,351 INFO L225 Difference]: With dead ends: 19127 [2022-11-03 03:51:53,351 INFO L226 Difference]: Without dead ends: 19060 [2022-11-03 03:51:53,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=510, Invalid=3348, Unknown=48, NotChecked=0, Total=3906 [2022-11-03 03:51:53,352 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 197 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 519 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:53,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 209 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1192 Invalid, 0 Unknown, 519 Unchecked, 1.3s Time] [2022-11-03 03:51:53,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19060 states. [2022-11-03 03:51:53,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19060 to 13468. [2022-11-03 03:51:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13468 states, 13433 states have (on average 5.007146579319586) internal successors, (67261), 13467 states have internal predecessors, (67261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13468 states to 13468 states and 67261 transitions. [2022-11-03 03:51:53,797 INFO L78 Accepts]: Start accepts. Automaton has 13468 states and 67261 transitions. Word has length 18 [2022-11-03 03:51:53,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:53,798 INFO L495 AbstractCegarLoop]: Abstraction has 13468 states and 67261 transitions. [2022-11-03 03:51:53,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:53,798 INFO L276 IsEmpty]: Start isEmpty. Operand 13468 states and 67261 transitions. [2022-11-03 03:51:53,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 03:51:53,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:53,801 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:53,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Ended with exit code 0 [2022-11-03 03:51:54,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 127 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable136 [2022-11-03 03:51:54,001 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:51:54,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:54,002 INFO L85 PathProgramCache]: Analyzing trace with hash -632164352, now seen corresponding path program 1 times [2022-11-03 03:51:54,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:54,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935618421] [2022-11-03 03:51:54,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:54,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:54,649 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:54,649 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:54,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935618421] [2022-11-03 03:51:54,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935618421] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:54,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142613503] [2022-11-03 03:51:54,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:54,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:54,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:54,654 INFO L229 MonitoredProcess]: Starting monitored process 128 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:54,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2022-11-03 03:51:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:55,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-03 03:51:55,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:55,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:55,437 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-03 03:51:55,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:55,499 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-03 03:51:55,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:55,553 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-03 03:51:55,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:55,614 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-03 03:51:55,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:55,674 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-03 03:51:55,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:55,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:55,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:55,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:55,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:55,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:55,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:55,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:56,261 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7453 (Array Int Int)) (v_ArrVal_7455 (Array Int Int)) (v_ArrVal_7454 (Array Int Int)) (~M~0 Int)) (or (< 0 ~M~0) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7453) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7454) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7455) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< ~M~0 0))) is different from false [2022-11-03 03:51:56,277 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7453 (Array Int Int)) (v_ArrVal_7455 (Array Int Int)) (v_ArrVal_7454 (Array Int Int)) (~M~0 Int) (v_ArrVal_7452 Int)) (or (< 0 (+ (select (select (store (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~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7452)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7453) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7454) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7455) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< 0 ~M~0) (< ~M~0 0))) is different from false [2022-11-03 03:51:56,297 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7453 (Array Int Int)) (v_ArrVal_7450 Int) (v_ArrVal_7455 (Array Int Int)) (v_ArrVal_7454 (Array Int Int)) (~M~0 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908| Int) (v_ArrVal_7452 Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908|)) (< 0 ~M~0) (< ~M~0 0) (< 0 (+ 9223372039002259456 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (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~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7450) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7452)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7453) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7454) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7455) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) is different from false [2022-11-03 03:51:56,324 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7453 (Array Int Int)) (v_ArrVal_7450 Int) (v_ArrVal_7455 (Array Int Int)) (v_ArrVal_7454 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909| Int) (~M~0 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908| Int) (v_ArrVal_7448 Int) (v_ArrVal_7452 Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909|)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908|)) (< 0 ~M~0) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (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~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7448) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7450) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7452)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7453) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7454) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7455) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< ~M~0 0))) is different from false [2022-11-03 03:51:56,358 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7453 (Array Int Int)) (v_ArrVal_7450 Int) (v_ArrVal_7455 (Array Int Int)) (v_ArrVal_7454 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909| Int) (~M~0 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908| Int) (v_ArrVal_7448 Int) (v_ArrVal_7445 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_910| Int) (v_ArrVal_7452 Int)) (or (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_910| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909|)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908|)) (< 0 ~M~0) (< ~M~0 0) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_910|)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (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~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7445) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_910| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7448) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7450) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7452)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7453) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7454) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7455) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) is different from false [2022-11-03 03:51:56,402 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7448 Int) (v_ArrVal_7445 Int) (v_ArrVal_7444 Int) (v_ArrVal_7452 Int) (v_ArrVal_7453 (Array Int Int)) (v_ArrVal_7450 Int) (v_ArrVal_7455 (Array Int Int)) (v_ArrVal_7454 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909| Int) (~M~0 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_911| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_910| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_911|)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_910| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909|)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908|)) (< 0 ~M~0) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (store (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~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7444) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_911| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7445) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_910| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7448) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7450) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7452)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7453) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7454) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7455) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< ~M~0 0) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_911| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_910|)))) is different from false [2022-11-03 03:51:56,661 INFO L356 Elim1Store]: treesize reduction 585, result has 11.1 percent of original size [2022-11-03 03:51:56,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 case distinctions, treesize of input 69 treesize of output 95 [2022-11-03 03:51:56,674 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:51:56,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 343 treesize of output 331 [2022-11-03 03:51:56,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 314 treesize of output 290 [2022-11-03 03:51:56,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 150 treesize of output 138 [2022-11-03 03:51:56,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 278 treesize of output 230 [2022-11-03 03:51:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2022-11-03 03:51:56,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142613503] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:56,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1152605901] [2022-11-03 03:51:56,898 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-03 03:51:56,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:51:56,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2022-11-03 03:51:56,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098042862] [2022-11-03 03:51:56,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:56,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-03 03:51:56,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:56,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-03 03:51:56,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1064, Unknown=8, NotChecked=426, Total=1640 [2022-11-03 03:51:56,901 INFO L87 Difference]: Start difference. First operand 13468 states and 67261 transitions. Second operand has 41 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:58,167 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 (+ (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse1 0) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (+ (div (- |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) 1) |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((v_ArrVal_7448 Int) (v_ArrVal_7445 Int) (v_ArrVal_7444 Int) (v_ArrVal_7452 Int) (v_ArrVal_7453 (Array Int Int)) (v_ArrVal_7450 Int) (v_ArrVal_7455 (Array Int Int)) (v_ArrVal_7454 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909| Int) (~M~0 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_911| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_910| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_911|)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_910| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909|)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908|)) (< 0 ~M~0) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (store (store .cse1 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7444) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_911| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7445) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_910| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7448) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7450) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7452)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7453) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7454) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7455) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< ~M~0 0) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_911| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_910|)))))) is different from false [2022-11-03 03:51:59,165 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (forall ((v_ArrVal_7453 (Array Int Int)) (v_ArrVal_7450 Int) (v_ArrVal_7455 (Array Int Int)) (v_ArrVal_7454 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909| Int) (~M~0 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908| Int) (v_ArrVal_7448 Int) (v_ArrVal_7445 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_910| Int) (v_ArrVal_7452 Int)) (or (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_910| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909|)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908|)) (< 0 ~M~0) (< ~M~0 0) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_910|)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (store .cse0 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7445) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_910| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7448) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7450) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7452)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7453) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7454) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7455) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) (<= (+ (div (- |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) 2) |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648)) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse0 0) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-11-03 03:51:59,973 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ (div (- |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) 3) |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= 0 (+ (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse1 0) 2147483648)) (<= 3 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((v_ArrVal_7453 (Array Int Int)) (v_ArrVal_7450 Int) (v_ArrVal_7455 (Array Int Int)) (v_ArrVal_7454 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909| Int) (~M~0 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908| Int) (v_ArrVal_7448 Int) (v_ArrVal_7452 Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909|)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908|)) (< 0 ~M~0) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store .cse1 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7448) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_909| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7450) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7452)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7453) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7454) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7455) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< ~M~0 0))))) is different from false [2022-11-03 03:52:00,778 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 (+ (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse1 0) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (+ (div (- |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) 4) |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (forall ((v_ArrVal_7453 (Array Int Int)) (v_ArrVal_7450 Int) (v_ArrVal_7455 (Array Int Int)) (v_ArrVal_7454 (Array Int Int)) (~M~0 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908| Int) (v_ArrVal_7452 Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908|)) (< 0 ~M~0) (< ~M~0 0) (< 0 (+ 9223372039002259456 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse1 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7450) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_908| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7452)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7453) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7454) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7455) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-11-03 03:52:01,322 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((v_ArrVal_7453 (Array Int Int)) (v_ArrVal_7455 (Array Int Int)) (v_ArrVal_7454 (Array Int Int)) (~M~0 Int) (v_ArrVal_7452 Int)) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse0 .cse1 v_ArrVal_7452)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7453) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7454) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7455) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< 0 ~M~0) (< ~M~0 0))) (<= 5 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648)) (<= .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse0 0) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (not (= .cse1 0)) (<= .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-11-03 03:52:03,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:52:03,326 INFO L93 Difference]: Finished difference Result 16203 states and 78035 transitions. [2022-11-03 03:52:03,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 03:52:03,327 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 03:52:03,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:52:03,391 INFO L225 Difference]: With dead ends: 16203 [2022-11-03 03:52:03,391 INFO L226 Difference]: Without dead ends: 16203 [2022-11-03 03:52:03,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=327, Invalid=2154, Unknown=13, NotChecked=1166, Total=3660 [2022-11-03 03:52:03,392 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 220 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 2094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1044 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:52:03,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 101 Invalid, 2094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1024 Invalid, 0 Unknown, 1044 Unchecked, 0.9s Time] [2022-11-03 03:52:03,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16203 states. [2022-11-03 03:52:03,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16203 to 13655. [2022-11-03 03:52:03,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13655 states, 13620 states have (on average 5.012481644640235) internal successors, (68270), 13654 states have internal predecessors, (68270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:52:03,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13655 states to 13655 states and 68270 transitions. [2022-11-03 03:52:03,763 INFO L78 Accepts]: Start accepts. Automaton has 13655 states and 68270 transitions. Word has length 18 [2022-11-03 03:52:03,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:52:03,763 INFO L495 AbstractCegarLoop]: Abstraction has 13655 states and 68270 transitions. [2022-11-03 03:52:03,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:52:03,763 INFO L276 IsEmpty]: Start isEmpty. Operand 13655 states and 68270 transitions. [2022-11-03 03:52:03,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 03:52:03,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:52:03,766 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:52:03,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Ended with exit code 0 [2022-11-03 03:52:03,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137,128 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:52:03,967 INFO L420 AbstractCegarLoop]: === Iteration 139 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:52:03,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:52:03,967 INFO L85 PathProgramCache]: Analyzing trace with hash -631597052, now seen corresponding path program 2 times [2022-11-03 03:52:03,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:52:03,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106115408] [2022-11-03 03:52:03,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:52:03,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:52:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:52:05,763 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-03 03:52:05,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:52:05,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106115408] [2022-11-03 03:52:05,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106115408] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:52:05,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449007989] [2022-11-03 03:52:05,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:52:05,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:52:05,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:52:05,766 INFO L229 MonitoredProcess]: Starting monitored process 129 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:52:05,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2022-11-03 03:52:06,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 03:52:06,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:52:06,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-03 03:52:06,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:52:06,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:52:06,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 30 [2022-11-03 03:52:06,900 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:52:06,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 47 [2022-11-03 03:52:06,999 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:52:06,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 59 treesize of output 64 [2022-11-03 03:52:07,094 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:52:07,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 73 treesize of output 81 [2022-11-03 03:52:07,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:52:07,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 77 treesize of output 71 [2022-11-03 03:52:07,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:52:07,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 77 treesize of output 71 [2022-11-03 03:52:07,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:52:07,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 77 treesize of output 71 [2022-11-03 03:52:07,913 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-03 03:52:07,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:52:09,479 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:52:09,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 87 [2022-11-03 03:52:09,515 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:52:09,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 399 treesize of output 407 [2022-11-03 03:52:09,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 314 treesize of output 266 [2022-11-03 03:52:09,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 133 treesize of output 121 [2022-11-03 03:52:09,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 254 treesize of output 230 [2022-11-03 03:52:10,153 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-03 03:52:10,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449007989] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:52:10,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [385148405] [2022-11-03 03:52:10,154 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-03 03:52:10,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:52:10,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2022-11-03 03:52:10,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661545073] [2022-11-03 03:52:10,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:52:10,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-03 03:52:10,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:52:10,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-03 03:52:10,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1411, Unknown=34, NotChecked=0, Total=1640 [2022-11-03 03:52:10,156 INFO L87 Difference]: Start difference. First operand 13655 states and 68270 transitions. Second operand has 41 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:52:13,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:52:13,191 INFO L93 Difference]: Finished difference Result 14498 states and 71440 transitions. [2022-11-03 03:52:13,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 03:52:13,192 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 03:52:13,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:52:13,250 INFO L225 Difference]: With dead ends: 14498 [2022-11-03 03:52:13,250 INFO L226 Difference]: Without dead ends: 14498 [2022-11-03 03:52:13,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=414, Invalid=2951, Unknown=57, NotChecked=0, Total=3422 [2022-11-03 03:52:13,251 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 46 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 477 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:52:13,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 157 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 267 Invalid, 0 Unknown, 477 Unchecked, 0.3s Time] [2022-11-03 03:52:13,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14498 states. [2022-11-03 03:52:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14498 to 13749. [2022-11-03 03:52:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13749 states, 13714 states have (on average 5.0141461280443345) internal successors, (68764), 13748 states have internal predecessors, (68764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:52:13,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13749 states to 13749 states and 68764 transitions. [2022-11-03 03:52:13,597 INFO L78 Accepts]: Start accepts. Automaton has 13749 states and 68764 transitions. Word has length 18 [2022-11-03 03:52:13,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:52:13,597 INFO L495 AbstractCegarLoop]: Abstraction has 13749 states and 68764 transitions. [2022-11-03 03:52:13,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:52:13,598 INFO L276 IsEmpty]: Start isEmpty. Operand 13749 states and 68764 transitions. [2022-11-03 03:52:13,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 03:52:13,601 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:52:13,601 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:52:13,636 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Ended with exit code 0 [2022-11-03 03:52:13,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 129 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable138 [2022-11-03 03:52:13,827 INFO L420 AbstractCegarLoop]: === Iteration 140 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:52:13,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:52:13,827 INFO L85 PathProgramCache]: Analyzing trace with hash -631598912, now seen corresponding path program 2 times [2022-11-03 03:52:13,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:52:13,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282484327] [2022-11-03 03:52:13,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:52:13,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:52:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:52:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:52:14,654 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:52:14,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282484327] [2022-11-03 03:52:14,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282484327] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:52:14,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103755667] [2022-11-03 03:52:14,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:52:14,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:52:14,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:52:14,656 INFO L229 MonitoredProcess]: Starting monitored process 130 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:52:14,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2022-11-03 03:52:15,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 03:52:15,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:52:15,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-03 03:52:15,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:52:15,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:52:15,528 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-03 03:52:15,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:52:15,586 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-03 03:52:15,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:52:15,647 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-03 03:52:15,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:52:15,718 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-03 03:52:15,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:52:15,774 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 03:52:15,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 [2022-11-03 03:52:15,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:52:15,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:52:15,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:52:15,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:52:15,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:52:15,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:52:16,106 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:52:16,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:52:16,474 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_~i~3#1| Int)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((v_ArrVal_7607 Int) (~M~0 Int) (v_ArrVal_7610 (Array Int Int)) (v_ArrVal_7611 (Array Int Int)) (v_ArrVal_7609 (Array Int Int))) (or (< 0 ~M~0) (< ~M~0 0) (< 0 (+ (select (select (store (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|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7607)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7609) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7610) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7611) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))))) is different from false [2022-11-03 03:52:16,496 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7607 Int) (~M~0 Int) (v_ArrVal_7610 (Array Int Int)) (v_ArrVal_7606 Int) (v_ArrVal_7611 (Array Int Int)) (v_ArrVal_7609 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| Int)) (or (< 0 ~M~0) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~M~0 0) (< 0 (+ 9223372039002259456 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (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~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7606) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7607)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7609) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7610) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7611) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) is different from false [2022-11-03 03:52:16,524 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7607 Int) (v_ArrVal_7604 Int) (~M~0 Int) (v_ArrVal_7610 (Array Int Int)) (v_ArrVal_7606 Int) (v_ArrVal_7611 (Array Int Int)) (v_ArrVal_7609 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_933| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| Int)) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (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~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7604) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_933| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7606) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7607)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7609) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7610) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7611) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< 0 ~M~0) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~M~0 0) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_933|)))) is different from false [2022-11-03 03:52:16,559 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7607 Int) (v_ArrVal_7604 Int) (~M~0 Int) (v_ArrVal_7610 (Array Int Int)) (v_ArrVal_7606 Int) (v_ArrVal_7611 (Array Int Int)) (v_ArrVal_7601 Int) (v_ArrVal_7609 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_934| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_933| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_934|)) (< 0 ~M~0) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~M~0 0) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_934| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_933|)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (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~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7601) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_934| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7604) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_933| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7606) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7607)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7609) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7610) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7611) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) is different from false [2022-11-03 03:52:16,606 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7607 Int) (v_ArrVal_7604 Int) (v_ArrVal_7606 Int) (v_ArrVal_7601 Int) (v_ArrVal_7599 Int) (~M~0 Int) (v_ArrVal_7610 (Array Int Int)) (v_ArrVal_7611 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_935| Int) (v_ArrVal_7609 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_934| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_933| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| Int)) (or (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_935| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_934|)) (< 0 ~M~0) (< ~M~0 0) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (store (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~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7599) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_935| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7601) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_934| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7604) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_933| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7606) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7607)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7609) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7610) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7611) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_934| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_933|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_935|)))) is different from false [2022-11-03 03:52:16,791 INFO L356 Elim1Store]: treesize reduction 549, result has 16.6 percent of original size [2022-11-03 03:52:16,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 case distinctions, treesize of input 69 treesize of output 131 [2022-11-03 03:52:16,881 INFO L356 Elim1Store]: treesize reduction 120, result has 33.7 percent of original size [2022-11-03 03:52:16,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 767 treesize of output 755 [2022-11-03 03:52:16,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 638 treesize of output 590 [2022-11-03 03:52:16,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 295 treesize of output 271 [2022-11-03 03:52:16,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 566 treesize of output 470 [2022-11-03 03:52:17,350 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 20 not checked. [2022-11-03 03:52:17,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103755667] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:52:17,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [187519612] [2022-11-03 03:52:17,351 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java: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-03 03:52:17,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:52:17,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2022-11-03 03:52:17,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529714425] [2022-11-03 03:52:17,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:52:17,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-03 03:52:17,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:52:17,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-03 03:52:17,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1119, Unknown=8, NotChecked=360, Total=1640 [2022-11-03 03:52:17,354 INFO L87 Difference]: Start difference. First operand 13749 states and 68764 transitions. Second operand has 41 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:52:18,700 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 (+ (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse1 0) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (+ (div (- |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) 1) |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (forall ((v_ArrVal_7607 Int) (v_ArrVal_7604 Int) (v_ArrVal_7606 Int) (v_ArrVal_7601 Int) (v_ArrVal_7599 Int) (~M~0 Int) (v_ArrVal_7610 (Array Int Int)) (v_ArrVal_7611 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_935| Int) (v_ArrVal_7609 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_934| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_933| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| Int)) (or (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_935| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_934|)) (< 0 ~M~0) (< ~M~0 0) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (store (store .cse1 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7599) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_935| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7601) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_934| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7604) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_933| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7606) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7607)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7609) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7610) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7611) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_934| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_933|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_935|)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-11-03 03:52:19,771 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ (div (- |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) 2) |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 (+ (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_7607 Int) (v_ArrVal_7604 Int) (~M~0 Int) (v_ArrVal_7610 (Array Int Int)) (v_ArrVal_7606 Int) (v_ArrVal_7611 (Array Int Int)) (v_ArrVal_7601 Int) (v_ArrVal_7609 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_934| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_933| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_934|)) (< 0 ~M~0) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~M~0 0) (not (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_934| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_933|)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (store .cse1 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7601) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_934| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7604) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_933| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7606) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7607)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7609) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7610) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7611) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) (<= 0 (+ (select .cse1 0) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-11-03 03:52:20,997 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ (div (- |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) 3) |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= 0 (+ (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_7607 Int) (v_ArrVal_7604 Int) (~M~0 Int) (v_ArrVal_7610 (Array Int Int)) (v_ArrVal_7606 Int) (v_ArrVal_7611 (Array Int Int)) (v_ArrVal_7609 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_933| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| Int)) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store .cse1 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7604) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_933| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7606) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7607)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7609) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7610) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7611) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< 0 ~M~0) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~M~0 0) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_933|)))) (<= 0 (+ (select .cse1 0) 2147483648)) (<= 3 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-11-03 03:52:21,800 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 (+ (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse1 0) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((v_ArrVal_7607 Int) (~M~0 Int) (v_ArrVal_7610 (Array Int Int)) (v_ArrVal_7606 Int) (v_ArrVal_7611 (Array Int Int)) (v_ArrVal_7609 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| Int)) (or (< 0 ~M~0) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~M~0 0) (< 0 (+ 9223372039002259456 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse1 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7606) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_932| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7607)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7609) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7610) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7611) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (+ (div (- |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) 4) |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-11-03 03:52:23,804 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (forall ((|ULTIMATE.start_create_fresh_int_array_~i~3#1| Int)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((v_ArrVal_7607 Int) (~M~0 Int) (v_ArrVal_7610 (Array Int Int)) (v_ArrVal_7611 (Array Int Int)) (v_ArrVal_7609 (Array Int Int))) (or (< 0 ~M~0) (< ~M~0 0) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse0 (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_7607)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_7609) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7610) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7611) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))))) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648)) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse0 0) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (not (= (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0)) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-11-03 03:52:26,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:52:26,950 INFO L93 Difference]: Finished difference Result 17718 states and 82001 transitions. [2022-11-03 03:52:26,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-03 03:52:26,952 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 03:52:26,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:52:27,022 INFO L225 Difference]: With dead ends: 17718 [2022-11-03 03:52:27,022 INFO L226 Difference]: Without dead ends: 17718 [2022-11-03 03:52:27,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 10 IntricatePredicates, 2 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=525, Invalid=2363, Unknown=14, NotChecked=1130, Total=4032 [2022-11-03 03:52:27,023 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 509 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 2747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1132 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:52:27,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 134 Invalid, 2747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1544 Invalid, 0 Unknown, 1132 Unchecked, 1.5s Time] [2022-11-03 03:52:27,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17718 states. [2022-11-03 03:52:27,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17718 to 13835. [2022-11-03 03:52:27,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13835 states, 13800 states have (on average 5.023260869565218) internal successors, (69321), 13834 states have internal predecessors, (69321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:52:27,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13835 states to 13835 states and 69321 transitions. [2022-11-03 03:52:27,427 INFO L78 Accepts]: Start accepts. Automaton has 13835 states and 69321 transitions. Word has length 18 [2022-11-03 03:52:27,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:52:27,427 INFO L495 AbstractCegarLoop]: Abstraction has 13835 states and 69321 transitions. [2022-11-03 03:52:27,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:52:27,428 INFO L276 IsEmpty]: Start isEmpty. Operand 13835 states and 69321 transitions. [2022-11-03 03:52:27,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 03:52:27,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:52:27,431 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:52:27,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Ended with exit code 0 [2022-11-03 03:52:27,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 130 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable139 [2022-11-03 03:52:27,632 INFO L420 AbstractCegarLoop]: === Iteration 141 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:52:27,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:52:27,632 INFO L85 PathProgramCache]: Analyzing trace with hash -842714152, now seen corresponding path program 1 times [2022-11-03 03:52:27,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:52:27,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028146331] [2022-11-03 03:52:27,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:52:27,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:52:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:52:30,117 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-03 03:52:30,117 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:52:30,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028146331] [2022-11-03 03:52:30,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028146331] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:52:30,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779103393] [2022-11-03 03:52:30,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:52:30,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:52:30,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:52:30,119 INFO L229 MonitoredProcess]: Starting monitored process 131 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:52:30,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process [2022-11-03 03:52:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:52:30,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-03 03:52:30,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:52:30,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:52:31,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:52:31,113 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-03 03:52:31,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2022-11-03 03:52:31,195 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:52:31,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 45 treesize of output 50 [2022-11-03 03:52:31,298 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:52:31,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 56 treesize of output 64 [2022-11-03 03:52:31,402 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:52:31,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 67 treesize of output 78 [2022-11-03 03:52:31,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:52:31,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 71 treesize of output 63 [2022-11-03 03:52:31,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:52:31,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 71 treesize of output 63 [2022-11-03 03:52:31,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:52:31,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 71 treesize of output 63 [2022-11-03 03:52:32,122 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-03 03:52:32,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:52:32,275 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_7690 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7690) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 9223372039002259456))) (not (< c_~M~0 c_~N~0))) is different from false [2022-11-03 03:52:32,288 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~M~0 c_~N~0)) (forall ((v_ArrVal_7689 (Array Int Int)) (v_ArrVal_7690 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7689) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7690) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 9223372039002259456)))) is different from false [2022-11-03 03:52:33,322 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:52:33,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 case distinctions, treesize of input 74 treesize of output 100 [2022-11-03 03:52:33,474 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:52:33,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1433 treesize of output 1398 [2022-11-03 03:52:33,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1286 treesize of output 1094 [2022-11-03 03:52:33,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1094 treesize of output 1046 [2022-11-03 03:52:33,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1046 treesize of output 950 [2022-11-03 03:52:33,656 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-03 03:52:35,373 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-03 03:52:35,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779103393] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:52:35,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [23893774] [2022-11-03 03:52:35,374 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-03 03:52:35,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:52:35,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 35 [2022-11-03 03:52:35,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809767366] [2022-11-03 03:52:35,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:52:35,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 03:52:35,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:52:35,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 03:52:35,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1001, Unknown=17, NotChecked=134, Total=1332 [2022-11-03 03:52:35,377 INFO L87 Difference]: Start difference. First operand 13835 states and 69321 transitions. Second operand has 37 states, 36 states have (on average 1.5) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:52:39,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:52:39,593 INFO L93 Difference]: Finished difference Result 19937 states and 98399 transitions. [2022-11-03 03:52:39,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 03:52:39,593 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.5) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 03:52:39,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:52:39,679 INFO L225 Difference]: With dead ends: 19937 [2022-11-03 03:52:39,679 INFO L226 Difference]: Without dead ends: 19878 [2022-11-03 03:52:39,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=415, Invalid=2106, Unknown=37, NotChecked=198, Total=2756 [2022-11-03 03:52:39,680 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 167 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 319 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:52:39,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 90 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 619 Invalid, 0 Unknown, 319 Unchecked, 0.9s Time] [2022-11-03 03:52:39,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19878 states. [2022-11-03 03:52:40,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19878 to 12524. [2022-11-03 03:52:40,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12524 states, 12489 states have (on average 4.931379614060373) internal successors, (61588), 12523 states have internal predecessors, (61588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:52:40,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12524 states to 12524 states and 61588 transitions. [2022-11-03 03:52:40,130 INFO L78 Accepts]: Start accepts. Automaton has 12524 states and 61588 transitions. Word has length 18 [2022-11-03 03:52:40,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:52:40,131 INFO L495 AbstractCegarLoop]: Abstraction has 12524 states and 61588 transitions. [2022-11-03 03:52:40,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.5) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:52:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 12524 states and 61588 transitions. [2022-11-03 03:52:40,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 03:52:40,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:52:40,134 INFO L195 NwaCegarLoop]: trace histogram [8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:52:40,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Forceful destruction successful, exit code 0 [2022-11-03 03:52:40,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140,131 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:52:40,335 INFO L420 AbstractCegarLoop]: === Iteration 142 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:52:40,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:52:40,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1082456474, now seen corresponding path program 3 times [2022-11-03 03:52:40,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:52:40,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446454381] [2022-11-03 03:52:40,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:52:40,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:52:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:52:44,199 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:52:44,199 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:52:44,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446454381] [2022-11-03 03:52:44,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446454381] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:52:44,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999659673] [2022-11-03 03:52:44,199 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:52:44,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:52:44,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:52:44,200 INFO L229 MonitoredProcess]: Starting monitored process 132 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:52:44,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2022-11-03 03:52:45,046 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:52:45,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:52:45,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-03 03:52:45,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:52:45,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 16 [2022-11-03 03:52:45,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 03:52:45,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-11-03 03:52:45,335 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:52:45,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 47 [2022-11-03 03:52:45,517 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:52:45,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 64 [2022-11-03 03:52:45,618 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:52:45,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 58 treesize of output 66 [2022-11-03 03:52:45,721 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:52:45,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 80 [2022-11-03 03:52:45,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2022-11-03 03:52:45,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 73 treesize of output 65 [2022-11-03 03:52:46,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 73 treesize of output 65 [2022-11-03 03:52:46,564 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:52:46,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:52:46,841 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_7780 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7780) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0) 8)) 9223372039002259456))) (not (< (+ 2 c_~M~0) c_~N~0))) is different from false [2022-11-03 03:52:46,854 WARN L833 $PredicateComparison]: unable to prove that (or (not (< (+ 2 c_~M~0) c_~N~0)) (forall ((v_ArrVal_7779 (Array Int Int)) (v_ArrVal_7780 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7779) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7780) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0) 8)) 9223372039002259456)))) is different from false [2022-11-03 03:52:48,077 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:52:48,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 case distinctions, treesize of input 75 treesize of output 101 [2022-11-03 03:52:48,121 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:52:48,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 429 treesize of output 440 [2022-11-03 03:52:48,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 328 treesize of output 272 [2022-11-03 03:52:48,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 272 treesize of output 244 [2022-11-03 03:52:48,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 128 treesize of output 114 [2022-11-03 03:52:48,438 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-03 03:52:48,828 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:52:48,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999659673] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:52:48,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2056848255] [2022-11-03 03:52:48,829 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-03 03:52:48,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:52:48,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2022-11-03 03:52:48,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303388227] [2022-11-03 03:52:48,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:52:48,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-03 03:52:48,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:52:48,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-03 03:52:48,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1707, Unknown=17, NotChecked=174, Total=2162 [2022-11-03 03:52:48,832 INFO L87 Difference]: Start difference. First operand 12524 states and 61588 transitions. Second operand has 47 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:02,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:02,382 INFO L93 Difference]: Finished difference Result 21846 states and 103801 transitions. [2022-11-03 03:53:02,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-03 03:53:02,382 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 03:53:02,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:02,470 INFO L225 Difference]: With dead ends: 21846 [2022-11-03 03:53:02,470 INFO L226 Difference]: Without dead ends: 21846 [2022-11-03 03:53:02,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 80 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=942, Invalid=5350, Unknown=36, NotChecked=314, Total=6642 [2022-11-03 03:53:02,471 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 777 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 3903 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 5439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 3903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1426 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:02,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 515 Invalid, 5439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 3903 Invalid, 0 Unknown, 1426 Unchecked, 4.5s Time] [2022-11-03 03:53:02,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21846 states. [2022-11-03 03:53:02,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21846 to 16561. [2022-11-03 03:53:02,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16561 states, 16526 states have (on average 5.011739077816774) internal successors, (82824), 16560 states have internal predecessors, (82824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:03,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16561 states to 16561 states and 82824 transitions. [2022-11-03 03:53:03,170 INFO L78 Accepts]: Start accepts. Automaton has 16561 states and 82824 transitions. Word has length 19 [2022-11-03 03:53:03,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:03,170 INFO L495 AbstractCegarLoop]: Abstraction has 16561 states and 82824 transitions. [2022-11-03 03:53:03,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:03,171 INFO L276 IsEmpty]: Start isEmpty. Operand 16561 states and 82824 transitions. [2022-11-03 03:53:03,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 03:53:03,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:03,174 INFO L195 NwaCegarLoop]: trace histogram [8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:53:03,200 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Ended with exit code 0 [2022-11-03 03:53:03,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141,132 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:53:03,374 INFO L420 AbstractCegarLoop]: === Iteration 143 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:53:03,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:03,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1082456470, now seen corresponding path program 3 times [2022-11-03 03:53:03,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:03,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18837487] [2022-11-03 03:53:03,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:03,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:05,833 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:05,833 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:05,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18837487] [2022-11-03 03:53:05,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18837487] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:53:05,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432424186] [2022-11-03 03:53:05,834 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:53:05,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:53:05,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:53:05,835 INFO L229 MonitoredProcess]: Starting monitored process 133 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:53:05,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2022-11-03 03:53:06,718 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:53:06,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:53:06,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-03 03:53:06,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:53:06,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 16 [2022-11-03 03:53:06,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 03:53:06,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-03 03:53:06,998 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:53:06,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-03 03:53:07,085 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:53:07,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2022-11-03 03:53:07,175 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:53:07,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 50 treesize of output 58 [2022-11-03 03:53:07,278 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:53:07,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 70 [2022-11-03 03:53:07,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 53 [2022-11-03 03:53:07,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 61 treesize of output 53 [2022-11-03 03:53:07,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 61 treesize of output 53 [2022-11-03 03:53:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:08,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:53:09,712 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:53:09,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 case distinctions, treesize of input 73 treesize of output 99 [2022-11-03 03:53:09,753 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:53:09,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 385 treesize of output 396 [2022-11-03 03:53:09,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 296 treesize of output 240 [2022-11-03 03:53:09,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 126 treesize of output 112 [2022-11-03 03:53:09,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 226 treesize of output 198 [2022-11-03 03:53:10,112 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-03 03:53:10,543 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:10,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432424186] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:53:10,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [830614987] [2022-11-03 03:53:10,544 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-03 03:53:10,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:53:10,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2022-11-03 03:53:10,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435260536] [2022-11-03 03:53:10,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:53:10,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-03 03:53:10,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:10,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-03 03:53:10,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1957, Unknown=23, NotChecked=0, Total=2162 [2022-11-03 03:53:10,545 INFO L87 Difference]: Start difference. First operand 16561 states and 82824 transitions. Second operand has 47 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:16,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:16,736 INFO L93 Difference]: Finished difference Result 17651 states and 86811 transitions. [2022-11-03 03:53:16,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-03 03:53:16,737 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 03:53:16,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:16,803 INFO L225 Difference]: With dead ends: 17651 [2022-11-03 03:53:16,803 INFO L226 Difference]: Without dead ends: 17651 [2022-11-03 03:53:16,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=569, Invalid=5394, Unknown=43, NotChecked=0, Total=6006 [2022-11-03 03:53:16,804 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 123 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 367 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:16,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 472 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1027 Invalid, 0 Unknown, 367 Unchecked, 1.1s Time] [2022-11-03 03:53:16,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17651 states. [2022-11-03 03:53:17,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17651 to 16627. [2022-11-03 03:53:17,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16627 states, 16592 states have (on average 5.013922372227579) internal successors, (83191), 16626 states have internal predecessors, (83191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:17,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16627 states to 16627 states and 83191 transitions. [2022-11-03 03:53:17,193 INFO L78 Accepts]: Start accepts. Automaton has 16627 states and 83191 transitions. Word has length 19 [2022-11-03 03:53:17,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:17,193 INFO L495 AbstractCegarLoop]: Abstraction has 16627 states and 83191 transitions. [2022-11-03 03:53:17,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:17,193 INFO L276 IsEmpty]: Start isEmpty. Operand 16627 states and 83191 transitions. [2022-11-03 03:53:17,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 03:53:17,196 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:17,196 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:53:17,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Ended with exit code 0 [2022-11-03 03:53:17,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142,133 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:53:17,397 INFO L420 AbstractCegarLoop]: === Iteration 144 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:53:17,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:17,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1195223602, now seen corresponding path program 1 times [2022-11-03 03:53:17,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:17,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620042228] [2022-11-03 03:53:17,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:17,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:20,267 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:20,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620042228] [2022-11-03 03:53:20,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620042228] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:53:20,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595525186] [2022-11-03 03:53:20,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:20,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:53:20,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:53:20,269 INFO L229 MonitoredProcess]: Starting monitored process 134 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:53:20,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Waiting until timeout for monitored process [2022-11-03 03:53:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:21,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-03 03:53:21,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:53:21,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:53:21,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 30 [2022-11-03 03:53:21,304 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:53:21,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 47 [2022-11-03 03:53:21,396 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:53:21,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 59 treesize of output 64 [2022-11-03 03:53:21,500 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:53:21,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 58 treesize of output 66 [2022-11-03 03:53:21,616 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:53:21,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 69 treesize of output 80 [2022-11-03 03:53:21,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:53:21,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 73 treesize of output 65 [2022-11-03 03:53:21,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:53:21,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 73 treesize of output 65 [2022-11-03 03:53:22,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:53:22,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 73 treesize of output 65 [2022-11-03 03:53:22,453 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:22,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:53:22,677 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_7953 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7953) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0) 4)) 9223372039002259456))) (not (< (+ c_~M~0 1) c_~N~0))) is different from false [2022-11-03 03:53:22,695 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_7953 (Array Int Int)) (v_ArrVal_7952 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_7952) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_7953) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0) 4)) 9223372039002259456))) (not (< (+ c_~M~0 1) c_~N~0))) is different from false [2022-11-03 03:53:23,792 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:53:23,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 case distinctions, treesize of input 75 treesize of output 101 [2022-11-03 03:53:23,835 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:53:23,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 785 treesize of output 778 [2022-11-03 03:53:23,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 666 treesize of output 554 [2022-11-03 03:53:23,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 291 treesize of output 263 [2022-11-03 03:53:23,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 526 treesize of output 470 [2022-11-03 03:53:24,472 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-03 03:53:24,746 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:24,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595525186] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:53:24,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [767449474] [2022-11-03 03:53:24,747 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-03 03:53:24,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:53:24,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2022-11-03 03:53:24,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114130937] [2022-11-03 03:53:24,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:53:24,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-03 03:53:24,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:24,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-03 03:53:24,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1271, Unknown=17, NotChecked=150, Total=1640 [2022-11-03 03:53:24,748 INFO L87 Difference]: Start difference. First operand 16627 states and 83191 transitions. Second operand has 41 states, 40 states have (on average 1.425) internal successors, (57), 40 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:30,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:30,615 INFO L93 Difference]: Finished difference Result 23931 states and 117760 transitions. [2022-11-03 03:53:30,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-03 03:53:30,615 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.425) internal successors, (57), 40 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 03:53:30,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:30,724 INFO L225 Difference]: With dead ends: 23931 [2022-11-03 03:53:30,724 INFO L226 Difference]: Without dead ends: 23887 [2022-11-03 03:53:30,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=523, Invalid=3108, Unknown=37, NotChecked=238, Total=3906 [2022-11-03 03:53:30,724 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 276 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 2531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1208 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:30,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 220 Invalid, 2531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1293 Invalid, 0 Unknown, 1208 Unchecked, 1.6s Time] [2022-11-03 03:53:30,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23887 states. [2022-11-03 03:53:31,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23887 to 15588. [2022-11-03 03:53:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15588 states, 15553 states have (on average 4.8851025525622065) internal successors, (75978), 15587 states have internal predecessors, (75978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:31,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15588 states to 15588 states and 75978 transitions. [2022-11-03 03:53:31,230 INFO L78 Accepts]: Start accepts. Automaton has 15588 states and 75978 transitions. Word has length 19 [2022-11-03 03:53:31,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:31,230 INFO L495 AbstractCegarLoop]: Abstraction has 15588 states and 75978 transitions. [2022-11-03 03:53:31,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.425) internal successors, (57), 40 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:31,230 INFO L276 IsEmpty]: Start isEmpty. Operand 15588 states and 75978 transitions. [2022-11-03 03:53:31,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 03:53:31,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:31,234 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2022-11-03 03:53:31,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Ended with exit code 0 [2022-11-03 03:53:31,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143,134 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:53:31,434 INFO L420 AbstractCegarLoop]: === Iteration 145 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:53:31,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:31,435 INFO L85 PathProgramCache]: Analyzing trace with hash -801226375, now seen corresponding path program 10 times [2022-11-03 03:53:31,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:31,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735724955] [2022-11-03 03:53:31,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:31,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:32,353 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:32,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:32,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735724955] [2022-11-03 03:53:32,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735724955] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:53:32,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54361893] [2022-11-03 03:53:32,354 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:53:32,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:53:32,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:53:32,355 INFO L229 MonitoredProcess]: Starting monitored process 135 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:53:32,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Waiting until timeout for monitored process [2022-11-03 03:53:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:33,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-03 03:53:33,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:53:33,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:53:33,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:53:33,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:53:33,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:53:33,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:53:33,832 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:33,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:53:34,189 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8021 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_8021) c_~A~0.base) (+ c_~A~0.offset 24)) 9223372039002259456))) is different from false [2022-11-03 03:53:34,198 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8020 (Array Int Int)) (v_ArrVal_8021 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_8020) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_8021) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-03 03:53:34,207 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:53:34,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:53:34,215 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:53:34,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 159 treesize of output 149 [2022-11-03 03:53:34,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 134 treesize of output 118 [2022-11-03 03:53:34,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:53:34,660 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-03 03:53:34,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54361893] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:53:34,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1438380270] [2022-11-03 03:53:34,661 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-03 03:53:34,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:53:34,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2022-11-03 03:53:34,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876010939] [2022-11-03 03:53:34,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:53:34,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-03 03:53:34,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:34,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-03 03:53:34,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2399, Unknown=2, NotChecked=198, Total=2756 [2022-11-03 03:53:34,663 INFO L87 Difference]: Start difference. First operand 15588 states and 75978 transitions. Second operand has 53 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:38,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:38,403 INFO L93 Difference]: Finished difference Result 16961 states and 80194 transitions. [2022-11-03 03:53:38,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 03:53:38,404 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 03:53:38,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:38,473 INFO L225 Difference]: With dead ends: 16961 [2022-11-03 03:53:38,473 INFO L226 Difference]: Without dead ends: 16961 [2022-11-03 03:53:38,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=325, Invalid=4373, Unknown=2, NotChecked=270, Total=4970 [2022-11-03 03:53:38,474 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 330 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 3271 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 3577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:38,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 344 Invalid, 3577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3271 Invalid, 0 Unknown, 241 Unchecked, 2.1s Time] [2022-11-03 03:53:38,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16961 states. [2022-11-03 03:53:38,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16961 to 15668. [2022-11-03 03:53:38,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15668 states, 15633 states have (on average 4.887609543913516) internal successors, (76408), 15667 states have internal predecessors, (76408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:39,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15668 states to 15668 states and 76408 transitions. [2022-11-03 03:53:39,048 INFO L78 Accepts]: Start accepts. Automaton has 15668 states and 76408 transitions. Word has length 19 [2022-11-03 03:53:39,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:39,049 INFO L495 AbstractCegarLoop]: Abstraction has 15668 states and 76408 transitions. [2022-11-03 03:53:39,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:39,049 INFO L276 IsEmpty]: Start isEmpty. Operand 15668 states and 76408 transitions. [2022-11-03 03:53:39,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 03:53:39,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:39,054 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2022-11-03 03:53:39,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Forceful destruction successful, exit code 0 [2022-11-03 03:53:39,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 135 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable144 [2022-11-03 03:53:39,283 INFO L420 AbstractCegarLoop]: === Iteration 146 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:53:39,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:39,284 INFO L85 PathProgramCache]: Analyzing trace with hash -801226379, now seen corresponding path program 8 times [2022-11-03 03:53:39,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:39,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259613773] [2022-11-03 03:53:39,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:39,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:39,975 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:39,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259613773] [2022-11-03 03:53:39,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259613773] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:53:39,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018074623] [2022-11-03 03:53:39,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:53:39,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:53:39,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:53:39,976 INFO L229 MonitoredProcess]: Starting monitored process 136 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:53:39,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Waiting until timeout for monitored process [2022-11-03 03:53:40,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-03 03:53:40,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:53:40,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-03 03:53:40,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:53:41,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:53:41,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:53:41,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:53:41,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:53:41,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:53:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:41,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:53:42,509 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:53:42,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:53:42,519 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:53:42,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:53:42,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:53:42,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:53:43,440 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:43,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018074623] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:53:43,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2014288483] [2022-11-03 03:53:43,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-03 03:53:43,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:53:43,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2022-11-03 03:53:43,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302413529] [2022-11-03 03:53:43,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:53:43,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-03 03:53:43,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:43,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-03 03:53:43,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=2482, Unknown=2, NotChecked=0, Total=2756 [2022-11-03 03:53:43,443 INFO L87 Difference]: Start difference. First operand 15668 states and 76408 transitions. Second operand has 53 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:45,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:45,051 INFO L93 Difference]: Finished difference Result 15682 states and 76449 transitions. [2022-11-03 03:53:45,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-03 03:53:45,052 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 03:53:45,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:45,116 INFO L225 Difference]: With dead ends: 15682 [2022-11-03 03:53:45,116 INFO L226 Difference]: Without dead ends: 15682 [2022-11-03 03:53:45,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=497, Invalid=4613, Unknown=2, NotChecked=0, Total=5112 [2022-11-03 03:53:45,117 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:45,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 89 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 374 Invalid, 0 Unknown, 129 Unchecked, 0.3s Time] [2022-11-03 03:53:45,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15682 states. [2022-11-03 03:53:45,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15682 to 15675. [2022-11-03 03:53:45,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15675 states, 15640 states have (on average 4.8868286445012785) internal successors, (76430), 15674 states have internal predecessors, (76430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:45,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15675 states to 15675 states and 76430 transitions. [2022-11-03 03:53:45,499 INFO L78 Accepts]: Start accepts. Automaton has 15675 states and 76430 transitions. Word has length 19 [2022-11-03 03:53:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:45,499 INFO L495 AbstractCegarLoop]: Abstraction has 15675 states and 76430 transitions. [2022-11-03 03:53:45,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:45,500 INFO L276 IsEmpty]: Start isEmpty. Operand 15675 states and 76430 transitions. [2022-11-03 03:53:45,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 03:53:45,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:45,503 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:53:45,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Ended with exit code 0 [2022-11-03 03:53:45,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145,136 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:53:45,707 INFO L420 AbstractCegarLoop]: === Iteration 147 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:53:45,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:45,707 INFO L85 PathProgramCache]: Analyzing trace with hash -2143853508, now seen corresponding path program 9 times [2022-11-03 03:53:45,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:45,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640127434] [2022-11-03 03:53:45,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:45,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:46,315 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:46,316 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:46,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640127434] [2022-11-03 03:53:46,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640127434] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:53:46,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260159906] [2022-11-03 03:53:46,316 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:53:46,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:53:46,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:53:46,317 INFO L229 MonitoredProcess]: Starting monitored process 137 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:53:46,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process [2022-11-03 03:53:47,082 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:53:47,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:53:47,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-03 03:53:47,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:53:47,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:53:47,408 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 03:53:47,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:53:47,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:53:47,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:53:47,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:53:47,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:53:47,793 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:47,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:53:48,077 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8159 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_8159) c_~A~0.base) (+ c_~A~0.offset 20)) 4294967296)) is different from false [2022-11-03 03:53:48,085 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8158 (Array Int Int)) (v_ArrVal_8159 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_8158) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_8159) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 03:53:48,092 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8158 (Array Int Int)) (v_ArrVal_8159 (Array Int Int)) (v_ArrVal_8157 Int)) (< (select (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~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_8157)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_8158) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_8159) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 03:53:48,117 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-03 03:53:48,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 40 [2022-11-03 03:53:48,126 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:53:48,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:53:48,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:53:48,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:53:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-11-03 03:53:48,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260159906] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:53:48,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1831522743] [2022-11-03 03:53:48,500 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-03 03:53:48,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:53:48,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2022-11-03 03:53:48,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86850932] [2022-11-03 03:53:48,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:53:48,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-03 03:53:48,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:48,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-03 03:53:48,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2023, Unknown=3, NotChecked=276, Total=2450 [2022-11-03 03:53:48,502 INFO L87 Difference]: Start difference. First operand 15675 states and 76430 transitions. Second operand has 50 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:51,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:51,665 INFO L93 Difference]: Finished difference Result 16552 states and 79006 transitions. [2022-11-03 03:53:51,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-03 03:53:51,665 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 03:53:51,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:51,722 INFO L225 Difference]: With dead ends: 16552 [2022-11-03 03:53:51,722 INFO L226 Difference]: Without dead ends: 16552 [2022-11-03 03:53:51,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=324, Invalid=3591, Unknown=3, NotChecked=372, Total=4290 [2022-11-03 03:53:51,723 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 233 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 2426 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 336 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:51,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 275 Invalid, 2815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2426 Invalid, 0 Unknown, 336 Unchecked, 1.7s Time] [2022-11-03 03:53:51,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16552 states. [2022-11-03 03:53:52,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16552 to 15675. [2022-11-03 03:53:52,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15675 states, 15640 states have (on average 4.8826086956521735) internal successors, (76364), 15674 states have internal predecessors, (76364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:52,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15675 states to 15675 states and 76364 transitions. [2022-11-03 03:53:52,084 INFO L78 Accepts]: Start accepts. Automaton has 15675 states and 76364 transitions. Word has length 19 [2022-11-03 03:53:52,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:52,084 INFO L495 AbstractCegarLoop]: Abstraction has 15675 states and 76364 transitions. [2022-11-03 03:53:52,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:52,085 INFO L276 IsEmpty]: Start isEmpty. Operand 15675 states and 76364 transitions. [2022-11-03 03:53:52,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 03:53:52,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:52,088 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:53:52,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Forceful destruction successful, exit code 0 [2022-11-03 03:53:52,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 137 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93d20b01-338a-4747-9acc-05af57ebc4c3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable146 [2022-11-03 03:53:52,289 INFO L420 AbstractCegarLoop]: === Iteration 148 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-11-03 03:53:52,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:52,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1525585998, now seen corresponding path program 3 times [2022-11-03 03:53:52,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:52,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502852780] [2022-11-03 03:53:52,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:52,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat