./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/stack_longest-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/stack_longest-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5773bc320dd9dee5d943610df8c4ec3040864edddf388dd42a51d37167245e47 --- 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-4e7fbc6 [2022-11-23 15:49:02,533 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 15:49:02,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 15:49:02,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 15:49:02,582 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 15:49:02,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 15:49:02,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 15:49:02,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 15:49:02,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 15:49:02,601 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 15:49:02,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 15:49:02,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 15:49:02,606 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 15:49:02,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 15:49:02,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 15:49:02,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 15:49:02,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 15:49:02,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 15:49:02,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 15:49:02,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 15:49:02,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 15:49:02,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 15:49:02,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 15:49:02,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 15:49:02,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 15:49:02,648 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 15:49:02,648 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 15:49:02,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 15:49:02,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 15:49:02,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 15:49:02,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 15:49:02,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 15:49:02,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 15:49:02,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 15:49:02,661 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 15:49:02,661 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 15:49:02,662 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 15:49:02,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 15:49:02,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 15:49:02,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 15:49:02,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 15:49:02,666 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-23 15:49:02,731 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 15:49:02,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 15:49:02,732 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 15:49:02,733 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 15:49:02,734 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 15:49:02,734 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 15:49:02,734 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 15:49:02,735 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 15:49:02,735 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 15:49:02,735 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 15:49:02,737 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 15:49:02,737 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 15:49:02,737 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 15:49:02,738 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 15:49:02,738 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 15:49:02,738 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 15:49:02,739 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 15:49:02,739 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 15:49:02,740 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 15:49:02,740 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 15:49:02,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 15:49:02,741 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 15:49:02,741 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 15:49:02,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 15:49:02,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 15:49:02,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 15:49:02,742 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 15:49:02,743 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 15:49:02,743 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 15:49:02,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 15:49:02,744 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 15:49:02,744 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 15:49:02,745 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 15:49:02,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 15:49:02,745 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 15:49:02,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:49:02,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 15:49:02,746 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 15:49:02,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 15:49:02,747 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 15:49:02,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 15:49:02,747 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 15:49:02,748 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_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/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_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 5773bc320dd9dee5d943610df8c4ec3040864edddf388dd42a51d37167245e47 [2022-11-23 15:49:03,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 15:49:03,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 15:49:03,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 15:49:03,090 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 15:49:03,091 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 15:49:03,092 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread/stack_longest-2.i [2022-11-23 15:49:06,300 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 15:49:06,590 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 15:49:06,590 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/sv-benchmarks/c/pthread/stack_longest-2.i [2022-11-23 15:49:06,607 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/data/9d6e42e53/db4a71ec2c76426ba23d660366212df7/FLAG23e544317 [2022-11-23 15:49:06,624 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/data/9d6e42e53/db4a71ec2c76426ba23d660366212df7 [2022-11-23 15:49:06,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 15:49:06,629 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 15:49:06,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 15:49:06,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 15:49:06,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 15:49:06,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:49:06" (1/1) ... [2022-11-23 15:49:06,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@248d7722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:06, skipping insertion in model container [2022-11-23 15:49:06,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:49:06" (1/1) ... [2022-11-23 15:49:06,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 15:49:06,698 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 15:49:07,280 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/sv-benchmarks/c/pthread/stack_longest-2.i[41530,41543] [2022-11-23 15:49:07,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:49:07,331 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 15:49:07,375 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/sv-benchmarks/c/pthread/stack_longest-2.i[41530,41543] [2022-11-23 15:49:07,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:49:07,465 INFO L208 MainTranslator]: Completed translation [2022-11-23 15:49:07,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:07 WrapperNode [2022-11-23 15:49:07,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 15:49:07,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 15:49:07,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 15:49:07,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 15:49:07,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:07" (1/1) ... [2022-11-23 15:49:07,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:07" (1/1) ... [2022-11-23 15:49:07,532 INFO L138 Inliner]: procedures = 277, calls = 38, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 148 [2022-11-23 15:49:07,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 15:49:07,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 15:49:07,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 15:49:07,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 15:49:07,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:07" (1/1) ... [2022-11-23 15:49:07,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:07" (1/1) ... [2022-11-23 15:49:07,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:07" (1/1) ... [2022-11-23 15:49:07,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:07" (1/1) ... [2022-11-23 15:49:07,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:07" (1/1) ... [2022-11-23 15:49:07,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:07" (1/1) ... [2022-11-23 15:49:07,568 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:07" (1/1) ... [2022-11-23 15:49:07,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:07" (1/1) ... [2022-11-23 15:49:07,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 15:49:07,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 15:49:07,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 15:49:07,576 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 15:49:07,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:07" (1/1) ... [2022-11-23 15:49:07,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:49:07,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:49:07,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 15:49:07,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 15:49:07,684 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-23 15:49:07,684 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-23 15:49:07,684 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-23 15:49:07,684 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-23 15:49:07,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 15:49:07,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 15:49:07,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 15:49:07,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 15:49:07,685 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-23 15:49:07,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 15:49:07,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 15:49:07,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 15:49:07,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 15:49:07,688 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 15:49:07,849 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 15:49:07,852 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 15:49:08,283 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 15:49:08,295 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 15:49:08,295 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-23 15:49:08,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:49:08 BoogieIcfgContainer [2022-11-23 15:49:08,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 15:49:08,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 15:49:08,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 15:49:08,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 15:49:08,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:49:06" (1/3) ... [2022-11-23 15:49:08,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f018396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:49:08, skipping insertion in model container [2022-11-23 15:49:08,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:07" (2/3) ... [2022-11-23 15:49:08,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f018396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:49:08, skipping insertion in model container [2022-11-23 15:49:08,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:49:08" (3/3) ... [2022-11-23 15:49:08,323 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2022-11-23 15:49:08,357 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 15:49:08,357 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2022-11-23 15:49:08,357 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 15:49:08,483 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-23 15:49:08,527 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 15:49:08,545 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 186 transitions, 388 flow [2022-11-23 15:49:08,549 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 186 transitions, 388 flow [2022-11-23 15:49:08,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 186 transitions, 388 flow [2022-11-23 15:49:08,757 INFO L130 PetriNetUnfolder]: 10/184 cut-off events. [2022-11-23 15:49:08,758 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-23 15:49:08,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 184 events. 10/184 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 488 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 134. Up to 3 conditions per place. [2022-11-23 15:49:08,786 INFO L119 LiptonReduction]: Number of co-enabled transitions 9804 [2022-11-23 15:49:15,532 INFO L134 LiptonReduction]: Checked pairs total: 15485 [2022-11-23 15:49:15,532 INFO L136 LiptonReduction]: Total number of compositions: 189 [2022-11-23 15:49:15,542 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 49 transitions, 114 flow [2022-11-23 15:49:15,632 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 782 states, 716 states have (on average 3.1089385474860336) internal successors, (2226), 781 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:15,666 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 15:49:15,680 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@7567ffba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 15:49:15,680 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-11-23 15:49:15,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 782 states, 716 states have (on average 3.1089385474860336) internal successors, (2226), 781 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:15,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-23 15:49:15,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:15,692 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-23 15:49:15,692 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:15,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:15,703 INFO L85 PathProgramCache]: Analyzing trace with hash 763, now seen corresponding path program 1 times [2022-11-23 15:49:15,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:15,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15880706] [2022-11-23 15:49:15,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:15,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:15,847 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-23 15:49:15,848 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:15,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15880706] [2022-11-23 15:49:15,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15880706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:49:15,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:49:15,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 15:49:15,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154380761] [2022-11-23 15:49:15,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:49:15,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 15:49:15,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:15,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 15:49:15,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 15:49:15,889 INFO L87 Difference]: Start difference. First operand has 782 states, 716 states have (on average 3.1089385474860336) internal successors, (2226), 781 states have internal predecessors, (2226), 0 states have call successors, (0), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:16,030 INFO L93 Difference]: Finished difference Result 780 states and 2224 transitions. [2022-11-23 15:49:16,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 15:49:16,033 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-11-23 15:49:16,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:16,058 INFO L225 Difference]: With dead ends: 780 [2022-11-23 15:49:16,062 INFO L226 Difference]: Without dead ends: 780 [2022-11-23 15:49:16,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 15:49:16,068 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:49:16,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:49:16,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2022-11-23 15:49:16,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 780. [2022-11-23 15:49:16,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 716 states have (on average 3.106145251396648) internal successors, (2224), 779 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:16,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 2224 transitions. [2022-11-23 15:49:16,202 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 2224 transitions. Word has length 1 [2022-11-23 15:49:16,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:16,203 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 2224 transitions. [2022-11-23 15:49:16,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:16,205 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 2224 transitions. [2022-11-23 15:49:16,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 15:49:16,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:16,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 15:49:16,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 15:49:16,207 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:16,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:16,209 INFO L85 PathProgramCache]: Analyzing trace with hash 749726, now seen corresponding path program 1 times [2022-11-23 15:49:16,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:16,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114596787] [2022-11-23 15:49:16,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:16,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:16,613 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-23 15:49:16,614 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:16,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114596787] [2022-11-23 15:49:16,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114596787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:49:16,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:49:16,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 15:49:16,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400469683] [2022-11-23 15:49:16,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:49:16,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:49:16,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:16,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:49:16,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:49:16,620 INFO L87 Difference]: Start difference. First operand 780 states and 2224 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:16,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:16,716 INFO L93 Difference]: Finished difference Result 754 states and 2169 transitions. [2022-11-23 15:49:16,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:49:16,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-23 15:49:16,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:16,724 INFO L225 Difference]: With dead ends: 754 [2022-11-23 15:49:16,724 INFO L226 Difference]: Without dead ends: 754 [2022-11-23 15:49:16,724 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-23 15:49:16,726 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1 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.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:49:16,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:49:16,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2022-11-23 15:49:16,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2022-11-23 15:49:16,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 698 states have (on average 3.1074498567335245) internal successors, (2169), 753 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:16,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 2169 transitions. [2022-11-23 15:49:16,756 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 2169 transitions. Word has length 3 [2022-11-23 15:49:16,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:16,756 INFO L495 AbstractCegarLoop]: Abstraction has 754 states and 2169 transitions. [2022-11-23 15:49:16,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:16,757 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 2169 transitions. [2022-11-23 15:49:16,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 15:49:16,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:16,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 15:49:16,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 15:49:16,758 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:16,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:16,759 INFO L85 PathProgramCache]: Analyzing trace with hash 749724, now seen corresponding path program 1 times [2022-11-23 15:49:16,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:16,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831199519] [2022-11-23 15:49:16,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:16,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:16,828 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-23 15:49:16,828 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:16,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831199519] [2022-11-23 15:49:16,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831199519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:49:16,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:49:16,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 15:49:16,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601546400] [2022-11-23 15:49:16,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:49:16,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:49:16,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:16,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:49:16,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:49:16,832 INFO L87 Difference]: Start difference. First operand 754 states and 2169 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:16,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:16,913 INFO L93 Difference]: Finished difference Result 728 states and 2114 transitions. [2022-11-23 15:49:16,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:49:16,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-23 15:49:16,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:16,919 INFO L225 Difference]: With dead ends: 728 [2022-11-23 15:49:16,919 INFO L226 Difference]: Without dead ends: 728 [2022-11-23 15:49:16,920 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-23 15:49:16,921 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:49:16,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:49:16,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-11-23 15:49:16,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2022-11-23 15:49:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 680 states have (on average 3.1088235294117648) internal successors, (2114), 727 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 2114 transitions. [2022-11-23 15:49:16,967 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 2114 transitions. Word has length 3 [2022-11-23 15:49:16,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:16,968 INFO L495 AbstractCegarLoop]: Abstraction has 728 states and 2114 transitions. [2022-11-23 15:49:16,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:16,973 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 2114 transitions. [2022-11-23 15:49:16,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 15:49:16,974 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:16,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 15:49:16,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 15:49:16,976 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:16,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:16,977 INFO L85 PathProgramCache]: Analyzing trace with hash 720503190, now seen corresponding path program 1 times [2022-11-23 15:49:16,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:16,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568127820] [2022-11-23 15:49:16,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:16,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:17,106 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-23 15:49:17,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:17,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568127820] [2022-11-23 15:49:17,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568127820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:49:17,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:49:17,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:49:17,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544342596] [2022-11-23 15:49:17,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:49:17,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:49:17,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:17,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:49:17,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:49:17,110 INFO L87 Difference]: Start difference. First operand 728 states and 2114 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-23 15:49:17,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:17,178 INFO L93 Difference]: Finished difference Result 560 states and 1572 transitions. [2022-11-23 15:49:17,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:49:17,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-23 15:49:17,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:17,183 INFO L225 Difference]: With dead ends: 560 [2022-11-23 15:49:17,184 INFO L226 Difference]: Without dead ends: 560 [2022-11-23 15:49:17,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:49:17,185 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:49:17,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:49:17,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-11-23 15:49:17,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2022-11-23 15:49:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 528 states have (on average 2.977272727272727) internal successors, (1572), 559 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1572 transitions. [2022-11-23 15:49:17,207 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 1572 transitions. Word has length 5 [2022-11-23 15:49:17,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:17,208 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 1572 transitions. [2022-11-23 15:49:17,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-23 15:49:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1572 transitions. [2022-11-23 15:49:17,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 15:49:17,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:17,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 15:49:17,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 15:49:17,211 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:17,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:17,211 INFO L85 PathProgramCache]: Analyzing trace with hash 720503191, now seen corresponding path program 1 times [2022-11-23 15:49:17,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:17,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499403896] [2022-11-23 15:49:17,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:17,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:17,266 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-23 15:49:17,266 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:17,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499403896] [2022-11-23 15:49:17,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499403896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:49:17,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:49:17,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 15:49:17,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314385855] [2022-11-23 15:49:17,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:49:17,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:49:17,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:17,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:49:17,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:49:17,269 INFO L87 Difference]: Start difference. First operand 560 states and 1572 transitions. 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-23 15:49:17,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:17,344 INFO L93 Difference]: Finished difference Result 392 states and 1030 transitions. [2022-11-23 15:49:17,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:49:17,345 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-23 15:49:17,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:17,347 INFO L225 Difference]: With dead ends: 392 [2022-11-23 15:49:17,347 INFO L226 Difference]: Without dead ends: 392 [2022-11-23 15:49:17,348 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-23 15:49:17,349 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:49:17,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:49:17,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-11-23 15:49:17,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2022-11-23 15:49:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 376 states have (on average 2.7393617021276597) internal successors, (1030), 391 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1030 transitions. [2022-11-23 15:49:17,364 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1030 transitions. Word has length 5 [2022-11-23 15:49:17,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:17,364 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 1030 transitions. [2022-11-23 15:49:17,365 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-23 15:49:17,365 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1030 transitions. [2022-11-23 15:49:17,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 15:49:17,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:17,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 15:49:17,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 15:49:17,366 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:17,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:17,367 INFO L85 PathProgramCache]: Analyzing trace with hash 859900896, now seen corresponding path program 1 times [2022-11-23 15:49:17,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:17,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940734268] [2022-11-23 15:49:17,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:17,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:17,688 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-23 15:49:17,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:17,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940734268] [2022-11-23 15:49:17,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940734268] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:49:17,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:49:17,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:49:17,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787223717] [2022-11-23 15:49:17,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:49:17,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:49:17,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:17,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:49:17,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:49:17,693 INFO L87 Difference]: Start difference. First operand 392 states and 1030 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:17,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:17,835 INFO L93 Difference]: Finished difference Result 451 states and 1170 transitions. [2022-11-23 15:49:17,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:49:17,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-23 15:49:17,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:17,839 INFO L225 Difference]: With dead ends: 451 [2022-11-23 15:49:17,839 INFO L226 Difference]: Without dead ends: 451 [2022-11-23 15:49:17,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:49:17,843 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 64 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:49:17,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 3 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:49:17,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-11-23 15:49:17,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 362. [2022-11-23 15:49:17,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 350 states have (on average 2.72) internal successors, (952), 361 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 952 transitions. [2022-11-23 15:49:17,859 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 952 transitions. Word has length 6 [2022-11-23 15:49:17,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:17,859 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 952 transitions. [2022-11-23 15:49:17,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:17,860 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 952 transitions. [2022-11-23 15:49:17,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 15:49:17,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:17,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 15:49:17,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 15:49:17,861 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:17,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:17,862 INFO L85 PathProgramCache]: Analyzing trace with hash 859900897, now seen corresponding path program 1 times [2022-11-23 15:49:17,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:17,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483052058] [2022-11-23 15:49:17,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:17,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:18,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:49:18,224 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:18,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483052058] [2022-11-23 15:49:18,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483052058] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:49:18,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:49:18,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:49:18,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672081887] [2022-11-23 15:49:18,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:49:18,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:49:18,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:18,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:49:18,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:49:18,227 INFO L87 Difference]: Start difference. First operand 362 states and 952 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:18,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:18,395 INFO L93 Difference]: Finished difference Result 440 states and 1128 transitions. [2022-11-23 15:49:18,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:49:18,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-23 15:49:18,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:18,399 INFO L225 Difference]: With dead ends: 440 [2022-11-23 15:49:18,399 INFO L226 Difference]: Without dead ends: 440 [2022-11-23 15:49:18,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:49:18,401 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:49:18,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:49:18,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-11-23 15:49:18,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 428. [2022-11-23 15:49:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 416 states have (on average 2.6778846153846154) internal successors, (1114), 427 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:18,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1114 transitions. [2022-11-23 15:49:18,420 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1114 transitions. Word has length 6 [2022-11-23 15:49:18,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:18,420 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 1114 transitions. [2022-11-23 15:49:18,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:18,421 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1114 transitions. [2022-11-23 15:49:18,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 15:49:18,423 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:18,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:49:18,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 15:49:18,424 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:18,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:18,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1366824338, now seen corresponding path program 1 times [2022-11-23 15:49:18,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:18,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125602161] [2022-11-23 15:49:18,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:18,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:18,496 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-23 15:49:18,496 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:18,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125602161] [2022-11-23 15:49:18,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125602161] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:49:18,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:49:18,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:49:18,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760378336] [2022-11-23 15:49:18,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:49:18,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:49:18,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:18,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:49:18,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:49:18,504 INFO L87 Difference]: Start difference. First operand 428 states and 1114 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:18,601 INFO L93 Difference]: Finished difference Result 458 states and 1192 transitions. [2022-11-23 15:49:18,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:49:18,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-23 15:49:18,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:18,605 INFO L225 Difference]: With dead ends: 458 [2022-11-23 15:49:18,605 INFO L226 Difference]: Without dead ends: 458 [2022-11-23 15:49:18,606 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-23 15:49:18,606 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:49:18,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:49:18,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-11-23 15:49:18,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2022-11-23 15:49:18,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 446 states have (on average 2.672645739910314) internal successors, (1192), 457 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1192 transitions. [2022-11-23 15:49:18,623 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1192 transitions. Word has length 10 [2022-11-23 15:49:18,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:18,624 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 1192 transitions. [2022-11-23 15:49:18,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:18,624 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1192 transitions. [2022-11-23 15:49:18,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 15:49:18,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:18,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:49:18,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 15:49:18,626 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:18,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:18,627 INFO L85 PathProgramCache]: Analyzing trace with hash -2006710853, now seen corresponding path program 1 times [2022-11-23 15:49:18,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:18,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426014948] [2022-11-23 15:49:18,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:18,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:18,675 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-23 15:49:18,675 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:18,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426014948] [2022-11-23 15:49:18,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426014948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:49:18,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:49:18,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:49:18,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193128409] [2022-11-23 15:49:18,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:49:18,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:49:18,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:18,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:49:18,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:49:18,678 INFO L87 Difference]: Start difference. First operand 458 states and 1192 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:18,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:18,784 INFO L93 Difference]: Finished difference Result 476 states and 1233 transitions. [2022-11-23 15:49:18,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:49:18,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 15:49:18,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:18,788 INFO L225 Difference]: With dead ends: 476 [2022-11-23 15:49:18,788 INFO L226 Difference]: Without dead ends: 476 [2022-11-23 15:49:18,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:49:18,789 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:49:18,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 3 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:49:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-11-23 15:49:18,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 440. [2022-11-23 15:49:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 428 states have (on average 2.677570093457944) internal successors, (1146), 439 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1146 transitions. [2022-11-23 15:49:18,807 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1146 transitions. Word has length 13 [2022-11-23 15:49:18,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:18,807 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 1146 transitions. [2022-11-23 15:49:18,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1146 transitions. [2022-11-23 15:49:18,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 15:49:18,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:18,809 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:49:18,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 15:49:18,810 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:18,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:18,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1519702029, now seen corresponding path program 1 times [2022-11-23 15:49:18,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:18,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437345371] [2022-11-23 15:49:18,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:18,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:49:19,463 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:19,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437345371] [2022-11-23 15:49:19,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437345371] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:49:19,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114209123] [2022-11-23 15:49:19,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:19,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:49:19,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:49:19,471 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:49:19,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 15:49:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:19,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-23 15:49:19,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:49:19,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:49:19,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:49:19,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:49:19,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-23 15:49:20,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:49:20,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:49:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:49:20,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114209123] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:49:20,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1338341030] [2022-11-23 15:49:20,256 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-23 15:49:20,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:49:20,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2022-11-23 15:49:20,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35165336] [2022-11-23 15:49:20,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:49:20,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 15:49:20,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:20,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 15:49:20,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-11-23 15:49:20,281 INFO L87 Difference]: Start difference. First operand 440 states and 1146 transitions. Second operand has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:21,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:21,497 INFO L93 Difference]: Finished difference Result 1062 states and 2727 transitions. [2022-11-23 15:49:21,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 15:49:21,498 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 15:49:21,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:21,505 INFO L225 Difference]: With dead ends: 1062 [2022-11-23 15:49:21,505 INFO L226 Difference]: Without dead ends: 1062 [2022-11-23 15:49:21,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2022-11-23 15:49:21,506 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 236 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-23 15:49:21,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 2 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-23 15:49:21,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2022-11-23 15:49:21,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 764. [2022-11-23 15:49:21,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 752 states have (on average 2.7367021276595747) internal successors, (2058), 763 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:21,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 2058 transitions. [2022-11-23 15:49:21,552 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 2058 transitions. Word has length 13 [2022-11-23 15:49:21,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:21,552 INFO L495 AbstractCegarLoop]: Abstraction has 764 states and 2058 transitions. [2022-11-23 15:49:21,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:21,553 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 2058 transitions. [2022-11-23 15:49:21,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 15:49:21,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:21,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:49:21,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 15:49:21,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-23 15:49:21,767 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:21,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:21,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1444222860, now seen corresponding path program 1 times [2022-11-23 15:49:21,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:21,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794061703] [2022-11-23 15:49:21,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:21,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:21,919 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-23 15:49:21,919 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:21,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794061703] [2022-11-23 15:49:21,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794061703] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:49:21,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:49:21,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:49:21,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636446214] [2022-11-23 15:49:21,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:49:21,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:49:21,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:21,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:49:21,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:49:21,922 INFO L87 Difference]: Start difference. First operand 764 states and 2058 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:22,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:22,004 INFO L93 Difference]: Finished difference Result 364 states and 831 transitions. [2022-11-23 15:49:22,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:49:22,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-23 15:49:22,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:22,007 INFO L225 Difference]: With dead ends: 364 [2022-11-23 15:49:22,007 INFO L226 Difference]: Without dead ends: 364 [2022-11-23 15:49:22,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:49:22,009 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:49:22,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:49:22,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-11-23 15:49:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 354. [2022-11-23 15:49:22,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 348 states have (on average 2.32183908045977) internal successors, (808), 353 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:22,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 808 transitions. [2022-11-23 15:49:22,021 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 808 transitions. Word has length 18 [2022-11-23 15:49:22,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:22,022 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 808 transitions. [2022-11-23 15:49:22,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:22,022 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 808 transitions. [2022-11-23 15:49:22,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-23 15:49:22,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:22,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:49:22,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 15:49:22,024 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:22,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:22,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1337344503, now seen corresponding path program 1 times [2022-11-23 15:49:22,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:22,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414796755] [2022-11-23 15:49:22,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:22,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:22,501 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-23 15:49:22,501 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:22,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414796755] [2022-11-23 15:49:22,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414796755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:49:22,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:49:22,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-23 15:49:22,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641594528] [2022-11-23 15:49:22,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:49:22,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-23 15:49:22,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:22,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-23 15:49:22,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-23 15:49:22,503 INFO L87 Difference]: Start difference. First operand 354 states and 808 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:23,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:23,431 INFO L93 Difference]: Finished difference Result 510 states and 1131 transitions. [2022-11-23 15:49:23,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 15:49:23,435 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-23 15:49:23,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:23,438 INFO L225 Difference]: With dead ends: 510 [2022-11-23 15:49:23,439 INFO L226 Difference]: Without dead ends: 510 [2022-11-23 15:49:23,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-11-23 15:49:23,440 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 103 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 15:49:23,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 0 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 15:49:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-11-23 15:49:23,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 424. [2022-11-23 15:49:23,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 418 states have (on average 2.3636363636363638) internal successors, (988), 423 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:23,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 988 transitions. [2022-11-23 15:49:23,462 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 988 transitions. Word has length 19 [2022-11-23 15:49:23,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:23,463 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 988 transitions. [2022-11-23 15:49:23,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:23,464 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 988 transitions. [2022-11-23 15:49:23,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-23 15:49:23,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:23,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:49:23,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 15:49:23,465 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:23,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:23,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1337344504, now seen corresponding path program 1 times [2022-11-23 15:49:23,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:23,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076841075] [2022-11-23 15:49:23,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:23,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:23,593 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-23 15:49:23,593 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:23,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076841075] [2022-11-23 15:49:23,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076841075] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:49:23,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:49:23,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:49:23,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469353401] [2022-11-23 15:49:23,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:49:23,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:49:23,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:23,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:49:23,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:49:23,596 INFO L87 Difference]: Start difference. First operand 424 states and 988 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:23,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:23,775 INFO L93 Difference]: Finished difference Result 507 states and 1189 transitions. [2022-11-23 15:49:23,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:49:23,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-23 15:49:23,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:23,779 INFO L225 Difference]: With dead ends: 507 [2022-11-23 15:49:23,779 INFO L226 Difference]: Without dead ends: 507 [2022-11-23 15:49:23,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-23 15:49:23,780 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 111 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:49:23,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 8 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:49:23,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-11-23 15:49:23,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 418. [2022-11-23 15:49:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 413 states have (on average 2.348668280871671) internal successors, (970), 417 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 970 transitions. [2022-11-23 15:49:23,795 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 970 transitions. Word has length 19 [2022-11-23 15:49:23,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:23,796 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 970 transitions. [2022-11-23 15:49:23,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:23,796 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 970 transitions. [2022-11-23 15:49:23,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 15:49:23,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:23,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:49:23,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 15:49:23,798 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:23,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:23,799 INFO L85 PathProgramCache]: Analyzing trace with hash 723421545, now seen corresponding path program 1 times [2022-11-23 15:49:23,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:23,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107827142] [2022-11-23 15:49:23,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:23,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:23,868 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-23 15:49:23,869 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:23,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107827142] [2022-11-23 15:49:23,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107827142] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:49:23,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853291711] [2022-11-23 15:49:23,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:23,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:49:23,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:49:23,871 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:49:23,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 15:49:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:24,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 15:49:24,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:49:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 15:49:24,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:49:24,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853291711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:49:24,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:49:24,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-23 15:49:24,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086312025] [2022-11-23 15:49:24,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:49:24,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:49:24,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:24,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:49:24,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:49:24,029 INFO L87 Difference]: Start difference. First operand 418 states and 970 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:24,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:24,141 INFO L93 Difference]: Finished difference Result 602 states and 1357 transitions. [2022-11-23 15:49:24,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:49:24,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-23 15:49:24,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:24,145 INFO L225 Difference]: With dead ends: 602 [2022-11-23 15:49:24,145 INFO L226 Difference]: Without dead ends: 602 [2022-11-23 15:49:24,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:49:24,146 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 26 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:49:24,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:49:24,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-11-23 15:49:24,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 484. [2022-11-23 15:49:24,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 477 states have (on average 2.291404612159329) internal successors, (1093), 483 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1093 transitions. [2022-11-23 15:49:24,164 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1093 transitions. Word has length 20 [2022-11-23 15:49:24,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:24,166 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 1093 transitions. [2022-11-23 15:49:24,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:24,167 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1093 transitions. [2022-11-23 15:49:24,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 15:49:24,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:24,168 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-23 15:49:24,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 15:49:24,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-23 15:49:24,375 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:24,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:24,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1210431682, now seen corresponding path program 1 times [2022-11-23 15:49:24,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:24,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885508545] [2022-11-23 15:49:24,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:24,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:24,545 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:49:24,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:24,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885508545] [2022-11-23 15:49:24,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885508545] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:49:24,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749010199] [2022-11-23 15:49:24,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:24,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:49:24,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:49:24,548 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:49:24,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 15:49:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:24,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 15:49:24,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:49:24,762 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:49:24,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:49:24,846 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:49:24,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749010199] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:49:24,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1533696216] [2022-11-23 15:49:24,848 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-23 15:49:24,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:49:24,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-11-23 15:49:24,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647533132] [2022-11-23 15:49:24,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:49:24,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 15:49:24,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:24,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 15:49:24,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-11-23 15:49:24,852 INFO L87 Difference]: Start difference. First operand 484 states and 1093 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:25,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:25,289 INFO L93 Difference]: Finished difference Result 1032 states and 2257 transitions. [2022-11-23 15:49:25,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 15:49:25,290 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-23 15:49:25,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:25,295 INFO L225 Difference]: With dead ends: 1032 [2022-11-23 15:49:25,295 INFO L226 Difference]: Without dead ends: 1032 [2022-11-23 15:49:25,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2022-11-23 15:49:25,296 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 202 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 15:49:25,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 0 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 15:49:25,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2022-11-23 15:49:25,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 696. [2022-11-23 15:49:25,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 689 states have (on average 2.294629898403483) internal successors, (1581), 695 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:25,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1581 transitions. [2022-11-23 15:49:25,323 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1581 transitions. Word has length 20 [2022-11-23 15:49:25,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:25,324 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 1581 transitions. [2022-11-23 15:49:25,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:25,324 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1581 transitions. [2022-11-23 15:49:25,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 15:49:25,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:25,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:49:25,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 15:49:25,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:49:25,533 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:25,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:25,534 INFO L85 PathProgramCache]: Analyzing trace with hash 992748458, now seen corresponding path program 1 times [2022-11-23 15:49:25,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:25,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499376708] [2022-11-23 15:49:25,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:25,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:26,572 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-23 15:49:26,572 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:26,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499376708] [2022-11-23 15:49:26,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499376708] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:49:26,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:49:26,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-23 15:49:26,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654425710] [2022-11-23 15:49:26,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:49:26,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 15:49:26,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:26,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 15:49:26,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-23 15:49:26,574 INFO L87 Difference]: Start difference. First operand 696 states and 1581 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:27,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:27,527 INFO L93 Difference]: Finished difference Result 832 states and 1871 transitions. [2022-11-23 15:49:27,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 15:49:27,528 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-23 15:49:27,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:27,532 INFO L225 Difference]: With dead ends: 832 [2022-11-23 15:49:27,533 INFO L226 Difference]: Without dead ends: 832 [2022-11-23 15:49:27,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-11-23 15:49:27,534 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 151 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 15:49:27,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 13 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 15:49:27,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2022-11-23 15:49:27,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 748. [2022-11-23 15:49:27,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 741 states have (on average 2.309041835357625) internal successors, (1711), 747 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:27,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1711 transitions. [2022-11-23 15:49:27,561 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1711 transitions. Word has length 21 [2022-11-23 15:49:27,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:27,562 INFO L495 AbstractCegarLoop]: Abstraction has 748 states and 1711 transitions. [2022-11-23 15:49:27,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:27,562 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1711 transitions. [2022-11-23 15:49:27,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 15:49:27,563 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:27,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:49:27,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-23 15:49:27,564 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:27,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:27,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1113889011, now seen corresponding path program 1 times [2022-11-23 15:49:27,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:27,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955457678] [2022-11-23 15:49:27,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:27,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:27,650 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-23 15:49:27,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:27,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955457678] [2022-11-23 15:49:27,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955457678] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:49:27,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007692434] [2022-11-23 15:49:27,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:27,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:49:27,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:49:27,653 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:49:27,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 15:49:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:27,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 15:49:27,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:49:27,827 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-23 15:49:27,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:49:27,854 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-23 15:49:27,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007692434] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:49:27,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [580836905] [2022-11-23 15:49:27,855 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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-23 15:49:27,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:49:27,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-23 15:49:27,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945057374] [2022-11-23 15:49:27,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:49:27,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 15:49:27,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:27,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 15:49:27,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:49:27,859 INFO L87 Difference]: Start difference. First operand 748 states and 1711 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:28,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:28,167 INFO L93 Difference]: Finished difference Result 1714 states and 3749 transitions. [2022-11-23 15:49:28,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:49:28,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-23 15:49:28,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:28,176 INFO L225 Difference]: With dead ends: 1714 [2022-11-23 15:49:28,177 INFO L226 Difference]: Without dead ends: 1714 [2022-11-23 15:49:28,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:49:28,178 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 104 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:49:28,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 5 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 15:49:28,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2022-11-23 15:49:28,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1666. [2022-11-23 15:49:28,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1659 states have (on average 2.234478601567209) internal successors, (3707), 1665 states have internal predecessors, (3707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 3707 transitions. [2022-11-23 15:49:28,237 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 3707 transitions. Word has length 23 [2022-11-23 15:49:28,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:28,237 INFO L495 AbstractCegarLoop]: Abstraction has 1666 states and 3707 transitions. [2022-11-23 15:49:28,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:28,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 3707 transitions. [2022-11-23 15:49:28,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 15:49:28,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:28,241 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:49:28,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 15:49:28,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 15:49:28,447 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:28,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:28,448 INFO L85 PathProgramCache]: Analyzing trace with hash 948669403, now seen corresponding path program 1 times [2022-11-23 15:49:28,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:28,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158545738] [2022-11-23 15:49:28,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:28,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:28,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 15:49:28,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:28,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158545738] [2022-11-23 15:49:28,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158545738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:49:28,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:49:28,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:49:28,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618585573] [2022-11-23 15:49:28,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:49:28,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:49:28,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:28,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:49:28,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:49:28,513 INFO L87 Difference]: Start difference. First operand 1666 states and 3707 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:28,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:28,629 INFO L93 Difference]: Finished difference Result 1840 states and 4017 transitions. [2022-11-23 15:49:28,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:49:28,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-23 15:49:28,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:28,641 INFO L225 Difference]: With dead ends: 1840 [2022-11-23 15:49:28,642 INFO L226 Difference]: Without dead ends: 1840 [2022-11-23 15:49:28,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:49:28,643 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1 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-23 15:49:28,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:49:28,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2022-11-23 15:49:28,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1600. [2022-11-23 15:49:28,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1593 states have (on average 2.1814187068424356) internal successors, (3475), 1599 states have internal predecessors, (3475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 3475 transitions. [2022-11-23 15:49:28,700 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 3475 transitions. Word has length 24 [2022-11-23 15:49:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:28,700 INFO L495 AbstractCegarLoop]: Abstraction has 1600 states and 3475 transitions. [2022-11-23 15:49:28,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:28,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 3475 transitions. [2022-11-23 15:49:28,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 15:49:28,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:28,706 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:49:28,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-23 15:49:28,707 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:28,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:28,707 INFO L85 PathProgramCache]: Analyzing trace with hash -173931243, now seen corresponding path program 1 times [2022-11-23 15:49:28,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:28,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699199579] [2022-11-23 15:49:28,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:28,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:29,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:49:29,439 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:29,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699199579] [2022-11-23 15:49:29,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699199579] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:49:29,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956835633] [2022-11-23 15:49:29,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:29,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:49:29,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:49:29,442 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:49:29,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 15:49:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:29,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-23 15:49:29,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:49:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:49:30,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:49:30,681 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:49:30,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2022-11-23 15:49:30,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:49:30,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956835633] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:49:30,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1536915503] [2022-11-23 15:49:30,884 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 15:49:30,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:49:30,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 33 [2022-11-23 15:49:30,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106899622] [2022-11-23 15:49:30,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:49:30,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-23 15:49:30,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:30,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-23 15:49:30,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2022-11-23 15:49:30,888 INFO L87 Difference]: Start difference. First operand 1600 states and 3475 transitions. Second operand has 35 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 34 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:36,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:36,036 INFO L93 Difference]: Finished difference Result 2796 states and 5955 transitions. [2022-11-23 15:49:36,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-23 15:49:36,037 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 34 states have internal predecessors, (72), 0 states have call successors, (0), 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 24 [2022-11-23 15:49:36,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:36,050 INFO L225 Difference]: With dead ends: 2796 [2022-11-23 15:49:36,051 INFO L226 Difference]: Without dead ends: 2796 [2022-11-23 15:49:36,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1643 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1337, Invalid=5635, Unknown=0, NotChecked=0, Total=6972 [2022-11-23 15:49:36,054 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 831 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2217 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-23 15:49:36,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 0 Invalid, 2259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2217 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-23 15:49:36,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states. [2022-11-23 15:49:36,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 1752. [2022-11-23 15:49:36,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1745 states have (on average 2.22865329512894) internal successors, (3889), 1751 states have internal predecessors, (3889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 3889 transitions. [2022-11-23 15:49:36,133 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 3889 transitions. Word has length 24 [2022-11-23 15:49:36,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:36,133 INFO L495 AbstractCegarLoop]: Abstraction has 1752 states and 3889 transitions. [2022-11-23 15:49:36,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 34 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:36,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 3889 transitions. [2022-11-23 15:49:36,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 15:49:36,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:36,137 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:49:36,143 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-23 15:49:36,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:49:36,343 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:36,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:36,343 INFO L85 PathProgramCache]: Analyzing trace with hash -173929930, now seen corresponding path program 1 times [2022-11-23 15:49:36,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:36,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511035418] [2022-11-23 15:49:36,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:36,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:49:36,529 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:36,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511035418] [2022-11-23 15:49:36,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511035418] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:49:36,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533909417] [2022-11-23 15:49:36,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:36,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:49:36,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:49:36,532 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:49:36,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 15:49:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:36,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 15:49:36,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:49:36,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:49:36,767 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:49:36,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533909417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:49:36,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:49:36,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-11-23 15:49:36,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498331325] [2022-11-23 15:49:36,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:49:36,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:49:36,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:36,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:49:36,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:49:36,770 INFO L87 Difference]: Start difference. First operand 1752 states and 3889 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:37,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:37,011 INFO L93 Difference]: Finished difference Result 1970 states and 4262 transitions. [2022-11-23 15:49:37,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:49:37,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-23 15:49:37,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:37,023 INFO L225 Difference]: With dead ends: 1970 [2022-11-23 15:49:37,023 INFO L226 Difference]: Without dead ends: 1970 [2022-11-23 15:49:37,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-23 15:49:37,024 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:49:37,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:49:37,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2022-11-23 15:49:37,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1802. [2022-11-23 15:49:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1795 states have (on average 2.2094707520891363) internal successors, (3966), 1801 states have internal predecessors, (3966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:37,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 3966 transitions. [2022-11-23 15:49:37,102 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 3966 transitions. Word has length 24 [2022-11-23 15:49:37,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:37,103 INFO L495 AbstractCegarLoop]: Abstraction has 1802 states and 3966 transitions. [2022-11-23 15:49:37,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:37,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 3966 transitions. [2022-11-23 15:49:37,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-23 15:49:37,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:37,106 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:49:37,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 15:49:37,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:49:37,319 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:37,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:37,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1136577317, now seen corresponding path program 2 times [2022-11-23 15:49:37,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:37,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847358012] [2022-11-23 15:49:37,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:37,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:37,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:49:37,891 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:37,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847358012] [2022-11-23 15:49:37,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847358012] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:49:37,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899675987] [2022-11-23 15:49:37,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:49:37,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:49:37,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:49:37,894 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:49:37,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 15:49:38,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 15:49:38,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:49:38,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-23 15:49:38,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:49:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 15:49:38,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:49:38,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899675987] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:49:38,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:49:38,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 22 [2022-11-23 15:49:38,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719870676] [2022-11-23 15:49:38,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:49:38,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-23 15:49:38,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:38,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-23 15:49:38,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2022-11-23 15:49:38,543 INFO L87 Difference]: Start difference. First operand 1802 states and 3966 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:39,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:39,988 INFO L93 Difference]: Finished difference Result 2356 states and 5079 transitions. [2022-11-23 15:49:39,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 15:49:39,988 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-23 15:49:39,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:40,002 INFO L225 Difference]: With dead ends: 2356 [2022-11-23 15:49:40,003 INFO L226 Difference]: Without dead ends: 2356 [2022-11-23 15:49:40,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=204, Invalid=1356, Unknown=0, NotChecked=0, Total=1560 [2022-11-23 15:49:40,004 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 250 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 15:49:40,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 0 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 15:49:40,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2022-11-23 15:49:40,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 1942. [2022-11-23 15:49:40,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1942 states, 1935 states have (on average 2.1891472868217052) internal successors, (4236), 1941 states have internal predecessors, (4236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 4236 transitions. [2022-11-23 15:49:40,102 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 4236 transitions. Word has length 26 [2022-11-23 15:49:40,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:40,103 INFO L495 AbstractCegarLoop]: Abstraction has 1942 states and 4236 transitions. [2022-11-23 15:49:40,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:40,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 4236 transitions. [2022-11-23 15:49:40,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 15:49:40,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:40,106 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2022-11-23 15:49:40,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 15:49:40,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-23 15:49:40,313 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:40,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:40,313 INFO L85 PathProgramCache]: Analyzing trace with hash -718385101, now seen corresponding path program 2 times [2022-11-23 15:49:40,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:40,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126976388] [2022-11-23 15:49:40,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:40,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:49:41,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:41,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126976388] [2022-11-23 15:49:41,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126976388] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:49:41,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531353110] [2022-11-23 15:49:41,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:49:41,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:49:41,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:49:41,368 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:49:41,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 15:49:41,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 15:49:41,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:49:41,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-23 15:49:41,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:49:41,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:49:41,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:49:41,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:49:41,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:49:41,626 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 15:49:41,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 31 [2022-11-23 15:49:41,691 INFO L321 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2022-11-23 15:49:41,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 30 treesize of output 44 [2022-11-23 15:49:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 15:49:42,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:49:43,298 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 15:49:43,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531353110] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:49:43,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [279186055] [2022-11-23 15:49:43,299 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-23 15:49:43,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:49:43,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 29 [2022-11-23 15:49:43,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658184198] [2022-11-23 15:49:43,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:49:43,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-23 15:49:43,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:43,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-23 15:49:43,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2022-11-23 15:49:43,303 INFO L87 Difference]: Start difference. First operand 1942 states and 4236 transitions. Second operand has 31 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:46,266 INFO L93 Difference]: Finished difference Result 2298 states and 4781 transitions. [2022-11-23 15:49:46,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 15:49:46,272 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 states have internal predecessors, (67), 0 states have call successors, (0), 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 27 [2022-11-23 15:49:46,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:46,281 INFO L225 Difference]: With dead ends: 2298 [2022-11-23 15:49:46,281 INFO L226 Difference]: Without dead ends: 2298 [2022-11-23 15:49:46,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=475, Invalid=1975, Unknown=0, NotChecked=0, Total=2450 [2022-11-23 15:49:46,285 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 756 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 2068 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 2108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-23 15:49:46,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 5 Invalid, 2108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2068 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-23 15:49:46,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2022-11-23 15:49:46,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 1554. [2022-11-23 15:49:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1549 states have (on average 2.120723047127179) internal successors, (3285), 1553 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:46,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 3285 transitions. [2022-11-23 15:49:46,363 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 3285 transitions. Word has length 27 [2022-11-23 15:49:46,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:46,363 INFO L495 AbstractCegarLoop]: Abstraction has 1554 states and 3285 transitions. [2022-11-23 15:49:46,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:46,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 3285 transitions. [2022-11-23 15:49:46,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 15:49:46,365 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:46,366 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:49:46,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-23 15:49:46,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-23 15:49:46,573 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:46,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:46,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1329011032, now seen corresponding path program 2 times [2022-11-23 15:49:46,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:46,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387291223] [2022-11-23 15:49:46,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:46,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:49:47,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:47,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387291223] [2022-11-23 15:49:47,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387291223] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:49:47,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204794189] [2022-11-23 15:49:47,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:49:47,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:49:47,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:49:47,832 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:49:47,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 15:49:47,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 15:49:47,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:49:48,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-23 15:49:48,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:49:48,021 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 15:49:48,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-23 15:49:48,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-23 15:49:48,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2022-11-23 15:49:49,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-11-23 15:49:51,392 WARN L859 $PredicateComparison]: unable to prove that (exists ((aux_div_v_arrayElimCell_14_58 Int) (aux_mod_v_arrayElimCell_14_58 Int)) (let ((.cse0 (* aux_div_v_arrayElimCell_14_58 4294967296))) (and (= |c_t2Thread1of1ForFork1_#t~ret44#1| (mod (+ (* 4294967295 aux_mod_v_arrayElimCell_14_58) 4294967295) 4294967296)) (<= 4294966496 aux_mod_v_arrayElimCell_14_58) (<= (+ aux_mod_v_arrayElimCell_14_58 4294967297 .cse0) 0) (< 0 (+ 8589934593 aux_mod_v_arrayElimCell_14_58 .cse0)) (< aux_mod_v_arrayElimCell_14_58 4294967296)))) is different from true [2022-11-23 15:49:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 15:49:51,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:49:51,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204794189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:49:51,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:49:51,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [16] total 30 [2022-11-23 15:49:51,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885409953] [2022-11-23 15:49:51,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:49:51,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 15:49:51,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:51,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 15:49:51,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=862, Unknown=1, NotChecked=58, Total=992 [2022-11-23 15:49:51,396 INFO L87 Difference]: Start difference. First operand 1554 states and 3285 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:58,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:58,888 INFO L93 Difference]: Finished difference Result 1926 states and 4024 transitions. [2022-11-23 15:49:58,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-23 15:49:58,889 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-23 15:49:58,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:49:58,896 INFO L225 Difference]: With dead ends: 1926 [2022-11-23 15:49:58,896 INFO L226 Difference]: Without dead ends: 1926 [2022-11-23 15:49:58,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=307, Invalid=2558, Unknown=1, NotChecked=104, Total=2970 [2022-11-23 15:49:58,898 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 283 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-23 15:49:58,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 0 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 916 Invalid, 0 Unknown, 112 Unchecked, 1.6s Time] [2022-11-23 15:49:58,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2022-11-23 15:49:58,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1585. [2022-11-23 15:49:58,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1580 states have (on average 2.1284810126582276) internal successors, (3363), 1584 states have internal predecessors, (3363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 3363 transitions. [2022-11-23 15:49:58,949 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 3363 transitions. Word has length 28 [2022-11-23 15:49:58,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:49:58,949 INFO L495 AbstractCegarLoop]: Abstraction has 1585 states and 3363 transitions. [2022-11-23 15:49:58,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:58,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 3363 transitions. [2022-11-23 15:49:58,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-23 15:49:58,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:49:58,952 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:49:58,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 15:49:59,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:49:59,158 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:49:59,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:49:59,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1750330925, now seen corresponding path program 1 times [2022-11-23 15:49:59,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:49:59,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224938702] [2022-11-23 15:49:59,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:59,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:49:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:59,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:49:59,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:49:59,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224938702] [2022-11-23 15:49:59,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224938702] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:49:59,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961123485] [2022-11-23 15:49:59,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:49:59,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:49:59,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:49:59,258 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:49:59,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 15:49:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:49:59,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 15:49:59,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:49:59,517 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:49:59,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:49:59,602 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:49:59,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961123485] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:49:59,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [851795793] [2022-11-23 15:49:59,603 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-23 15:49:59,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:49:59,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-11-23 15:49:59,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014251024] [2022-11-23 15:49:59,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:49:59,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 15:49:59,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:59,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 15:49:59,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-11-23 15:49:59,605 INFO L87 Difference]: Start difference. First operand 1585 states and 3363 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:49:59,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:49:59,985 INFO L93 Difference]: Finished difference Result 3400 states and 6627 transitions. [2022-11-23 15:49:59,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 15:49:59,986 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 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 29 [2022-11-23 15:49:59,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:00,025 INFO L225 Difference]: With dead ends: 3400 [2022-11-23 15:50:00,026 INFO L226 Difference]: Without dead ends: 3400 [2022-11-23 15:50:00,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-11-23 15:50:00,026 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 148 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:00,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 12 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 15:50:00,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2022-11-23 15:50:00,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3370. [2022-11-23 15:50:00,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3370 states, 3363 states have (on average 1.9643175735950045) internal successors, (6606), 3369 states have internal predecessors, (6606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 6606 transitions. [2022-11-23 15:50:00,128 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 6606 transitions. Word has length 29 [2022-11-23 15:50:00,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:00,128 INFO L495 AbstractCegarLoop]: Abstraction has 3370 states and 6606 transitions. [2022-11-23 15:50:00,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:00,128 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 6606 transitions. [2022-11-23 15:50:00,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-23 15:50:00,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:00,130 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:00,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 15:50:00,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:50:00,336 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:50:00,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:00,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1750331266, now seen corresponding path program 1 times [2022-11-23 15:50:00,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:50:00,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155575427] [2022-11-23 15:50:00,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:00,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:50:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:01,767 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:50:01,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:50:01,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155575427] [2022-11-23 15:50:01,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155575427] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:50:01,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252195148] [2022-11-23 15:50:01,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:01,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:50:01,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:50:01,769 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:50:01,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 15:50:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:01,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-23 15:50:01,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:50:02,004 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-11-23 15:50:02,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-11-23 15:50:02,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-23 15:50:03,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2022-11-23 15:50:03,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-11-23 15:50:05,997 WARN L859 $PredicateComparison]: unable to prove that (exists ((aux_div_v_arrayElimCell_19_58 Int) (aux_mod_v_arrayElimCell_19_58 Int)) (let ((.cse0 (* aux_div_v_arrayElimCell_19_58 4294967296))) (and (< aux_mod_v_arrayElimCell_19_58 4294967296) (<= (+ .cse0 aux_mod_v_arrayElimCell_19_58 4294967297) 0) (<= 4294966496 aux_mod_v_arrayElimCell_19_58) (= |c_t2Thread1of1ForFork1_#t~ret44#1| (mod (+ (* 4294967295 aux_mod_v_arrayElimCell_19_58) 4294967295) 4294967296)) (< 0 (+ 8589934593 .cse0 aux_mod_v_arrayElimCell_19_58))))) is different from true [2022-11-23 15:50:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:50:06,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:50:06,543 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_823 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_823) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) is different from false [2022-11-23 15:50:06,718 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_823 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_823) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) is different from false [2022-11-23 15:50:06,731 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:50:06,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-23 15:50:06,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:50:06,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 52 [2022-11-23 15:50:06,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-11-23 15:50:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-23 15:50:07,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252195148] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:50:07,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [907405080] [2022-11-23 15:50:07,201 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-23 15:50:07,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:50:07,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 14] total 46 [2022-11-23 15:50:07,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772437544] [2022-11-23 15:50:07,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:50:07,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-23 15:50:07,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:50:07,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-23 15:50:07,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1831, Unknown=9, NotChecked=264, Total=2256 [2022-11-23 15:50:07,205 INFO L87 Difference]: Start difference. First operand 3370 states and 6606 transitions. Second operand has 48 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:32,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:32,473 INFO L93 Difference]: Finished difference Result 6170 states and 11794 transitions. [2022-11-23 15:50:32,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-11-23 15:50:32,474 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 0 states have call successors, (0), 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 29 [2022-11-23 15:50:32,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:32,494 INFO L225 Difference]: With dead ends: 6170 [2022-11-23 15:50:32,494 INFO L226 Difference]: Without dead ends: 6170 [2022-11-23 15:50:32,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 120 ConstructedPredicates, 3 IntricatePredicates, 6 DeprecatedPredicates, 3821 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=1838, Invalid=12198, Unknown=18, NotChecked=708, Total=14762 [2022-11-23 15:50:32,499 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1012 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4891 mSolverCounterSat, 85 mSolverCounterUnsat, 68 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 4891 IncrementalHoareTripleChecker+Invalid, 68 IncrementalHoareTripleChecker+Unknown, 797 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:32,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 0 Invalid, 5841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 4891 Invalid, 68 Unknown, 797 Unchecked, 5.5s Time] [2022-11-23 15:50:32,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6170 states. [2022-11-23 15:50:32,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6170 to 3802. [2022-11-23 15:50:32,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3802 states, 3795 states have (on average 1.9696969696969697) internal successors, (7475), 3801 states have internal predecessors, (7475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:32,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3802 states to 3802 states and 7475 transitions. [2022-11-23 15:50:32,630 INFO L78 Accepts]: Start accepts. Automaton has 3802 states and 7475 transitions. Word has length 29 [2022-11-23 15:50:32,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:32,631 INFO L495 AbstractCegarLoop]: Abstraction has 3802 states and 7475 transitions. [2022-11-23 15:50:32,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:50:32,631 INFO L276 IsEmpty]: Start isEmpty. Operand 3802 states and 7475 transitions. [2022-11-23 15:50:32,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-23 15:50:32,633 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:32,633 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:32,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 15:50:32,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-23 15:50:32,846 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:50:32,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:32,847 INFO L85 PathProgramCache]: Analyzing trace with hash 254204856, now seen corresponding path program 2 times [2022-11-23 15:50:32,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:50:32,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622140883] [2022-11-23 15:50:32,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:32,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:50:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:50:34,393 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:50:34,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622140883] [2022-11-23 15:50:34,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622140883] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:50:34,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609145524] [2022-11-23 15:50:34,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:50:34,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:50:34,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:50:34,395 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:50:34,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 15:50:34,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 15:50:34,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:50:34,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-23 15:50:34,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:50:34,619 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-11-23 15:50:34,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-11-23 15:50:35,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-23 15:50:35,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-11-23 15:50:36,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-11-23 15:50:38,341 WARN L859 $PredicateComparison]: unable to prove that (exists ((aux_mod_v_arrayElimCell_27_58 Int) (aux_div_v_arrayElimCell_27_58 Int)) (let ((.cse0 (* aux_div_v_arrayElimCell_27_58 4294967296))) (and (= (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_27_58)) 4294967296) |c_t2Thread1of1ForFork1_#t~ret44#1|) (<= 4294966496 aux_mod_v_arrayElimCell_27_58) (< 0 (+ 8589934593 aux_mod_v_arrayElimCell_27_58 .cse0)) (< aux_mod_v_arrayElimCell_27_58 4294967296) (<= (+ aux_mod_v_arrayElimCell_27_58 4294967297 .cse0) 0)))) is different from true [2022-11-23 15:50:38,369 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 15:50:38,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:50:39,224 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_883) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-11-23 15:50:39,241 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:50:39,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-23 15:50:39,271 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:50:39,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 52 [2022-11-23 15:50:39,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-11-23 15:50:39,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 15:50:39,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609145524] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:50:39,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [113888701] [2022-11-23 15:50:39,782 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 15:50:39,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:50:39,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 44 [2022-11-23 15:50:39,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92233380] [2022-11-23 15:50:39,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:50:39,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-23 15:50:39,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:50:39,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-23 15:50:39,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1770, Unknown=2, NotChecked=170, Total=2070 [2022-11-23 15:50:39,785 INFO L87 Difference]: Start difference. First operand 3802 states and 7475 transitions. Second operand has 46 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 45 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:51:22,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:51:22,334 INFO L93 Difference]: Finished difference Result 6841 states and 13381 transitions. [2022-11-23 15:51:22,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-11-23 15:51:22,335 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 45 states have internal predecessors, (87), 0 states have call successors, (0), 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 29 [2022-11-23 15:51:22,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:51:22,358 INFO L225 Difference]: With dead ends: 6841 [2022-11-23 15:51:22,359 INFO L226 Difference]: Without dead ends: 6841 [2022-11-23 15:51:22,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 124 ConstructedPredicates, 2 IntricatePredicates, 7 DeprecatedPredicates, 3745 ImplicationChecksByTransitivity, 41.2s TimeCoverageRelationStatistics Valid=2188, Invalid=13066, Unknown=6, NotChecked=490, Total=15750 [2022-11-23 15:51:22,363 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1138 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4196 mSolverCounterSat, 88 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 4196 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 333 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-11-23 15:51:22,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 0 Invalid, 4644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 4196 Invalid, 27 Unknown, 333 Unchecked, 5.9s Time] [2022-11-23 15:51:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6841 states. [2022-11-23 15:51:22,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6841 to 3676. [2022-11-23 15:51:22,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3676 states, 3669 states have (on average 1.9593894794221858) internal successors, (7189), 3675 states have internal predecessors, (7189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:51:22,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3676 states to 3676 states and 7189 transitions. [2022-11-23 15:51:22,497 INFO L78 Accepts]: Start accepts. Automaton has 3676 states and 7189 transitions. Word has length 29 [2022-11-23 15:51:22,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:51:22,497 INFO L495 AbstractCegarLoop]: Abstraction has 3676 states and 7189 transitions. [2022-11-23 15:51:22,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 45 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:51:22,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3676 states and 7189 transitions. [2022-11-23 15:51:22,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 15:51:22,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:51:22,500 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:51:22,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-23 15:51:22,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-23 15:51:22,707 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:51:22,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:51:22,708 INFO L85 PathProgramCache]: Analyzing trace with hash -520424830, now seen corresponding path program 2 times [2022-11-23 15:51:22,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:51:22,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895051104] [2022-11-23 15:51:22,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:51:22,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:51:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:51:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:51:22,890 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:51:22,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895051104] [2022-11-23 15:51:22,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895051104] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:51:22,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913963058] [2022-11-23 15:51:22,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:51:22,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:51:22,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:51:22,892 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:51:22,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 15:51:23,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 15:51:23,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:51:23,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-23 15:51:23,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:51:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:51:23,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:51:23,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913963058] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:51:23,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:51:23,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2022-11-23 15:51:23,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193498706] [2022-11-23 15:51:23,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:51:23,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:51:23,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:51:23,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:51:23,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-23 15:51:23,213 INFO L87 Difference]: Start difference. First operand 3676 states and 7189 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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-23 15:51:23,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:51:23,563 INFO L93 Difference]: Finished difference Result 4274 states and 8302 transitions. [2022-11-23 15:51:23,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 15:51:23,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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 31 [2022-11-23 15:51:23,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:51:23,576 INFO L225 Difference]: With dead ends: 4274 [2022-11-23 15:51:23,576 INFO L226 Difference]: Without dead ends: 4274 [2022-11-23 15:51:23,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-11-23 15:51:23,578 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:51:23,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 15:51:23,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4274 states. [2022-11-23 15:51:23,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4274 to 3768. [2022-11-23 15:51:23,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3768 states, 3761 states have (on average 1.9657006115394842) internal successors, (7393), 3767 states have internal predecessors, (7393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:51:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3768 states to 3768 states and 7393 transitions. [2022-11-23 15:51:23,671 INFO L78 Accepts]: Start accepts. Automaton has 3768 states and 7393 transitions. Word has length 31 [2022-11-23 15:51:23,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:51:23,672 INFO L495 AbstractCegarLoop]: Abstraction has 3768 states and 7393 transitions. [2022-11-23 15:51:23,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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-23 15:51:23,672 INFO L276 IsEmpty]: Start isEmpty. Operand 3768 states and 7393 transitions. [2022-11-23 15:51:23,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 15:51:23,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:51:23,674 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:51:23,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 15:51:23,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:51:23,880 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:51:23,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:51:23,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1549235757, now seen corresponding path program 1 times [2022-11-23 15:51:23,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:51:23,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989399303] [2022-11-23 15:51:23,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:51:23,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:51:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:51:24,485 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 15:51:24,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:51:24,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989399303] [2022-11-23 15:51:24,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989399303] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:51:24,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441353715] [2022-11-23 15:51:24,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:51:24,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:51:24,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:51:24,488 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:51:24,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-23 15:51:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:51:24,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-23 15:51:24,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:51:25,367 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 15:51:25,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:51:26,083 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:51:26,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 41 [2022-11-23 15:51:26,305 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 15:51:26,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441353715] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:51:26,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1289295338] [2022-11-23 15:51:26,306 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-23 15:51:26,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:51:26,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 33 [2022-11-23 15:51:26,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375530905] [2022-11-23 15:51:26,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:51:26,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-23 15:51:26,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:51:26,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-23 15:51:26,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1069, Unknown=0, NotChecked=0, Total=1190 [2022-11-23 15:51:26,310 INFO L87 Difference]: Start difference. First operand 3768 states and 7393 transitions. Second operand has 35 states, 34 states have (on average 2.911764705882353) internal successors, (99), 34 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:51:31,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:51:31,674 INFO L93 Difference]: Finished difference Result 4926 states and 9480 transitions. [2022-11-23 15:51:31,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-23 15:51:31,675 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.911764705882353) internal successors, (99), 34 states have internal predecessors, (99), 0 states have call successors, (0), 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 34 [2022-11-23 15:51:31,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:51:31,691 INFO L225 Difference]: With dead ends: 4926 [2022-11-23 15:51:31,691 INFO L226 Difference]: Without dead ends: 4926 [2022-11-23 15:51:31,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=952, Invalid=3604, Unknown=0, NotChecked=0, Total=4556 [2022-11-23 15:51:31,693 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 512 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2587 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:51:31,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 0 Invalid, 2602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2587 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-23 15:51:31,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4926 states. [2022-11-23 15:51:31,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4926 to 3760. [2022-11-23 15:51:31,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3760 states, 3755 states have (on average 1.951531291611185) internal successors, (7328), 3759 states have internal predecessors, (7328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:51:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3760 states to 3760 states and 7328 transitions. [2022-11-23 15:51:31,798 INFO L78 Accepts]: Start accepts. Automaton has 3760 states and 7328 transitions. Word has length 34 [2022-11-23 15:51:31,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:51:31,798 INFO L495 AbstractCegarLoop]: Abstraction has 3760 states and 7328 transitions. [2022-11-23 15:51:31,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.911764705882353) internal successors, (99), 34 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:51:31,799 INFO L276 IsEmpty]: Start isEmpty. Operand 3760 states and 7328 transitions. [2022-11-23 15:51:31,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-23 15:51:31,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:51:31,801 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:51:31,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-23 15:51:32,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-23 15:51:32,009 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:51:32,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:51:32,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1537991814, now seen corresponding path program 1 times [2022-11-23 15:51:32,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:51:32,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475259680] [2022-11-23 15:51:32,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:51:32,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:51:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:51:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:51:34,751 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:51:34,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475259680] [2022-11-23 15:51:34,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475259680] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:51:34,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258448205] [2022-11-23 15:51:34,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:51:34,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:51:34,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:51:34,752 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:51:34,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-23 15:51:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:51:34,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-23 15:51:34,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:51:34,981 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 15:51:34,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-23 15:51:35,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-23 15:51:36,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:51:36,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2022-11-23 15:51:36,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-11-23 15:51:37,727 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:51:37,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 46 [2022-11-23 15:51:39,805 WARN L859 $PredicateComparison]: unable to prove that (exists ((aux_div_v_arrayElimCell_37_58 Int) (aux_mod_v_arrayElimCell_37_58 Int)) (let ((.cse0 (* aux_div_v_arrayElimCell_37_58 4294967296))) (and (= (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_37_58)) 4294967296) |c_t2Thread1of1ForFork1_#t~ret44#1|) (< 0 (+ 8589934593 aux_mod_v_arrayElimCell_37_58 .cse0)) (<= 4294966496 aux_mod_v_arrayElimCell_37_58) (< aux_mod_v_arrayElimCell_37_58 4294967296) (<= (+ aux_mod_v_arrayElimCell_37_58 4294967297 .cse0) 0)))) is different from true [2022-11-23 15:51:39,806 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-23 15:51:39,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:51:41,047 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1082 (Array Int Int)) (v_~top~0_251 Int)) (or (not (< 0 v_~top~0_251)) (< |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| v_~top~0_251) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1082) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* v_~top~0_251 4))) 4294967296))))) is different from false [2022-11-23 15:51:42,613 INFO L321 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2022-11-23 15:51:42,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 63 [2022-11-23 15:51:42,631 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:51:42,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 73 [2022-11-23 15:51:42,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2022-11-23 15:51:43,381 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-23 15:51:43,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258448205] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:51:43,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1036284654] [2022-11-23 15:51:43,382 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 15:51:43,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:51:43,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21, 21] total 68 [2022-11-23 15:51:43,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126904640] [2022-11-23 15:51:43,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:51:43,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-23 15:51:43,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:51:43,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-23 15:51:43,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=3966, Unknown=42, NotChecked=266, Total=4830 [2022-11-23 15:51:43,386 INFO L87 Difference]: Start difference. First operand 3760 states and 7328 transitions. Second operand has 70 states, 69 states have (on average 1.565217391304348) internal successors, (108), 69 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:52:16,203 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse15 (select .cse10 0))) (let ((.cse4 (* c_~top~0 4)) (.cse0 (= |c_~#m~0.offset| 0)) (.cse1 (<= 0 .cse15)) (.cse6 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|))) (.cse2 (<= .cse15 2147483647))) (let ((.cse8 (and .cse0 .cse1 .cse6 .cse2)) (.cse9 (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|)) (.cse3 (< .cse4 4)) (.cse12 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse5 (< c_~top~0 0))) (and (or (and .cse0 .cse1 (= (select |c_#length| |c_ULTIMATE.start_main_~#id2~0#1.base|) 4) .cse2) .cse3) (or (< (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse4) (+ |c_~#arr~0.offset| 1)) .cse5) (or .cse5 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296)))) (or .cse5 .cse6) (<= .cse4 4) (= |c_~#arr~0.offset| 0) (or .cse5 (< |c_~#arr~0.offset| (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| 1))) (or .cse3 (let ((.cse7 (select (select |c_#memory_int| |c_t2Thread1of1ForFork1_pop_~stack#1.base|) 0))) (and .cse0 (<= 0 .cse7) (<= .cse7 2147483647) (= |c_t2Thread1of1ForFork1_pop_~stack#1.base| |c_~#arr~0.base|)))) (or .cse3 .cse8) (or (< .cse9 4) .cse8) (forall ((v_ArrVal_1082 (Array Int Int)) (v_~top~0_251 Int) (v_ArrVal_1080 Int)) (or (not (< 0 v_~top~0_251)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse10 (+ .cse9 |c_~#arr~0.offset| 4) v_ArrVal_1080)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1082) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* v_~top~0_251 4))) 4294967296))) (< (+ |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 1) v_~top~0_251))) (or .cse5 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (or .cse3 (let ((.cse11 (select (select |c_#memory_int| |c_t2Thread1of1ForFork1_pop_#in~stack#1.base|) 0))) (and (<= 0 .cse11) (<= .cse11 2147483647)))) (<= .cse9 4) (or .cse3 (let ((.cse13 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork0_push_~stack#1.base|)) (.cse14 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and .cse0 (or .cse12 .cse13) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= .cse14 2147483647) (or (not .cse13) (and (<= 1 |c_t1Thread1of1ForFork0_push_#t~ret34#1|) (= (select |c_#length| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4))) (<= 0 .cse14) (not (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret34#1| 4)) 0))))) (= |c_t2Thread1of1ForFork1_pop_#in~stack#1.offset| 0) (forall ((v_ArrVal_1082 (Array Int Int)) (v_~top~0_251 Int) (v_ArrVal_1080 Int)) (or (not (< 0 v_~top~0_251)) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse10 (+ |c_~#arr~0.offset| .cse4 4) v_ArrVal_1080)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1082) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* v_~top~0_251 4))) 4294967296) 4294967294)) (< (+ c_~top~0 1) v_~top~0_251))) (or .cse12 .cse5)))))) is different from false [2022-11-23 15:52:31,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 15:52:37,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 15:52:48,817 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1082 (Array Int Int)) (v_~top~0_251 Int)) (or (not (< 0 v_~top~0_251)) (< c_~top~0 (+ v_~top~0_251 1)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1082) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* v_~top~0_251 4))) 4294967296))))) (forall ((v_~top~0_251 Int)) (or (not (< 0 v_~top~0_251)) (not (<= (+ v_~top~0_251 1) |c_t2Thread1of1ForFork1_dec_top_#t~post32#1|)) (not (= (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* v_~top~0_251 4))) 4294967296) 4294967294))))) is different from false [2022-11-23 15:53:04,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 15:53:26,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:53:26,040 INFO L93 Difference]: Finished difference Result 8345 states and 16177 transitions. [2022-11-23 15:53:26,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-11-23 15:53:26,040 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 1.565217391304348) internal successors, (108), 69 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-23 15:53:26,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:53:26,062 INFO L225 Difference]: With dead ends: 8345 [2022-11-23 15:53:26,062 INFO L226 Difference]: Without dead ends: 8345 [2022-11-23 15:53:26,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 28 SyntacticMatches, 13 SemanticMatches, 193 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 14358 ImplicationChecksByTransitivity, 82.2s TimeCoverageRelationStatistics Valid=5832, Invalid=30369, Unknown=105, NotChecked=1524, Total=37830 [2022-11-23 15:53:26,068 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1628 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9545 mSolverCounterSat, 232 mSolverCounterUnsat, 82 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 10442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 9545 IncrementalHoareTripleChecker+Invalid, 82 IncrementalHoareTripleChecker+Unknown, 583 IncrementalHoareTripleChecker+Unchecked, 27.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:53:26,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1628 Valid, 0 Invalid, 10442 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [232 Valid, 9545 Invalid, 82 Unknown, 583 Unchecked, 27.2s Time] [2022-11-23 15:53:26,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8345 states. [2022-11-23 15:53:26,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8345 to 5299. [2022-11-23 15:53:26,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5299 states, 5294 states have (on average 2.011144692104269) internal successors, (10647), 5298 states have internal predecessors, (10647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:53:26,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 10647 transitions. [2022-11-23 15:53:26,302 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 10647 transitions. Word has length 36 [2022-11-23 15:53:26,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:53:26,303 INFO L495 AbstractCegarLoop]: Abstraction has 5299 states and 10647 transitions. [2022-11-23 15:53:26,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 1.565217391304348) internal successors, (108), 69 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:53:26,303 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 10647 transitions. [2022-11-23 15:53:26,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-23 15:53:26,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:53:26,307 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2022-11-23 15:53:26,320 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-23 15:53:26,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-23 15:53:26,514 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:53:26,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:53:26,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1747712620, now seen corresponding path program 2 times [2022-11-23 15:53:26,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:53:26,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007515116] [2022-11-23 15:53:26,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:53:26,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:53:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:53:26,863 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 5 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:53:26,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:53:26,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007515116] [2022-11-23 15:53:26,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007515116] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:53:26,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104392411] [2022-11-23 15:53:26,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:53:26,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:53:26,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:53:26,868 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:53:26,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-23 15:53:27,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-23 15:53:27,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:53:27,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 15:53:27,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:53:27,367 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 5 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:53:27,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:53:27,666 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 5 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:53:27,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104392411] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:53:27,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1916796757] [2022-11-23 15:53:27,667 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-23 15:53:27,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:53:27,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 25 [2022-11-23 15:53:27,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492424148] [2022-11-23 15:53:27,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:53:27,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 15:53:27,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:53:27,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 15:53:27,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2022-11-23 15:53:27,670 INFO L87 Difference]: Start difference. First operand 5299 states and 10647 transitions. Second operand has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 25 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:53:28,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:53:28,656 INFO L93 Difference]: Finished difference Result 7501 states and 14786 transitions. [2022-11-23 15:53:28,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 15:53:28,656 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 25 states have internal predecessors, (90), 0 states have call successors, (0), 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 41 [2022-11-23 15:53:28,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:53:28,674 INFO L225 Difference]: With dead ends: 7501 [2022-11-23 15:53:28,675 INFO L226 Difference]: Without dead ends: 7501 [2022-11-23 15:53:28,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=409, Invalid=923, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 15:53:28,676 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 525 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 15:53:28,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 0 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 15:53:28,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7501 states. [2022-11-23 15:53:28,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7501 to 6069. [2022-11-23 15:53:28,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6069 states, 6064 states have (on average 2.005277044854881) internal successors, (12160), 6068 states have internal predecessors, (12160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:53:28,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6069 states to 6069 states and 12160 transitions. [2022-11-23 15:53:28,952 INFO L78 Accepts]: Start accepts. Automaton has 6069 states and 12160 transitions. Word has length 41 [2022-11-23 15:53:28,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:53:28,952 INFO L495 AbstractCegarLoop]: Abstraction has 6069 states and 12160 transitions. [2022-11-23 15:53:28,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 25 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:53:28,953 INFO L276 IsEmpty]: Start isEmpty. Operand 6069 states and 12160 transitions. [2022-11-23 15:53:28,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-23 15:53:28,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:53:28,959 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:53:28,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-23 15:53:29,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:53:29,168 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:53:29,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:53:29,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1557994776, now seen corresponding path program 2 times [2022-11-23 15:53:29,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:53:29,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678153958] [2022-11-23 15:53:29,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:53:29,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:53:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:53:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:53:31,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:53:31,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678153958] [2022-11-23 15:53:31,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678153958] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:53:31,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653053140] [2022-11-23 15:53:31,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:53:31,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:53:31,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:53:31,874 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:53:31,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-23 15:53:32,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 15:53:32,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:53:32,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 86 conjunts are in the unsatisfiable core [2022-11-23 15:53:32,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:53:32,143 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 15:53:32,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-23 15:53:32,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-23 15:53:33,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:53:33,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 40 [2022-11-23 15:53:34,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2022-11-23 15:53:35,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-11-23 15:53:37,789 WARN L859 $PredicateComparison]: unable to prove that (exists ((aux_div_v_arrayElimCell_45_58 Int) (aux_mod_v_arrayElimCell_45_58 Int)) (let ((.cse0 (* aux_div_v_arrayElimCell_45_58 4294967296))) (and (= |c_t2Thread1of1ForFork1_#t~ret44#1| (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_45_58)) 4294967296)) (< 0 (+ 8589934593 aux_mod_v_arrayElimCell_45_58 .cse0)) (< aux_mod_v_arrayElimCell_45_58 4294967296) (<= (+ aux_mod_v_arrayElimCell_45_58 4294967297 .cse0) 0) (<= 4294966496 aux_mod_v_arrayElimCell_45_58)))) is different from true [2022-11-23 15:53:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-23 15:53:37,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:53:38,978 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1252 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1252) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) is different from false [2022-11-23 15:53:42,905 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2022-11-23 15:53:42,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 60 [2022-11-23 15:53:42,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:53:42,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 70 [2022-11-23 15:53:42,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-11-23 15:53:47,698 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 13 refuted. 2 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-23 15:53:47,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653053140] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:53:47,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [84805686] [2022-11-23 15:53:47,699 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 15:53:47,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:53:47,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22, 21] total 70 [2022-11-23 15:53:47,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533726001] [2022-11-23 15:53:47,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:53:47,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-23 15:53:47,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:53:47,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-23 15:53:47,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=4517, Unknown=60, NotChecked=274, Total=5112 [2022-11-23 15:53:47,704 INFO L87 Difference]: Start difference. First operand 6069 states and 12160 transitions. Second operand has 72 states, 71 states have (on average 1.8169014084507042) internal successors, (129), 71 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:58:33,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:58:33,467 INFO L93 Difference]: Finished difference Result 11923 states and 23554 transitions. [2022-11-23 15:58:33,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2022-11-23 15:58:33,468 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 1.8169014084507042) internal successors, (129), 71 states have internal predecessors, (129), 0 states have call successors, (0), 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 43 [2022-11-23 15:58:33,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:58:33,490 INFO L225 Difference]: With dead ends: 11923 [2022-11-23 15:58:33,490 INFO L226 Difference]: Without dead ends: 11923 [2022-11-23 15:58:33,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 41 SyntacticMatches, 33 SemanticMatches, 305 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 38547 ImplicationChecksByTransitivity, 251.6s TimeCoverageRelationStatistics Valid=8353, Invalid=84277, Unknown=98, NotChecked=1214, Total=93942 [2022-11-23 15:58:33,513 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 3673 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15949 mSolverCounterSat, 462 mSolverCounterUnsat, 54 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3673 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 17046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 15949 IncrementalHoareTripleChecker+Invalid, 54 IncrementalHoareTripleChecker+Unknown, 581 IncrementalHoareTripleChecker+Unchecked, 48.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:58:33,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3673 Valid, 0 Invalid, 17046 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [462 Valid, 15949 Invalid, 54 Unknown, 581 Unchecked, 48.0s Time] [2022-11-23 15:58:33,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11923 states. [2022-11-23 15:58:33,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11923 to 6576. [2022-11-23 15:58:33,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6576 states, 6571 states have (on average 2.012022523208035) internal successors, (13221), 6575 states have internal predecessors, (13221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:58:33,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6576 states to 6576 states and 13221 transitions. [2022-11-23 15:58:33,819 INFO L78 Accepts]: Start accepts. Automaton has 6576 states and 13221 transitions. Word has length 43 [2022-11-23 15:58:33,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:58:33,820 INFO L495 AbstractCegarLoop]: Abstraction has 6576 states and 13221 transitions. [2022-11-23 15:58:33,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 1.8169014084507042) internal successors, (129), 71 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:58:33,820 INFO L276 IsEmpty]: Start isEmpty. Operand 6576 states and 13221 transitions. [2022-11-23 15:58:33,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-23 15:58:33,824 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:58:33,825 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:58:33,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-23 15:58:34,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-23 15:58:34,041 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:58:34,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:58:34,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1266883424, now seen corresponding path program 3 times [2022-11-23 15:58:34,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:58:34,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183151359] [2022-11-23 15:58:34,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:58:34,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:58:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:58:34,481 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 15:58:34,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:58:34,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183151359] [2022-11-23 15:58:34,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183151359] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:58:34,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661758211] [2022-11-23 15:58:34,482 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 15:58:34,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:58:34,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:58:34,484 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:58:34,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-23 15:58:34,722 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 15:58:34,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:58:34,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 15:58:34,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:58:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 15:58:34,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:58:35,004 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 15:58:35,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661758211] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:58:35,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1572086055] [2022-11-23 15:58:35,004 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-23 15:58:35,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:58:35,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 20 [2022-11-23 15:58:35,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145826388] [2022-11-23 15:58:35,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:58:35,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-23 15:58:35,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:58:35,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-23 15:58:35,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-11-23 15:58:35,007 INFO L87 Difference]: Start difference. First operand 6576 states and 13221 transitions. Second operand has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:58:35,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:58:35,901 INFO L93 Difference]: Finished difference Result 9466 states and 18759 transitions. [2022-11-23 15:58:35,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 15:58:35,902 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 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 45 [2022-11-23 15:58:35,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:58:35,916 INFO L225 Difference]: With dead ends: 9466 [2022-11-23 15:58:35,916 INFO L226 Difference]: Without dead ends: 9466 [2022-11-23 15:58:35,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=847, Unknown=0, NotChecked=0, Total=1122 [2022-11-23 15:58:35,917 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 299 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 15:58:35,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 0 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 15:58:35,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9466 states. [2022-11-23 15:58:36,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9466 to 7738. [2022-11-23 15:58:36,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7738 states, 7733 states have (on average 2.0217250743566533) internal successors, (15634), 7737 states have internal predecessors, (15634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:58:36,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7738 states to 7738 states and 15634 transitions. [2022-11-23 15:58:36,097 INFO L78 Accepts]: Start accepts. Automaton has 7738 states and 15634 transitions. Word has length 45 [2022-11-23 15:58:36,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:58:36,098 INFO L495 AbstractCegarLoop]: Abstraction has 7738 states and 15634 transitions. [2022-11-23 15:58:36,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:58:36,098 INFO L276 IsEmpty]: Start isEmpty. Operand 7738 states and 15634 transitions. [2022-11-23 15:58:36,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-23 15:58:36,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:58:36,155 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:58:36,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-23 15:58:36,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-23 15:58:36,355 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 15:58:36,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:58:36,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1676814406, now seen corresponding path program 3 times [2022-11-23 15:58:36,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:58:36,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368775401] [2022-11-23 15:58:36,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:58:36,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:58:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:58:40,981 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:58:40,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:58:40,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368775401] [2022-11-23 15:58:40,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368775401] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:58:40,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345628905] [2022-11-23 15:58:40,982 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 15:58:40,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:58:40,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:58:40,983 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:58:40,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588c5b7e-ce30-4c54-9233-f5cb145d2502/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-23 15:58:41,241 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 15:58:41,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:58:41,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 104 conjunts are in the unsatisfiable core [2022-11-23 15:58:41,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:58:41,263 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 15:58:41,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-23 15:58:41,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-23 15:58:42,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:58:42,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 43 [2022-11-23 15:58:43,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:58:43,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 43 [2022-11-23 15:58:43,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2022-11-23 15:58:45,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-11-23 15:58:48,001 WARN L859 $PredicateComparison]: unable to prove that (exists ((aux_div_v_arrayElimCell_54_58 Int) (aux_mod_v_arrayElimCell_54_58 Int)) (let ((.cse0 (* aux_div_v_arrayElimCell_54_58 4294967296))) (and (= (mod (+ (* 4294967295 aux_mod_v_arrayElimCell_54_58) 4294967295) 4294967296) |c_t2Thread1of1ForFork1_#t~ret44#1|) (<= (+ aux_mod_v_arrayElimCell_54_58 4294967297 .cse0) 0) (< 0 (+ 8589934593 aux_mod_v_arrayElimCell_54_58 .cse0)) (<= 4294966496 aux_mod_v_arrayElimCell_54_58) (< aux_mod_v_arrayElimCell_54_58 4294967296)))) is different from true [2022-11-23 15:58:48,002 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-23 15:58:48,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:59:12,357 INFO L321 Elim1Store]: treesize reduction 95, result has 47.2 percent of original size [2022-11-23 15:59:12,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 102 [2022-11-23 15:59:12,368 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:59:12,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:59:12,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 123 [2022-11-23 15:59:12,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-11-23 15:59:27,293 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 43 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:59:27,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345628905] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:59:27,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [906852813] [2022-11-23 15:59:27,294 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-23 15:59:27,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:59:27,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 27, 28] total 91 [2022-11-23 15:59:27,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551520931] [2022-11-23 15:59:27,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:59:27,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2022-11-23 15:59:27,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:59:27,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2022-11-23 15:59:27,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=7807, Unknown=76, NotChecked=180, Total=8556 [2022-11-23 15:59:27,299 INFO L87 Difference]: Start difference. First operand 7738 states and 15634 transitions. Second operand has 93 states, 92 states have (on average 1.6630434782608696) internal successors, (153), 92 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)