./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/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_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/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_a8eb706d-40bf-4329-b0ff-33be53b6d603/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 7cd6aaa75855c8ee03a174376352b142cf57dd56532b968b1b6c916585172927 --- 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:37:40,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:37:40,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:37:40,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:37:40,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:37:40,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:37:40,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:37:40,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:37:40,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:37:40,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:37:40,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:37:40,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:37:40,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:37:40,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:37:40,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:37:40,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:37:40,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:37:40,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:37:40,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:37:40,531 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:37:40,532 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:37:40,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:37:40,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:37:40,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:37:40,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:37:40,552 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:37:40,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:37:40,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:37:40,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:37:40,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:37:40,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:37:40,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:37:40,560 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:37:40,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:37:40,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:37:40,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:37:40,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:37:40,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:37:40,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:37:40,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:37:40,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:37:40,565 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-03 03:37:40,605 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:37:40,606 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:37:40,606 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:37:40,606 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:37:40,607 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:37:40,607 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:37:40,607 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:37:40,607 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:37:40,607 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:37:40,608 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:37:40,608 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:37:40,608 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:37:40,608 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:37:40,608 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:37:40,609 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:37:40,609 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:37:40,609 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:37:40,609 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:37:40,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:37:40,610 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:37:40,610 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 03:37:40,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:37:40,611 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:37:40,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:37:40,611 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:37:40,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:37:40,611 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:37:40,611 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-03 03:37:40,612 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:37:40,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:37:40,612 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:37:40,612 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:37:40,612 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:37:40,612 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:37:40,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:37:40,613 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:37:40,614 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:37:40,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:37:40,614 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:37:40,614 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:37:40,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:37:40,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:37:40,615 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:37:40,615 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_a8eb706d-40bf-4329-b0ff-33be53b6d603/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_a8eb706d-40bf-4329-b0ff-33be53b6d603/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 -> 7cd6aaa75855c8ee03a174376352b142cf57dd56532b968b1b6c916585172927 [2022-11-03 03:37:40,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:37:40,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:37:40,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:37:40,969 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:37:40,970 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:37:40,971 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i [2022-11-03 03:37:41,048 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/data/16b87c093/4ce41ed4bf6b4e4f97676ac1547fe0b5/FLAGe8ae7d279 [2022-11-03 03:37:41,582 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:37:41,582 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i [2022-11-03 03:37:41,596 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/data/16b87c093/4ce41ed4bf6b4e4f97676ac1547fe0b5/FLAGe8ae7d279 [2022-11-03 03:37:41,890 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/data/16b87c093/4ce41ed4bf6b4e4f97676ac1547fe0b5 [2022-11-03 03:37:41,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:37:41,894 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:37:41,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:37:41,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:37:41,899 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:37:41,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:37:41" (1/1) ... [2022-11-03 03:37:41,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@231ba05f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:41, skipping insertion in model container [2022-11-03 03:37:41,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:37:41" (1/1) ... [2022-11-03 03:37:41,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:37:41,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:37:42,338 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_a8eb706d-40bf-4329-b0ff-33be53b6d603/sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i[30176,30189] [2022-11-03 03:37:42,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:37:42,378 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:37:42,431 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_a8eb706d-40bf-4329-b0ff-33be53b6d603/sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i[30176,30189] [2022-11-03 03:37:42,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:37:42,488 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:37:42,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:42 WrapperNode [2022-11-03 03:37:42,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:37:42,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:37:42,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:37:42,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:37:42,501 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:37:42" (1/1) ... [2022-11-03 03:37:42,542 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:37:42" (1/1) ... [2022-11-03 03:37:42,571 INFO L138 Inliner]: procedures = 170, calls = 37, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2022-11-03 03:37:42,573 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:37:42,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:37:42,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:37:42,575 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:37:42,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:42" (1/1) ... [2022-11-03 03:37:42,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:42" (1/1) ... [2022-11-03 03:37:42,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:42" (1/1) ... [2022-11-03 03:37:42,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:42" (1/1) ... [2022-11-03 03:37:42,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:42" (1/1) ... [2022-11-03 03:37:42,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:42" (1/1) ... [2022-11-03 03:37:42,627 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:42" (1/1) ... [2022-11-03 03:37:42,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:42" (1/1) ... [2022-11-03 03:37:42,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:37:42,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:37:42,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:37:42,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:37:42,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:42" (1/1) ... [2022-11-03 03:37:42,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:37:42,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:42,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:37:42,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:37:42,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 03:37:42,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 03:37:42,727 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-03 03:37:42,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:37:42,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:37:42,727 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-03 03:37:42,727 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-03 03:37:42,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:37:42,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:37:42,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:37:42,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:37:42,729 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:37:42,924 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:37:42,936 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:37:43,185 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:37:43,193 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:37:43,193 INFO L300 CfgBuilder]: Removed 10 assume(true) statements. [2022-11-03 03:37:43,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:37:43 BoogieIcfgContainer [2022-11-03 03:37:43,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:37:43,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:37:43,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:37:43,203 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:37:43,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:37:41" (1/3) ... [2022-11-03 03:37:43,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b63cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:37:43, skipping insertion in model container [2022-11-03 03:37:43,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:42" (2/3) ... [2022-11-03 03:37:43,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b63cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:37:43, skipping insertion in model container [2022-11-03 03:37:43,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:37:43" (3/3) ... [2022-11-03 03:37:43,206 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_12-ptr_racefree.i [2022-11-03 03:37:43,214 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 03:37:43,225 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:37:43,225 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-03 03:37:43,225 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 03:37:43,309 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-03 03:37:43,344 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 03:37:43,358 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 138 transitions, 284 flow [2022-11-03 03:37:43,361 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 138 transitions, 284 flow [2022-11-03 03:37:43,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 138 transitions, 284 flow [2022-11-03 03:37:43,427 INFO L130 PetriNetUnfolder]: 17/175 cut-off events. [2022-11-03 03:37:43,427 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-03 03:37:43,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 175 events. 17/175 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 415 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 87. Up to 4 conditions per place. [2022-11-03 03:37:43,436 INFO L118 LiptonReduction]: Number of co-enabled transitions 3854 [2022-11-03 03:37:47,953 INFO L133 LiptonReduction]: Checked pairs total: 5990 [2022-11-03 03:37:47,954 INFO L135 LiptonReduction]: Total number of compositions: 130 [2022-11-03 03:37:47,962 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 42 transitions, 92 flow [2022-11-03 03:37:47,990 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 220 states, 193 states have (on average 2.7409326424870466) internal successors, (529), 219 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:37:48,007 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:37:48,013 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;@6a2de4e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:37:48,013 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-03 03:37:48,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 220 states, 193 states have (on average 2.7409326424870466) internal successors, (529), 219 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:37:48,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 03:37:48,021 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:48,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 03:37:48,022 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2022-11-03 03:37:48,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:48,027 INFO L85 PathProgramCache]: Analyzing trace with hash 16304749, now seen corresponding path program 1 times [2022-11-03 03:37:48,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:48,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026786727] [2022-11-03 03:37:48,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:48,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:48,313 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:37:48,314 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:48,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026786727] [2022-11-03 03:37:48,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026786727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:37:48,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:37:48,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:37:48,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419440482] [2022-11-03 03:37:48,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:37:48,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:37:48,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:48,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:37:48,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:37:48,358 INFO L87 Difference]: Start difference. First operand has 220 states, 193 states have (on average 2.7409326424870466) internal successors, (529), 219 states have internal predecessors, (529), 0 states have call successors, (0), 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 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:37:48,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:48,481 INFO L93 Difference]: Finished difference Result 184 states and 333 transitions. [2022-11-03 03:37:48,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:37:48,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-03 03:37:48,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:48,493 INFO L225 Difference]: With dead ends: 184 [2022-11-03 03:37:48,493 INFO L226 Difference]: Without dead ends: 178 [2022-11-03 03:37:48,494 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:37:48,497 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:48,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 6 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:37:48,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-03 03:37:48,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2022-11-03 03:37:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 163 states have (on average 1.98159509202454) internal successors, (323), 177 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:37:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 323 transitions. [2022-11-03 03:37:48,541 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 323 transitions. Word has length 4 [2022-11-03 03:37:48,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:48,542 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 323 transitions. [2022-11-03 03:37:48,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:37:48,542 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 323 transitions. [2022-11-03 03:37:48,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 03:37:48,543 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:48,543 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2022-11-03 03:37:48,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:37:48,544 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2022-11-03 03:37:48,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:48,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1510989743, now seen corresponding path program 1 times [2022-11-03 03:37:48,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:48,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557558551] [2022-11-03 03:37:48,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:48,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:37:48,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 03:37:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:37:48,607 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 03:37:48,608 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 03:37:48,609 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2022-11-03 03:37:48,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2022-11-03 03:37:48,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2022-11-03 03:37:48,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2022-11-03 03:37:48,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2022-11-03 03:37:48,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2022-11-03 03:37:48,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2022-11-03 03:37:48,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2022-11-03 03:37:48,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2022-11-03 03:37:48,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2022-11-03 03:37:48,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2022-11-03 03:37:48,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2022-11-03 03:37:48,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2022-11-03 03:37:48,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:37:48,618 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-03 03:37:48,619 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-03 03:37:48,620 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-03 03:37:48,642 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-03 03:37:48,645 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 03:37:48,646 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 181 transitions, 380 flow [2022-11-03 03:37:48,646 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 181 transitions, 380 flow [2022-11-03 03:37:48,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 181 transitions, 380 flow [2022-11-03 03:37:48,705 INFO L130 PetriNetUnfolder]: 31/292 cut-off events. [2022-11-03 03:37:48,705 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-03 03:37:48,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 292 events. 31/292 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 904 event pairs, 0 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 177. Up to 8 conditions per place. [2022-11-03 03:37:48,718 INFO L118 LiptonReduction]: Number of co-enabled transitions 12628 [2022-11-03 03:37:53,722 INFO L133 LiptonReduction]: Checked pairs total: 27226 [2022-11-03 03:37:53,722 INFO L135 LiptonReduction]: Total number of compositions: 168 [2022-11-03 03:37:53,724 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 66 transitions, 150 flow [2022-11-03 03:37:53,866 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3981 states, 3814 states have (on average 3.7233875196643944) internal successors, (14201), 3980 states have internal predecessors, (14201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:37:53,867 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:37:53,868 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;@6a2de4e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:37:53,869 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-11-03 03:37:53,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 3981 states, 3814 states have (on average 3.7233875196643944) internal successors, (14201), 3980 states have internal predecessors, (14201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:37:53,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 03:37:53,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:53,883 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 03:37:53,883 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-03 03:37:53,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:53,884 INFO L85 PathProgramCache]: Analyzing trace with hash 879070290, now seen corresponding path program 1 times [2022-11-03 03:37:53,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:53,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70181580] [2022-11-03 03:37:53,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:53,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:53,943 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:37:53,943 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:53,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70181580] [2022-11-03 03:37:53,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70181580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:37:53,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:37:53,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:37:53,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849770969] [2022-11-03 03:37:53,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:37:53,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:37:53,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:53,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:37:53,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:37:53,959 INFO L87 Difference]: Start difference. First operand has 3981 states, 3814 states have (on average 3.7233875196643944) internal successors, (14201), 3980 states have internal predecessors, (14201), 0 states have call successors, (0), 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 2.5) internal successors, (5), 2 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:37:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:54,115 INFO L93 Difference]: Finished difference Result 3945 states and 10756 transitions. [2022-11-03 03:37:54,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:37:54,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:37:54,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:54,147 INFO L225 Difference]: With dead ends: 3945 [2022-11-03 03:37:54,147 INFO L226 Difference]: Without dead ends: 3919 [2022-11-03 03:37:54,147 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:37:54,149 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:54,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 16 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:37:54,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2022-11-03 03:37:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3919. [2022-11-03 03:37:54,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3919 states, 3766 states have (on average 2.8385554965480617) internal successors, (10690), 3918 states have internal predecessors, (10690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:37:54,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 10690 transitions. [2022-11-03 03:37:54,359 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 10690 transitions. Word has length 5 [2022-11-03 03:37:54,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:54,360 INFO L495 AbstractCegarLoop]: Abstraction has 3919 states and 10690 transitions. [2022-11-03 03:37:54,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:37:54,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 10690 transitions. [2022-11-03 03:37:54,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 03:37:54,361 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:54,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:54,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:37:54,362 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-03 03:37:54,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:54,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1315114137, now seen corresponding path program 1 times [2022-11-03 03:37:54,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:54,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94103168] [2022-11-03 03:37:54,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:54,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:37:54,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:54,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94103168] [2022-11-03 03:37:54,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94103168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:37:54,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:37:54,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:37:54,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677902223] [2022-11-03 03:37:54,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:37:54,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:37:54,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:54,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:37:54,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:37:54,551 INFO L87 Difference]: Start difference. First operand 3919 states and 10690 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:37:54,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:54,883 INFO L93 Difference]: Finished difference Result 5776 states and 15523 transitions. [2022-11-03 03:37:54,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:37:54,884 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:37:54,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:54,920 INFO L225 Difference]: With dead ends: 5776 [2022-11-03 03:37:54,920 INFO L226 Difference]: Without dead ends: 5776 [2022-11-03 03:37:54,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:37:54,927 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 136 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:54,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 42 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:37:54,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5776 states. [2022-11-03 03:37:55,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5776 to 4410. [2022-11-03 03:37:55,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4410 states, 4257 states have (on average 2.834625322997416) internal successors, (12067), 4409 states have internal predecessors, (12067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:37:55,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4410 states to 4410 states and 12067 transitions. [2022-11-03 03:37:55,179 INFO L78 Accepts]: Start accepts. Automaton has 4410 states and 12067 transitions. Word has length 7 [2022-11-03 03:37:55,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:55,179 INFO L495 AbstractCegarLoop]: Abstraction has 4410 states and 12067 transitions. [2022-11-03 03:37:55,180 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:37:55,180 INFO L276 IsEmpty]: Start isEmpty. Operand 4410 states and 12067 transitions. [2022-11-03 03:37:55,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:37:55,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:55,181 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-11-03 03:37:55,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 03:37:55,182 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-03 03:37:55,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:55,185 INFO L85 PathProgramCache]: Analyzing trace with hash 902395099, now seen corresponding path program 1 times [2022-11-03 03:37:55,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:55,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139457274] [2022-11-03 03:37:55,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:55,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:55,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:37:55,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:55,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139457274] [2022-11-03 03:37:55,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139457274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:37:55,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:37:55,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:37:55,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153929489] [2022-11-03 03:37:55,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:37:55,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:37:55,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:55,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:37:55,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:37:55,279 INFO L87 Difference]: Start difference. First operand 4410 states and 12067 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:37:55,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:55,462 INFO L93 Difference]: Finished difference Result 4133 states and 11268 transitions. [2022-11-03 03:37:55,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:37:55,463 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 9 [2022-11-03 03:37:55,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:55,490 INFO L225 Difference]: With dead ends: 4133 [2022-11-03 03:37:55,491 INFO L226 Difference]: Without dead ends: 4133 [2022-11-03 03:37:55,491 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:37:55,493 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:55,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 14 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:37:55,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4133 states. [2022-11-03 03:37:55,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4133 to 4133. [2022-11-03 03:37:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4133 states, 4005 states have (on average 2.8134831460674157) internal successors, (11268), 4132 states have internal predecessors, (11268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:37:55,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4133 states to 4133 states and 11268 transitions. [2022-11-03 03:37:55,615 INFO L78 Accepts]: Start accepts. Automaton has 4133 states and 11268 transitions. Word has length 9 [2022-11-03 03:37:55,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:55,616 INFO L495 AbstractCegarLoop]: Abstraction has 4133 states and 11268 transitions. [2022-11-03 03:37:55,616 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:37:55,617 INFO L276 IsEmpty]: Start isEmpty. Operand 4133 states and 11268 transitions. [2022-11-03 03:37:55,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:37:55,620 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:55,620 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-11-03 03:37:55,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 03:37:55,622 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-03 03:37:55,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:55,623 INFO L85 PathProgramCache]: Analyzing trace with hash 902395116, now seen corresponding path program 1 times [2022-11-03 03:37:55,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:55,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81268555] [2022-11-03 03:37:55,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:55,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:55,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:37:55,703 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:55,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81268555] [2022-11-03 03:37:55,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81268555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:37:55,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:37:55,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:37:55,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523453513] [2022-11-03 03:37:55,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:37:55,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:37:55,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:55,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:37:55,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:37:55,705 INFO L87 Difference]: Start difference. First operand 4133 states and 11268 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:37:55,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:55,783 INFO L93 Difference]: Finished difference Result 3856 states and 10469 transitions. [2022-11-03 03:37:55,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:37:55,784 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 9 [2022-11-03 03:37:55,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:55,821 INFO L225 Difference]: With dead ends: 3856 [2022-11-03 03:37:55,821 INFO L226 Difference]: Without dead ends: 3856 [2022-11-03 03:37:55,822 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:37:55,823 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:55,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 8 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:37:55,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3856 states. [2022-11-03 03:37:55,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3856 to 3856. [2022-11-03 03:37:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3856 states, 3753 states have (on average 2.7895017319477753) internal successors, (10469), 3855 states have internal predecessors, (10469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:37:55,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3856 states to 3856 states and 10469 transitions. [2022-11-03 03:37:55,982 INFO L78 Accepts]: Start accepts. Automaton has 3856 states and 10469 transitions. Word has length 9 [2022-11-03 03:37:55,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:55,983 INFO L495 AbstractCegarLoop]: Abstraction has 3856 states and 10469 transitions. [2022-11-03 03:37:55,983 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:37:55,983 INFO L276 IsEmpty]: Start isEmpty. Operand 3856 states and 10469 transitions. [2022-11-03 03:37:55,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 03:37:55,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:55,985 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:55,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 03:37:55,986 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-03 03:37:55,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:55,986 INFO L85 PathProgramCache]: Analyzing trace with hash 119644617, now seen corresponding path program 1 times [2022-11-03 03:37:55,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:55,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583365875] [2022-11-03 03:37:55,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:55,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:56,257 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:37:56,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:56,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583365875] [2022-11-03 03:37:56,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583365875] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:37:56,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158458430] [2022-11-03 03:37:56,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:56,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:56,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:56,264 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:37:56,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 03:37:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:56,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-03 03:37:56,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:37:56,471 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 03:37:56,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 03:37:56,505 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:37:56,717 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:37:56,735 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:37:56,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:37:56,776 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_56 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_56) c_t_funThread1of2ForFork0_~p~0.base) c_t_funThread1of2ForFork0_~p~0.offset) 2147483650))) is different from false [2022-11-03 03:37:56,824 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_56 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_56) |c_~#global~0.base|) |c_~#global~0.offset|)))) is different from false [2022-11-03 03:37:56,833 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:37:56,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158458430] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:37:56,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1352608893] [2022-11-03 03:37:56,839 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:37:56,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:37:56,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-11-03 03:37:56,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429418760] [2022-11-03 03:37:56,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:37:56,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 03:37:56,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:56,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 03:37:56,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=53, Unknown=2, NotChecked=30, Total=110 [2022-11-03 03:37:56,845 INFO L87 Difference]: Start difference. First operand 3856 states and 10469 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 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:37:57,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:57,374 INFO L93 Difference]: Finished difference Result 5401 states and 14828 transitions. [2022-11-03 03:37:57,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:37:57,375 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 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:37:57,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:57,395 INFO L225 Difference]: With dead ends: 5401 [2022-11-03 03:37:57,395 INFO L226 Difference]: Without dead ends: 5401 [2022-11-03 03:37:57,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=93, Unknown=2, NotChecked=42, Total=182 [2022-11-03 03:37:57,400 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 134 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 240 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:57,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 109 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 484 Invalid, 0 Unknown, 240 Unchecked, 0.4s Time] [2022-11-03 03:37:57,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5401 states. [2022-11-03 03:37:57,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5401 to 3791. [2022-11-03 03:37:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3791 states, 3700 states have (on average 2.7935135135135134) internal successors, (10336), 3790 states have internal predecessors, (10336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:37:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3791 states to 3791 states and 10336 transitions. [2022-11-03 03:37:57,537 INFO L78 Accepts]: Start accepts. Automaton has 3791 states and 10336 transitions. Word has length 10 [2022-11-03 03:37:57,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:57,537 INFO L495 AbstractCegarLoop]: Abstraction has 3791 states and 10336 transitions. [2022-11-03 03:37:57,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 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:37:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3791 states and 10336 transitions. [2022-11-03 03:37:57,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:37:57,543 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:57,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:57,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:37:57,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-03 03:37:57,765 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-03 03:37:57,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:57,765 INFO L85 PathProgramCache]: Analyzing trace with hash -411786492, now seen corresponding path program 1 times [2022-11-03 03:37:57,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:57,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040398358] [2022-11-03 03:37:57,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:57,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:57,928 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:37:57,929 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:57,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040398358] [2022-11-03 03:37:57,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040398358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:37:57,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:37:57,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:37:57,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104904992] [2022-11-03 03:37:57,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:37:57,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 03:37:57,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:57,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 03:37:57,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:37:57,931 INFO L87 Difference]: Start difference. First operand 3791 states and 10336 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:37:58,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:58,749 INFO L93 Difference]: Finished difference Result 7516 states and 20322 transitions. [2022-11-03 03:37:58,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 03:37:58,750 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 03:37:58,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:58,783 INFO L225 Difference]: With dead ends: 7516 [2022-11-03 03:37:58,783 INFO L226 Difference]: Without dead ends: 7516 [2022-11-03 03:37:58,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-03 03:37:58,785 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 270 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:58,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 160 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 03:37:58,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7516 states. [2022-11-03 03:37:58,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7516 to 4839. [2022-11-03 03:37:58,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4839 states, 4748 states have (on average 2.846040438079191) internal successors, (13513), 4838 states have internal predecessors, (13513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:37:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4839 states to 4839 states and 13513 transitions. [2022-11-03 03:37:58,983 INFO L78 Accepts]: Start accepts. Automaton has 4839 states and 13513 transitions. Word has length 11 [2022-11-03 03:37:58,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:58,983 INFO L495 AbstractCegarLoop]: Abstraction has 4839 states and 13513 transitions. [2022-11-03 03:37:58,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:37:58,984 INFO L276 IsEmpty]: Start isEmpty. Operand 4839 states and 13513 transitions. [2022-11-03 03:37:58,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:37:58,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:58,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:58,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 03:37:58,985 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-03 03:37:58,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:58,985 INFO L85 PathProgramCache]: Analyzing trace with hash -411786530, now seen corresponding path program 1 times [2022-11-03 03:37:58,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:58,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804092674] [2022-11-03 03:37:58,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:58,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:59,068 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:37:59,068 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:59,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804092674] [2022-11-03 03:37:59,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804092674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:37:59,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:37:59,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:37:59,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761830480] [2022-11-03 03:37:59,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:37:59,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:37:59,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:59,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:37:59,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:37:59,070 INFO L87 Difference]: Start difference. First operand 4839 states and 13513 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:37:59,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:59,246 INFO L93 Difference]: Finished difference Result 5774 states and 15983 transitions. [2022-11-03 03:37:59,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:37:59,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 03:37:59,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:59,266 INFO L225 Difference]: With dead ends: 5774 [2022-11-03 03:37:59,266 INFO L226 Difference]: Without dead ends: 5742 [2022-11-03 03:37:59,266 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:37:59,268 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 30 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:59,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 22 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:37:59,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5742 states. [2022-11-03 03:37:59,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5742 to 5400. [2022-11-03 03:37:59,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5400 states, 5309 states have (on average 2.845733659822942) internal successors, (15108), 5399 states have internal predecessors, (15108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:37:59,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5400 states to 5400 states and 15108 transitions. [2022-11-03 03:37:59,407 INFO L78 Accepts]: Start accepts. Automaton has 5400 states and 15108 transitions. Word has length 11 [2022-11-03 03:37:59,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:59,408 INFO L495 AbstractCegarLoop]: Abstraction has 5400 states and 15108 transitions. [2022-11-03 03:37:59,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:37:59,408 INFO L276 IsEmpty]: Start isEmpty. Operand 5400 states and 15108 transitions. [2022-11-03 03:37:59,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:37:59,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:59,410 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:59,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 03:37:59,410 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-03 03:37:59,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:59,411 INFO L85 PathProgramCache]: Analyzing trace with hash -372981648, now seen corresponding path program 1 times [2022-11-03 03:37:59,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:59,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338036650] [2022-11-03 03:37:59,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:59,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:59,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:37:59,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:59,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338036650] [2022-11-03 03:37:59,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338036650] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:37:59,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675141797] [2022-11-03 03:37:59,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:59,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:59,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:59,585 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:37:59,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 03:37:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:59,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-03 03:37:59,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:37:59,715 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 03:37:59,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 03:37:59,740 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:37:59,784 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:37:59,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:37:59,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:37:59,864 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_106 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_106) |c_~#global~0.base|) |c_~#global~0.offset|) 2147483647)) is different from false [2022-11-03 03:37:59,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-11-03 03:37:59,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675141797] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:37:59,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1604842878] [2022-11-03 03:37:59,879 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:37:59,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:37:59,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-11-03 03:37:59,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29810610] [2022-11-03 03:37:59,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:37:59,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 03:37:59,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:59,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 03:37:59,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2022-11-03 03:37:59,882 INFO L87 Difference]: Start difference. First operand 5400 states and 15108 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 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:38:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:38:00,472 INFO L93 Difference]: Finished difference Result 7808 states and 21060 transitions. [2022-11-03 03:38:00,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:38:00,472 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 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:38:00,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:38:00,500 INFO L225 Difference]: With dead ends: 7808 [2022-11-03 03:38:00,500 INFO L226 Difference]: Without dead ends: 7808 [2022-11-03 03:38:00,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=165, Unknown=1, NotChecked=28, Total=272 [2022-11-03 03:38:00,501 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 253 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:38:00,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 99 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 522 Invalid, 0 Unknown, 172 Unchecked, 0.4s Time] [2022-11-03 03:38:00,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7808 states. [2022-11-03 03:38:00,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7808 to 5492. [2022-11-03 03:38:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5492 states, 5401 states have (on average 2.834104795408258) internal successors, (15307), 5491 states have internal predecessors, (15307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:38:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5492 states to 5492 states and 15307 transitions. [2022-11-03 03:38:00,686 INFO L78 Accepts]: Start accepts. Automaton has 5492 states and 15307 transitions. Word has length 11 [2022-11-03 03:38:00,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:38:00,687 INFO L495 AbstractCegarLoop]: Abstraction has 5492 states and 15307 transitions. [2022-11-03 03:38:00,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 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:38:00,687 INFO L276 IsEmpty]: Start isEmpty. Operand 5492 states and 15307 transitions. [2022-11-03 03:38:00,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:38:00,688 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:38:00,688 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-11-03 03:38:00,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 03:38:00,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 03:38:00,917 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-03 03:38:00,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:38:00,917 INFO L85 PathProgramCache]: Analyzing trace with hash -381659594, now seen corresponding path program 1 times [2022-11-03 03:38:00,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:38:00,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113751751] [2022-11-03 03:38:00,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:00,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:38:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:38:00,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 03:38:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:38:00,954 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 03:38:00,955 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 03:38:00,955 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2022-11-03 03:38:00,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2022-11-03 03:38:00,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2022-11-03 03:38:00,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2022-11-03 03:38:00,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2022-11-03 03:38:00,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2022-11-03 03:38:00,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2022-11-03 03:38:00,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2022-11-03 03:38:00,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2022-11-03 03:38:00,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2022-11-03 03:38:00,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2022-11-03 03:38:00,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2022-11-03 03:38:00,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2022-11-03 03:38:00,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2022-11-03 03:38:00,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2022-11-03 03:38:00,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2022-11-03 03:38:00,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2022-11-03 03:38:00,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 03:38:00,961 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:38:00,962 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-03 03:38:00,962 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-03 03:38:00,997 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-03 03:38:01,000 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 03:38:01,001 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 224 transitions, 478 flow [2022-11-03 03:38:01,001 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 224 transitions, 478 flow [2022-11-03 03:38:01,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 224 transitions, 478 flow [2022-11-03 03:38:01,108 INFO L130 PetriNetUnfolder]: 50/450 cut-off events. [2022-11-03 03:38:01,108 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-03 03:38:01,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 450 events. 50/450 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1593 event pairs, 1 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 300. Up to 16 conditions per place. [2022-11-03 03:38:01,130 INFO L118 LiptonReduction]: Number of co-enabled transitions 24354 [2022-11-03 03:38:06,788 INFO L133 LiptonReduction]: Checked pairs total: 54076 [2022-11-03 03:38:06,788 INFO L135 LiptonReduction]: Total number of compositions: 207 [2022-11-03 03:38:06,789 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 90 transitions, 210 flow [2022-11-03 03:38:09,197 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 65789 states, 64832 states have (on average 4.972822063178677) internal successors, (322398), 65788 states have internal predecessors, (322398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:38:09,198 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:38:09,198 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;@6a2de4e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:38:09,198 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-11-03 03:38:09,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 65789 states, 64832 states have (on average 4.972822063178677) internal successors, (322398), 65788 states have internal predecessors, (322398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:38:09,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 03:38:09,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:38:09,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 03:38:09,305 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-03 03:38:09,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:38:09,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1330415586, now seen corresponding path program 1 times [2022-11-03 03:38:09,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:38:09,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355048177] [2022-11-03 03:38:09,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:09,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:38:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:09,339 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:38:09,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:38:09,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355048177] [2022-11-03 03:38:09,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355048177] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:38:09,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:38:09,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:38:09,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130184995] [2022-11-03 03:38:09,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:38:09,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:38:09,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:38:09,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:38:09,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:38:09,447 INFO L87 Difference]: Start difference. First operand has 65789 states, 64832 states have (on average 4.972822063178677) internal successors, (322398), 65788 states have internal predecessors, (322398), 0 states have call successors, (0), 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 2.5) internal successors, (5), 2 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:38:11,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:38:11,290 INFO L93 Difference]: Finished difference Result 65753 states and 238574 transitions. [2022-11-03 03:38:11,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:38:11,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:38:11,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:38:12,034 INFO L225 Difference]: With dead ends: 65753 [2022-11-03 03:38:12,034 INFO L226 Difference]: Without dead ends: 65627 [2022-11-03 03:38:12,035 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:38:12,035 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:38:12,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:38:12,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65627 states. [2022-11-03 03:38:14,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65627 to 65627. [2022-11-03 03:38:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65627 states, 64688 states have (on average 3.681486519910957) internal successors, (238148), 65626 states have internal predecessors, (238148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:38:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65627 states to 65627 states and 238148 transitions. [2022-11-03 03:38:15,001 INFO L78 Accepts]: Start accepts. Automaton has 65627 states and 238148 transitions. Word has length 5 [2022-11-03 03:38:15,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:38:15,001 INFO L495 AbstractCegarLoop]: Abstraction has 65627 states and 238148 transitions. [2022-11-03 03:38:15,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:38:15,001 INFO L276 IsEmpty]: Start isEmpty. Operand 65627 states and 238148 transitions. [2022-11-03 03:38:15,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 03:38:15,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:38:15,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:38:15,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 03:38:15,002 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-03 03:38:15,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:38:15,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1360764014, now seen corresponding path program 1 times [2022-11-03 03:38:15,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:38:15,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131362970] [2022-11-03 03:38:15,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:15,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:38:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:15,119 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:38:15,119 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:38:15,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131362970] [2022-11-03 03:38:15,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131362970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:38:15,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:38:15,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:38:15,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502738180] [2022-11-03 03:38:15,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:38:15,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:38:15,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:38:15,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:38:15,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:38:15,122 INFO L87 Difference]: Start difference. First operand 65627 states and 238148 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:38:16,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:38:16,862 INFO L93 Difference]: Finished difference Result 98730 states and 352664 transitions. [2022-11-03 03:38:16,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:38:16,862 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:38:16,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:38:17,585 INFO L225 Difference]: With dead ends: 98730 [2022-11-03 03:38:17,585 INFO L226 Difference]: Without dead ends: 98730 [2022-11-03 03:38:17,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:38:17,587 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 185 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:38:17,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 61 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:38:17,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98730 states. [2022-11-03 03:38:20,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98730 to 73020. [2022-11-03 03:38:20,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73020 states, 72081 states have (on average 3.6743663378698965) internal successors, (264852), 73019 states have internal predecessors, (264852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:38:20,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73020 states to 73020 states and 264852 transitions. [2022-11-03 03:38:20,338 INFO L78 Accepts]: Start accepts. Automaton has 73020 states and 264852 transitions. Word has length 7 [2022-11-03 03:38:20,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:38:20,338 INFO L495 AbstractCegarLoop]: Abstraction has 73020 states and 264852 transitions. [2022-11-03 03:38:20,338 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:38:20,338 INFO L276 IsEmpty]: Start isEmpty. Operand 73020 states and 264852 transitions. [2022-11-03 03:38:20,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:38:20,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:38:20,843 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-11-03 03:38:20,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 03:38:20,843 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-03 03:38:20,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:38:20,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1208257067, now seen corresponding path program 1 times [2022-11-03 03:38:20,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:38:20,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485754755] [2022-11-03 03:38:20,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:20,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:38:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:20,926 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:38:20,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:38:20,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485754755] [2022-11-03 03:38:20,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485754755] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:38:20,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010830903] [2022-11-03 03:38:20,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:20,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:38:20,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:38:20,957 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:38:21,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 03:38:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:21,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 03:38:21,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:38:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:38:21,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:38:21,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010830903] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:38:21,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:38:21,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2022-11-03 03:38:21,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486978514] [2022-11-03 03:38:21,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:38:21,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:38:21,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:38:21,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:38:21,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:38:21,160 INFO L87 Difference]: Start difference. First operand 73020 states and 264852 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:38:21,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:38:21,638 INFO L93 Difference]: Finished difference Result 68500 states and 247849 transitions. [2022-11-03 03:38:21,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:38:21,638 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:38:21,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:38:21,972 INFO L225 Difference]: With dead ends: 68500 [2022-11-03 03:38:21,972 INFO L226 Difference]: Without dead ends: 68500 [2022-11-03 03:38:21,972 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:38:21,973 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 76 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:38:21,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 20 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:38:22,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68500 states. [2022-11-03 03:38:24,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68500 to 68500. [2022-11-03 03:38:24,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68500 states, 67711 states have (on average 3.660394913677246) internal successors, (247849), 68499 states have internal predecessors, (247849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:38:24,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68500 states to 68500 states and 247849 transitions. [2022-11-03 03:38:24,731 INFO L78 Accepts]: Start accepts. Automaton has 68500 states and 247849 transitions. Word has length 9 [2022-11-03 03:38:24,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:38:24,731 INFO L495 AbstractCegarLoop]: Abstraction has 68500 states and 247849 transitions. [2022-11-03 03:38:24,731 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:38:24,731 INFO L276 IsEmpty]: Start isEmpty. Operand 68500 states and 247849 transitions. [2022-11-03 03:38:24,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:38:24,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:38:24,732 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-11-03 03:38:24,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:38:24,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:38:24,932 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-03 03:38:24,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:38:24,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1208257068, now seen corresponding path program 1 times [2022-11-03 03:38:24,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:38:24,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174014419] [2022-11-03 03:38:24,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:24,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:38:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:24,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:38:24,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:38:24,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174014419] [2022-11-03 03:38:24,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174014419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:38:24,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:38:24,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:38:24,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070969085] [2022-11-03 03:38:24,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:38:24,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:38:24,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:38:24,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:38:24,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:38:24,968 INFO L87 Difference]: Start difference. First operand 68500 states and 247849 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:38:26,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:38:26,197 INFO L93 Difference]: Finished difference Result 63980 states and 230846 transitions. [2022-11-03 03:38:26,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:38:26,197 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 9 [2022-11-03 03:38:26,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:38:26,429 INFO L225 Difference]: With dead ends: 63980 [2022-11-03 03:38:26,430 INFO L226 Difference]: Without dead ends: 63980 [2022-11-03 03:38:26,430 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:38:26,430 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 48 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:38:26,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 22 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:38:26,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63980 states. [2022-11-03 03:38:27,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63980 to 63980. [2022-11-03 03:38:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63980 states, 63341 states have (on average 3.6444956663140777) internal successors, (230846), 63979 states have internal predecessors, (230846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:38:28,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63980 states to 63980 states and 230846 transitions. [2022-11-03 03:38:28,806 INFO L78 Accepts]: Start accepts. Automaton has 63980 states and 230846 transitions. Word has length 9 [2022-11-03 03:38:28,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:38:28,807 INFO L495 AbstractCegarLoop]: Abstraction has 63980 states and 230846 transitions. [2022-11-03 03:38:28,807 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:38:28,807 INFO L276 IsEmpty]: Start isEmpty. Operand 63980 states and 230846 transitions. [2022-11-03 03:38:28,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 03:38:28,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:38:28,808 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:38:28,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 03:38:28,808 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-03 03:38:28,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:38:28,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1169905995, now seen corresponding path program 1 times [2022-11-03 03:38:28,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:38:28,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200193144] [2022-11-03 03:38:28,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:28,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:38:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:29,067 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:38:29,068 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:38:29,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200193144] [2022-11-03 03:38:29,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200193144] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:38:29,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798638027] [2022-11-03 03:38:29,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:29,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:38:29,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:38:29,070 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:38:29,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 03:38:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:29,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-03 03:38:29,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:38:29,192 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 03:38:29,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 03:38:29,218 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:38:29,286 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:38:29,311 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:38:29,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:38:29,335 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_166 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_166) c_t_funThread1of3ForFork0_~p~0.base) c_t_funThread1of3ForFork0_~p~0.offset) 2147483647)) is different from false [2022-11-03 03:38:29,342 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_166 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_166) |c_~#global~0.base|) |c_~#global~0.offset|) 2147483647)) is different from false [2022-11-03 03:38:29,368 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:38:29,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798638027] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:38:29,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [344881243] [2022-11-03 03:38:29,370 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:38:29,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:38:29,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-11-03 03:38:29,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15210607] [2022-11-03 03:38:29,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:38:29,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 03:38:29,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:38:29,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 03:38:29,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=53, Unknown=2, NotChecked=30, Total=110 [2022-11-03 03:38:29,379 INFO L87 Difference]: Start difference. First operand 63980 states and 230846 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 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:38:30,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:38:30,477 INFO L93 Difference]: Finished difference Result 68818 states and 242313 transitions. [2022-11-03 03:38:30,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:38:30,477 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 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:38:30,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:38:30,771 INFO L225 Difference]: With dead ends: 68818 [2022-11-03 03:38:30,771 INFO L226 Difference]: Without dead ends: 68818 [2022-11-03 03:38:30,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=93, Unknown=2, NotChecked=42, Total=182 [2022-11-03 03:38:30,772 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 196 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 266 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:38:30,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 157 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 677 Invalid, 0 Unknown, 266 Unchecked, 0.5s Time] [2022-11-03 03:38:30,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68818 states. [2022-11-03 03:38:32,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68818 to 60755. [2022-11-03 03:38:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60755 states, 60140 states have (on average 3.632291320252744) internal successors, (218446), 60754 states have internal predecessors, (218446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:38:33,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60755 states to 60755 states and 218446 transitions. [2022-11-03 03:38:33,411 INFO L78 Accepts]: Start accepts. Automaton has 60755 states and 218446 transitions. Word has length 10 [2022-11-03 03:38:33,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:38:33,411 INFO L495 AbstractCegarLoop]: Abstraction has 60755 states and 218446 transitions. [2022-11-03 03:38:33,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 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:38:33,411 INFO L276 IsEmpty]: Start isEmpty. Operand 60755 states and 218446 transitions. [2022-11-03 03:38:33,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:38:33,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:38:33,412 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:38:33,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:38:33,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 03:38:33,613 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-03 03:38:33,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:38:33,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1503432068, now seen corresponding path program 1 times [2022-11-03 03:38:33,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:38:33,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634526224] [2022-11-03 03:38:33,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:33,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:38:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:33,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:38:33,716 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:38:33,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634526224] [2022-11-03 03:38:33,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634526224] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:38:33,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785834405] [2022-11-03 03:38:33,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:33,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:38:33,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:38:33,718 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:38:33,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 03:38:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:33,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-03 03:38:33,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:38:33,830 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 03:38:33,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 03:38:33,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, 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:38:33,888 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:38:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:38:33,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:38:33,971 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_188 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_188) |c_~#global~0.base|) |c_~#global~0.offset|) 2147483647)) is different from false [2022-11-03 03:38:33,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-11-03 03:38:33,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785834405] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:38:33,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1076411873] [2022-11-03 03:38:33,988 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:38:33,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:38:33,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-11-03 03:38:33,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81481513] [2022-11-03 03:38:33,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:38:33,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 03:38:33,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:38:33,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 03:38:33,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2022-11-03 03:38:33,992 INFO L87 Difference]: Start difference. First operand 60755 states and 218446 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 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:38:35,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:38:35,331 INFO L93 Difference]: Finished difference Result 97360 states and 336640 transitions. [2022-11-03 03:38:35,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:38:35,332 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 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:38:35,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:38:36,372 INFO L225 Difference]: With dead ends: 97360 [2022-11-03 03:38:36,373 INFO L226 Difference]: Without dead ends: 97360 [2022-11-03 03:38:36,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=165, Unknown=1, NotChecked=28, Total=272 [2022-11-03 03:38:36,374 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 296 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:38:36,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 212 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1060 Invalid, 0 Unknown, 118 Unchecked, 0.7s Time] [2022-11-03 03:38:36,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97360 states. [2022-11-03 03:38:38,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97360 to 65387. [2022-11-03 03:38:38,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65387 states, 64772 states have (on average 3.6187550176001975) internal successors, (234394), 65386 states have internal predecessors, (234394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:38:38,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65387 states to 65387 states and 234394 transitions. [2022-11-03 03:38:38,645 INFO L78 Accepts]: Start accepts. Automaton has 65387 states and 234394 transitions. Word has length 11 [2022-11-03 03:38:38,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:38:38,645 INFO L495 AbstractCegarLoop]: Abstraction has 65387 states and 234394 transitions. [2022-11-03 03:38:38,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 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:38:38,645 INFO L276 IsEmpty]: Start isEmpty. Operand 65387 states and 234394 transitions. [2022-11-03 03:38:38,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:38:38,646 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:38:38,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:38:38,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 03:38:38,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8eb706d-40bf-4329-b0ff-33be53b6d603/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 03:38:38,849 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-03 03:38:38,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:38:38,850 INFO L85 PathProgramCache]: Analyzing trace with hash 443563140, now seen corresponding path program 1 times [2022-11-03 03:38:38,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:38:38,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579761642] [2022-11-03 03:38:38,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:38,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:38:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:38,931 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:38:38,931 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:38:38,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579761642] [2022-11-03 03:38:38,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579761642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:38:38,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:38:38,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:38:38,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234584561] [2022-11-03 03:38:38,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:38:38,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:38:38,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:38:38,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:38:38,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:38:38,934 INFO L87 Difference]: Start difference. First operand 65387 states and 234394 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:38:40,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:38:40,506 INFO L93 Difference]: Finished difference Result 86118 states and 308927 transitions. [2022-11-03 03:38:40,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:38:40,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 03:38:40,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:38:40,834 INFO L225 Difference]: With dead ends: 86118 [2022-11-03 03:38:40,834 INFO L226 Difference]: Without dead ends: 86118 [2022-11-03 03:38:40,835 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:38:40,835 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 46 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:38:40,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 31 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:38:40,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86118 states. [2022-11-03 03:38:42,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86118 to 76596. [2022-11-03 03:38:42,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76596 states, 75981 states have (on average 3.679946302365065) internal successors, (279606), 76595 states have internal predecessors, (279606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:38:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76596 states to 76596 states and 279606 transitions. [2022-11-03 03:38:43,878 INFO L78 Accepts]: Start accepts. Automaton has 76596 states and 279606 transitions. Word has length 11 [2022-11-03 03:38:43,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:38:43,879 INFO L495 AbstractCegarLoop]: Abstraction has 76596 states and 279606 transitions. [2022-11-03 03:38:43,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:38:43,879 INFO L276 IsEmpty]: Start isEmpty. Operand 76596 states and 279606 transitions. [2022-11-03 03:38:43,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:38:43,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:38:43,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:38:43,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-03 03:38:43,880 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-03 03:38:43,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:38:43,880 INFO L85 PathProgramCache]: Analyzing trace with hash 443563197, now seen corresponding path program 1 times [2022-11-03 03:38:43,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:38:43,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499660546] [2022-11-03 03:38:43,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:43,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:38:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:44,071 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:38:44,071 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:38:44,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499660546] [2022-11-03 03:38:44,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499660546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:38:44,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:38:44,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:38:44,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655891091] [2022-11-03 03:38:44,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:38:44,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 03:38:44,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:38:44,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 03:38:44,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:38:44,073 INFO L87 Difference]: Start difference. First operand 76596 states and 279606 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)