./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/stack_longest-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 63182f13 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/stack_longest-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5773bc320dd9dee5d943610df8c4ec3040864edddf388dd42a51d37167245e47 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-12 23:17:29,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-12 23:17:29,605 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-12 23:17:29,660 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-12 23:17:29,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-12 23:17:29,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-12 23:17:29,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-12 23:17:29,671 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-12 23:17:29,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-12 23:17:29,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-12 23:17:29,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-12 23:17:29,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-12 23:17:29,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-12 23:17:29,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-12 23:17:29,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-12 23:17:29,692 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-12 23:17:29,693 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-12 23:17:29,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-12 23:17:29,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-12 23:17:29,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-12 23:17:29,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-12 23:17:29,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-12 23:17:29,712 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-12 23:17:29,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-12 23:17:29,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-12 23:17:29,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-12 23:17:29,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-12 23:17:29,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-12 23:17:29,726 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-12 23:17:29,727 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-12 23:17:29,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-12 23:17:29,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-12 23:17:29,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-12 23:17:29,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-12 23:17:29,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-12 23:17:29,734 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-12 23:17:29,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-12 23:17:29,735 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-12 23:17:29,735 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-12 23:17:29,736 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-12 23:17:29,737 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-12 23:17:29,737 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-12 23:17:29,780 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-12 23:17:29,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-12 23:17:29,781 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-12 23:17:29,782 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-12 23:17:29,782 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-12 23:17:29,783 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-12 23:17:29,783 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-12 23:17:29,783 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-12 23:17:29,788 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-12 23:17:29,789 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-12 23:17:29,789 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-12 23:17:29,789 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-12 23:17:29,792 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-12 23:17:29,793 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-12 23:17:29,793 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-12 23:17:29,793 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-12 23:17:29,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-12 23:17:29,794 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-12 23:17:29,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-12 23:17:29,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-12 23:17:29,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-12 23:17:29,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-12 23:17:29,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-12 23:17:29,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-12 23:17:29,802 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-12 23:17:29,803 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-12 23:17:29,803 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-12 23:17:29,803 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-12 23:17:29,803 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-12 23:17:29,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-12 23:17:29,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-12 23:17:29,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-12 23:17:29,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-12 23:17:29,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-12 23:17:29,805 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-12 23:17:29,805 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-12 23:17:29,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-12 23:17:29,805 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-12 23:17:29,805 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-12 23:17:29,805 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-12 23:17:29,806 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/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_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF 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 ! call(reach_error())) ) 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 [2021-11-12 23:17:30,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-12 23:17:30,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-12 23:17:30,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-12 23:17:30,126 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-12 23:17:30,127 INFO L275 PluginConnector]: CDTParser initialized [2021-11-12 23:17:30,129 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/../../sv-benchmarks/c/pthread/stack_longest-2.i [2021-11-12 23:17:30,228 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/data/908690dd7/aef21de70f8b4908af1239636c7840da/FLAG06d0261da [2021-11-12 23:17:30,767 INFO L306 CDTParser]: Found 1 translation units. [2021-11-12 23:17:30,767 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/sv-benchmarks/c/pthread/stack_longest-2.i [2021-11-12 23:17:30,786 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/data/908690dd7/aef21de70f8b4908af1239636c7840da/FLAG06d0261da [2021-11-12 23:17:31,037 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/data/908690dd7/aef21de70f8b4908af1239636c7840da [2021-11-12 23:17:31,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-12 23:17:31,041 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-12 23:17:31,043 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-12 23:17:31,043 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-12 23:17:31,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-12 23:17:31,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:17:31" (1/1) ... [2021-11-12 23:17:31,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@112b67b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:17:31, skipping insertion in model container [2021-11-12 23:17:31,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:17:31" (1/1) ... [2021-11-12 23:17:31,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-12 23:17:31,120 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-12 23:17:31,762 WARN L228 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_59f48e9c-e56d-4e98-88bd-6231336693be/sv-benchmarks/c/pthread/stack_longest-2.i[41530,41543] [2021-11-12 23:17:31,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-12 23:17:31,818 INFO L203 MainTranslator]: Completed pre-run [2021-11-12 23:17:31,877 WARN L228 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_59f48e9c-e56d-4e98-88bd-6231336693be/sv-benchmarks/c/pthread/stack_longest-2.i[41530,41543] [2021-11-12 23:17:31,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-12 23:17:31,969 INFO L208 MainTranslator]: Completed translation [2021-11-12 23:17:31,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:17:31 WrapperNode [2021-11-12 23:17:31,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-12 23:17:31,971 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-12 23:17:31,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-12 23:17:31,972 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-12 23:17:31,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:17:31" (1/1) ... [2021-11-12 23:17:32,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:17:31" (1/1) ... [2021-11-12 23:17:32,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-12 23:17:32,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-12 23:17:32,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-12 23:17:32,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-12 23:17:32,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:17:31" (1/1) ... [2021-11-12 23:17:32,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:17:31" (1/1) ... [2021-11-12 23:17:32,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:17:31" (1/1) ... [2021-11-12 23:17:32,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:17:31" (1/1) ... [2021-11-12 23:17:32,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:17:31" (1/1) ... [2021-11-12 23:17:32,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:17:31" (1/1) ... [2021-11-12 23:17:32,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:17:31" (1/1) ... [2021-11-12 23:17:32,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-12 23:17:32,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-12 23:17:32,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-12 23:17:32,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-12 23:17:32,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:17:31" (1/1) ... [2021-11-12 23:17:32,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-12 23:17:32,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:17:32,134 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-12 23:17:32,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-12 23:17:32,194 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-11-12 23:17:32,196 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-11-12 23:17:32,196 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-11-12 23:17:32,197 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-11-12 23:17:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-12 23:17:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-12 23:17:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-12 23:17:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-12 23:17:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-12 23:17:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-12 23:17:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-12 23:17:32,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-12 23:17:32,200 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-12 23:17:32,712 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-12 23:17:32,712 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-12 23:17:32,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:17:32 BoogieIcfgContainer [2021-11-12 23:17:32,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-12 23:17:32,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-12 23:17:32,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-12 23:17:32,738 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-12 23:17:32,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 11:17:31" (1/3) ... [2021-11-12 23:17:32,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4186655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:17:32, skipping insertion in model container [2021-11-12 23:17:32,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:17:31" (2/3) ... [2021-11-12 23:17:32,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4186655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:17:32, skipping insertion in model container [2021-11-12 23:17:32,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:17:32" (3/3) ... [2021-11-12 23:17:32,741 INFO L111 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2021-11-12 23:17:32,746 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-12 23:17:32,760 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-12 23:17:32,761 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-12 23:17:32,761 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-12 23:17:32,832 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,834 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,835 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,835 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,836 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,836 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,856 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,857 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,857 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,857 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,858 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,858 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,858 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,859 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,859 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,859 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,860 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,860 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,861 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,861 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,862 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,877 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,878 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,878 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,879 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,879 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,879 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,879 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,879 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,879 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,880 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,880 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,880 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,880 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,880 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,880 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,881 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,881 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,881 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,881 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,881 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,881 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,882 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,882 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,882 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,882 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,883 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,883 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,883 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,883 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,883 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,883 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,884 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,884 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,884 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,884 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,884 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,885 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,885 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,885 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,885 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,885 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,886 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,886 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,886 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,886 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,886 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,886 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,886 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,887 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,887 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,887 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,887 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,887 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,887 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,888 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,888 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,888 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,890 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,890 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,890 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,890 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,891 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,891 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,891 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,891 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,892 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,892 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,892 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,895 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,895 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,896 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,896 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,896 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,896 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,897 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,897 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,897 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,897 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,901 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,901 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,901 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,901 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,901 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,902 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,902 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,905 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,905 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,906 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,906 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,906 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,906 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,907 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,907 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,907 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,908 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,908 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,908 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,908 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,910 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,911 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,911 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,911 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_inc_top_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,911 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_inc_top_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,912 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,912 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,912 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_inc_top_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,912 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_inc_top_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,913 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_inc_top_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,913 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_inc_top_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,914 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_inc_top_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,914 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_inc_top_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,914 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,914 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,916 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,918 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,919 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,919 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,919 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,919 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,920 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,920 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,921 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,921 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,921 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,922 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,922 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,922 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,922 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,922 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,923 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,923 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,923 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,924 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~nondet48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,924 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~nondet48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,924 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~nondet48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,924 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~nondet48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,925 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,928 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,929 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,929 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,929 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,929 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,929 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,930 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,930 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,930 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,930 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,930 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,930 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,931 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,931 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,931 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,931 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~ret41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,931 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,932 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,932 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,932 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,932 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~ret41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,932 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,932 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,933 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,933 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,933 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,933 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,933 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,933 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,934 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,934 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,934 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,934 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,934 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,935 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,935 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,935 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,935 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dec_top_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,935 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dec_top_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,935 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,936 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,936 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,936 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,936 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dec_top_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,936 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dec_top_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,937 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dec_top_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,937 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dec_top_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,937 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,937 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,937 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dec_top_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,937 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dec_top_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,938 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,938 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,938 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,938 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,938 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,939 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,939 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,939 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,939 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,939 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,940 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,940 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,940 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,940 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~ret41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,945 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,947 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~ret41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,948 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~ret41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,948 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~ret41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,948 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~ret41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,949 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,949 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,949 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,950 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~ret41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,950 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,950 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,951 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,951 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,951 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,952 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,952 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,952 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~ret41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,952 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~ret41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,952 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,953 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~ret41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,961 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,961 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~ret49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,961 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,962 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~nondet48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,962 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,962 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,963 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_dec_top_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,963 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,964 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,964 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,964 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,964 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,964 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,965 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,965 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_pop_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,969 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,969 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,969 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,970 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,970 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,970 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,970 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,970 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,971 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,971 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,971 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,971 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,971 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,972 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,972 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,972 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,972 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,972 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,973 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,973 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,973 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,973 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_inc_top_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,973 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:17:32,985 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-11-12 23:17:33,045 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-12 23:17:33,060 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-12 23:17:33,060 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-12 23:17:33,086 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-12 23:17:33,104 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 170 transitions, 356 flow [2021-11-12 23:17:33,107 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 170 transitions, 356 flow [2021-11-12 23:17:33,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 167 places, 170 transitions, 356 flow [2021-11-12 23:17:33,204 INFO L129 PetriNetUnfolder]: 10/168 cut-off events. [2021-11-12 23:17:33,205 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-11-12 23:17:33,213 INFO L84 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 168 events. 10/168 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 411 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 126. Up to 3 conditions per place. [2021-11-12 23:17:33,223 INFO L116 LiptonReduction]: Number of co-enabled transitions 8324 [2021-11-12 23:17:40,746 INFO L131 LiptonReduction]: Checked pairs total: 11210 [2021-11-12 23:17:40,747 INFO L133 LiptonReduction]: Total number of compositions: 162 [2021-11-12 23:17:40,756 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 37 transitions, 90 flow [2021-11-12 23:17:40,810 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 304 states, 301 states have (on average 2.681063122923588) internal successors, (807), 303 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:17:40,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 304 states, 301 states have (on average 2.681063122923588) internal successors, (807), 303 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:17:40,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-12 23:17:40,819 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:17:40,820 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-12 23:17:40,820 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-12 23:17:40,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:17:40,826 INFO L85 PathProgramCache]: Analyzing trace with hash -947993756, now seen corresponding path program 1 times [2021-11-12 23:17:40,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:17:40,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714907893] [2021-11-12 23:17:40,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:17:40,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:17:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:17:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:17:41,129 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:17:41,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714907893] [2021-11-12 23:17:41,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714907893] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:17:41,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:17:41,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-12 23:17:41,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546981357] [2021-11-12 23:17:41,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:17:41,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-12 23:17:41,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:17:41,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-12 23:17:41,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-12 23:17:41,170 INFO L87 Difference]: Start difference. First operand has 304 states, 301 states have (on average 2.681063122923588) internal successors, (807), 303 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:17:41,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:17:41,318 INFO L93 Difference]: Finished difference Result 456 states and 1169 transitions. [2021-11-12 23:17:41,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-12 23:17:41,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-12 23:17:41,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:17:41,345 INFO L225 Difference]: With dead ends: 456 [2021-11-12 23:17:41,346 INFO L226 Difference]: Without dead ends: 434 [2021-11-12 23:17:41,347 INFO L932 BasicCegarLoop]: 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 [2021-11-12 23:17:41,352 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 20 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.74ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 82.77ms IncrementalHoareTripleChecker+Time [2021-11-12 23:17:41,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 1 Invalid, 65 Unknown, 0 Unchecked, 2.74ms Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 82.77ms Time] [2021-11-12 23:17:41,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-11-12 23:17:41,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 410. [2021-11-12 23:17:41,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 406 states have (on average 2.6773399014778323) internal successors, (1087), 409 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:17:41,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1087 transitions. [2021-11-12 23:17:41,449 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1087 transitions. Word has length 6 [2021-11-12 23:17:41,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:17:41,449 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 1087 transitions. [2021-11-12 23:17:41,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:17:41,450 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1087 transitions. [2021-11-12 23:17:41,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-12 23:17:41,451 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:17:41,451 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:17:41,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-12 23:17:41,452 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-12 23:17:41,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:17:41,453 INFO L85 PathProgramCache]: Analyzing trace with hash -122722266, now seen corresponding path program 1 times [2021-11-12 23:17:41,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:17:41,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077308792] [2021-11-12 23:17:41,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:17:41,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:17:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:17:41,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:17:41,559 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:17:41,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077308792] [2021-11-12 23:17:41,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077308792] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:17:41,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:17:41,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-12 23:17:41,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571429323] [2021-11-12 23:17:41,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:17:41,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-12 23:17:41,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:17:41,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-12 23:17:41,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-12 23:17:41,562 INFO L87 Difference]: Start difference. First operand 410 states and 1087 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) [2021-11-12 23:17:41,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:17:41,669 INFO L93 Difference]: Finished difference Result 452 states and 1195 transitions. [2021-11-12 23:17:41,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-12 23:17:41,670 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 [2021-11-12 23:17:41,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:17:41,674 INFO L225 Difference]: With dead ends: 452 [2021-11-12 23:17:41,674 INFO L226 Difference]: Without dead ends: 452 [2021-11-12 23:17:41,674 INFO L932 BasicCegarLoop]: 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 [2021-11-12 23:17:41,676 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.44ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 89.17ms IncrementalHoareTripleChecker+Time [2021-11-12 23:17:41,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 4 Invalid, 70 Unknown, 0 Unchecked, 2.44ms Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 89.17ms Time] [2021-11-12 23:17:41,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-11-12 23:17:41,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2021-11-12 23:17:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 448 states have (on average 2.6674107142857144) internal successors, (1195), 451 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:17:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1195 transitions. [2021-11-12 23:17:41,706 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1195 transitions. Word has length 10 [2021-11-12 23:17:41,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:17:41,706 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 1195 transitions. [2021-11-12 23:17:41,706 INFO L471 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) [2021-11-12 23:17:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1195 transitions. [2021-11-12 23:17:41,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-12 23:17:41,708 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:17:41,708 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:17:41,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-12 23:17:41,709 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-12 23:17:41,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:17:41,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1000775458, now seen corresponding path program 1 times [2021-11-12 23:17:41,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:17:41,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122375572] [2021-11-12 23:17:41,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:17:41,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:17:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:17:41,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:17:41,789 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:17:41,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122375572] [2021-11-12 23:17:41,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122375572] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:17:41,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146457092] [2021-11-12 23:17:41,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:17:41,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:17:41,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:17:41,792 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:17:41,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-12 23:17:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:17:41,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-12 23:17:41,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:17:41,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:17:41,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:17:42,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:17:42,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146457092] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:17:42,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [151291782] [2021-11-12 23:17:42,072 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-12 23:17:42,073 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:17:42,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2021-11-12 23:17:42,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239181158] [2021-11-12 23:17:42,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:17:42,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-12 23:17:42,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:17:42,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-12 23:17:42,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-12 23:17:42,075 INFO L87 Difference]: Start difference. First operand 452 states and 1195 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:17:42,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:17:42,482 INFO L93 Difference]: Finished difference Result 1108 states and 2838 transitions. [2021-11-12 23:17:42,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-12 23:17:42,482 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have 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 [2021-11-12 23:17:42,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:17:42,492 INFO L225 Difference]: With dead ends: 1108 [2021-11-12 23:17:42,493 INFO L226 Difference]: Without dead ends: 1080 [2021-11-12 23:17:42,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:17:42,494 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 171 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 257.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.29ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 316.35ms IncrementalHoareTripleChecker+Time [2021-11-12 23:17:42,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 0 Invalid, 380 Unknown, 0 Unchecked, 4.29ms Time], IncrementalHoareTripleChecker [11 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 316.35ms Time] [2021-11-12 23:17:42,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2021-11-12 23:17:42,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 734. [2021-11-12 23:17:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 730 states have (on average 2.691780821917808) internal successors, (1965), 733 states have internal predecessors, (1965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:17:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1965 transitions. [2021-11-12 23:17:42,560 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1965 transitions. Word has length 13 [2021-11-12 23:17:42,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:17:42,561 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 1965 transitions. [2021-11-12 23:17:42,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:17:42,562 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1965 transitions. [2021-11-12 23:17:42,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-12 23:17:42,570 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:17:42,570 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:17:42,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-12 23:17:42,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:17:42,788 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-12 23:17:42,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:17:42,790 INFO L85 PathProgramCache]: Analyzing trace with hash -294380294, now seen corresponding path program 1 times [2021-11-12 23:17:42,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:17:42,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062809556] [2021-11-12 23:17:42,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:17:42,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:17:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:17:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:17:42,879 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:17:42,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062809556] [2021-11-12 23:17:42,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062809556] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:17:42,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:17:42,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-12 23:17:42,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496420887] [2021-11-12 23:17:42,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:17:42,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-12 23:17:42,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:17:42,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-12 23:17:42,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-12 23:17:42,882 INFO L87 Difference]: Start difference. First operand 734 states and 1965 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:17:42,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:17:42,945 INFO L93 Difference]: Finished difference Result 310 states and 698 transitions. [2021-11-12 23:17:42,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-12 23:17:42,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-12 23:17:42,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:17:42,948 INFO L225 Difference]: With dead ends: 310 [2021-11-12 23:17:42,949 INFO L226 Difference]: Without dead ends: 306 [2021-11-12 23:17:42,949 INFO L932 BasicCegarLoop]: 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 [2021-11-12 23:17:42,953 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 24 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.44ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.66ms IncrementalHoareTripleChecker+Time [2021-11-12 23:17:42,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 2 Invalid, 58 Unknown, 0 Unchecked, 0.44ms Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 56.66ms Time] [2021-11-12 23:17:42,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-11-12 23:17:42,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 282. [2021-11-12 23:17:42,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 280 states have (on average 2.2642857142857142) internal successors, (634), 281 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:17:42,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 634 transitions. [2021-11-12 23:17:42,969 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 634 transitions. Word has length 16 [2021-11-12 23:17:42,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:17:42,970 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 634 transitions. [2021-11-12 23:17:42,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:17:42,972 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 634 transitions. [2021-11-12 23:17:42,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-12 23:17:42,973 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:17:42,973 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:17:42,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-12 23:17:42,974 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-12 23:17:42,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:17:42,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1449650952, now seen corresponding path program 1 times [2021-11-12 23:17:42,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:17:42,975 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691676933] [2021-11-12 23:17:42,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:17:42,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:17:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:17:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:17:43,071 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:17:43,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691676933] [2021-11-12 23:17:43,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691676933] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:17:43,072 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:17:43,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-12 23:17:43,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745933116] [2021-11-12 23:17:43,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:17:43,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-12 23:17:43,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:17:43,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-12 23:17:43,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-12 23:17:43,074 INFO L87 Difference]: Start difference. First operand 282 states and 634 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) [2021-11-12 23:17:43,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:17:43,174 INFO L93 Difference]: Finished difference Result 342 states and 763 transitions. [2021-11-12 23:17:43,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-12 23:17:43,174 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 17 [2021-11-12 23:17:43,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:17:43,177 INFO L225 Difference]: With dead ends: 342 [2021-11-12 23:17:43,177 INFO L226 Difference]: Without dead ends: 340 [2021-11-12 23:17:43,178 INFO L932 BasicCegarLoop]: 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 [2021-11-12 23:17:43,179 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 19 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.56ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 92.34ms IncrementalHoareTripleChecker+Time [2021-11-12 23:17:43,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 1 Invalid, 80 Unknown, 0 Unchecked, 0.56ms Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 92.34ms Time] [2021-11-12 23:17:43,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-11-12 23:17:43,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 282. [2021-11-12 23:17:43,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 280 states have (on average 2.2714285714285714) internal successors, (636), 281 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:17:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 636 transitions. [2021-11-12 23:17:43,191 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 636 transitions. Word has length 17 [2021-11-12 23:17:43,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:17:43,191 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 636 transitions. [2021-11-12 23:17:43,192 INFO L471 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) [2021-11-12 23:17:43,192 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 636 transitions. [2021-11-12 23:17:43,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-12 23:17:43,193 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:17:43,193 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:17:43,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-12 23:17:43,194 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-12 23:17:43,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:17:43,195 INFO L85 PathProgramCache]: Analyzing trace with hash 50627632, now seen corresponding path program 1 times [2021-11-12 23:17:43,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:17:43,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8937565] [2021-11-12 23:17:43,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:17:43,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:17:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:17:43,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:17:43,601 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:17:43,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8937565] [2021-11-12 23:17:43,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8937565] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:17:43,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:17:43,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-12 23:17:43,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327759901] [2021-11-12 23:17:43,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:17:43,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-12 23:17:43,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:17:43,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-12 23:17:43,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-11-12 23:17:43,605 INFO L87 Difference]: Start difference. First operand 282 states and 636 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) [2021-11-12 23:17:44,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:17:44,218 INFO L93 Difference]: Finished difference Result 479 states and 1056 transitions. [2021-11-12 23:17:44,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-12 23:17:44,218 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 [2021-11-12 23:17:44,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:17:44,222 INFO L225 Difference]: With dead ends: 479 [2021-11-12 23:17:44,222 INFO L226 Difference]: Without dead ends: 434 [2021-11-12 23:17:44,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:17:44,223 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 120 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 366.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.74ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 427.83ms IncrementalHoareTripleChecker+Time [2021-11-12 23:17:44,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 20 Invalid, 350 Unknown, 0 Unchecked, 2.74ms Time], IncrementalHoareTripleChecker [11 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 427.83ms Time] [2021-11-12 23:17:44,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-11-12 23:17:44,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 336. [2021-11-12 23:17:44,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 334 states have (on average 2.2964071856287425) internal successors, (767), 335 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:17:44,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 767 transitions. [2021-11-12 23:17:44,237 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 767 transitions. Word has length 21 [2021-11-12 23:17:44,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:17:44,238 INFO L470 AbstractCegarLoop]: Abstraction has 336 states and 767 transitions. [2021-11-12 23:17:44,238 INFO L471 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) [2021-11-12 23:17:44,238 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 767 transitions. [2021-11-12 23:17:44,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-12 23:17:44,239 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:17:44,240 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:17:44,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-12 23:17:44,240 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-12 23:17:44,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:17:44,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1996967548, now seen corresponding path program 2 times [2021-11-12 23:17:44,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:17:44,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920612266] [2021-11-12 23:17:44,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:17:44,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:17:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:17:44,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:17:44,700 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:17:44,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920612266] [2021-11-12 23:17:44,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920612266] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:17:44,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:17:44,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-12 23:17:44,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170546061] [2021-11-12 23:17:44,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:17:44,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-12 23:17:44,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:17:44,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-12 23:17:44,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-12 23:17:44,702 INFO L87 Difference]: Start difference. First operand 336 states and 767 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) [2021-11-12 23:17:45,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:17:45,283 INFO L93 Difference]: Finished difference Result 502 states and 1110 transitions. [2021-11-12 23:17:45,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-12 23:17:45,288 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 [2021-11-12 23:17:45,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:17:45,291 INFO L225 Difference]: With dead ends: 502 [2021-11-12 23:17:45,291 INFO L226 Difference]: Without dead ends: 456 [2021-11-12 23:17:45,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:17:45,293 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 100 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 377.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.30ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 435.33ms IncrementalHoareTripleChecker+Time [2021-11-12 23:17:45,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 19 Invalid, 341 Unknown, 0 Unchecked, 2.30ms Time], IncrementalHoareTripleChecker [10 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 435.33ms Time] [2021-11-12 23:17:45,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-11-12 23:17:45,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 324. [2021-11-12 23:17:45,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 322 states have (on average 2.282608695652174) internal successors, (735), 323 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:17:45,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 735 transitions. [2021-11-12 23:17:45,307 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 735 transitions. Word has length 21 [2021-11-12 23:17:45,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:17:45,308 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 735 transitions. [2021-11-12 23:17:45,308 INFO L471 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) [2021-11-12 23:17:45,308 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 735 transitions. [2021-11-12 23:17:45,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-12 23:17:45,309 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:17:45,309 INFO L514 BasicCegarLoop]: 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] [2021-11-12 23:17:45,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-12 23:17:45,310 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-12 23:17:45,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:17:45,310 INFO L85 PathProgramCache]: Analyzing trace with hash 715495023, now seen corresponding path program 1 times [2021-11-12 23:17:45,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:17:45,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176171772] [2021-11-12 23:17:45,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:17:45,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:17:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:17:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:17:45,398 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:17:45,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176171772] [2021-11-12 23:17:45,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176171772] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:17:45,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245153404] [2021-11-12 23:17:45,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:17:45,399 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:17:45,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:17:45,400 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:17:45,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-12 23:17:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:17:45,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-12 23:17:45,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:17:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-12 23:17:45,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:17:45,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-12 23:17:45,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245153404] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-12 23:17:45,689 INFO L186 FreeRefinementEngine]: Found 2 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:17:45,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 11 [2021-11-12 23:17:45,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210191292] [2021-11-12 23:17:45,690 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-12 23:17:45,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-12 23:17:45,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:17:45,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-12 23:17:45,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-11-12 23:17:45,691 INFO L87 Difference]: Start difference. First operand 324 states and 735 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:17:45,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:17:45,990 INFO L93 Difference]: Finished difference Result 478 states and 1038 transitions. [2021-11-12 23:17:45,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-12 23:17:45,991 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-12 23:17:45,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:17:45,994 INFO L225 Difference]: With dead ends: 478 [2021-11-12 23:17:45,994 INFO L226 Difference]: Without dead ends: 466 [2021-11-12 23:17:45,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2021-11-12 23:17:45,995 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 194.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.89ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 234.43ms IncrementalHoareTripleChecker+Time [2021-11-12 23:17:45,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 364 Unknown, 0 Unchecked, 1.89ms Time], IncrementalHoareTripleChecker [9 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 234.43ms Time] [2021-11-12 23:17:45,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-11-12 23:17:46,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 378. [2021-11-12 23:17:46,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 376 states have (on average 2.25) internal successors, (846), 377 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:17:46,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 846 transitions. [2021-11-12 23:17:46,010 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 846 transitions. Word has length 24 [2021-11-12 23:17:46,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:17:46,010 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 846 transitions. [2021-11-12 23:17:46,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:17:46,011 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 846 transitions. [2021-11-12 23:17:46,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:17:46,012 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:17:46,012 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2021-11-12 23:17:46,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-12 23:17:46,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-11-12 23:17:46,228 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-12 23:17:46,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:17:46,229 INFO L85 PathProgramCache]: Analyzing trace with hash -232258018, now seen corresponding path program 2 times [2021-11-12 23:17:46,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:17:46,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117902711] [2021-11-12 23:17:46,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:17:46,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:17:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:17:46,365 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:17:46,366 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:17:46,366 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117902711] [2021-11-12 23:17:46,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117902711] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:17:46,366 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269188403] [2021-11-12 23:17:46,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-12 23:17:46,366 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:17:46,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:17:46,367 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:17:46,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-12 23:17:46,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-12 23:17:46,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:17:46,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-12 23:17:46,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:17:46,585 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:17:46,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:17:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:17:46,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269188403] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:17:46,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1742551785] [2021-11-12 23:17:46,702 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-12 23:17:46,703 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:17:46,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2021-11-12 23:17:46,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319746206] [2021-11-12 23:17:46,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:17:46,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-12 23:17:46,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:17:46,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-12 23:17:46,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2021-11-12 23:17:46,706 INFO L87 Difference]: Start difference. First operand 378 states and 846 transitions. Second operand has 20 states, 20 states have (on average 3.3) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:17:47,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:17:47,189 INFO L93 Difference]: Finished difference Result 880 states and 1887 transitions. [2021-11-12 23:17:47,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-12 23:17:47,190 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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 [2021-11-12 23:17:47,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:17:47,196 INFO L225 Difference]: With dead ends: 880 [2021-11-12 23:17:47,196 INFO L226 Difference]: Without dead ends: 880 [2021-11-12 23:17:47,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=237, Invalid=575, Unknown=0, NotChecked=0, Total=812 [2021-11-12 23:17:47,202 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 279 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 294.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.06ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 358.30ms IncrementalHoareTripleChecker+Time [2021-11-12 23:17:47,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 0 Invalid, 512 Unknown, 0 Unchecked, 3.06ms Time], IncrementalHoareTripleChecker [18 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 358.30ms Time] [2021-11-12 23:17:47,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2021-11-12 23:17:47,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 602. [2021-11-12 23:17:47,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 600 states have (on average 2.27) internal successors, (1362), 601 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:17:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1362 transitions. [2021-11-12 23:17:47,227 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1362 transitions. Word has length 27 [2021-11-12 23:17:47,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:17:47,227 INFO L470 AbstractCegarLoop]: Abstraction has 602 states and 1362 transitions. [2021-11-12 23:17:47,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:17:47,228 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1362 transitions. [2021-11-12 23:17:47,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-12 23:17:47,229 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:17:47,229 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:17:47,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-12 23:17:47,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-12 23:17:47,448 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-12 23:17:47,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:17:47,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1554545898, now seen corresponding path program 3 times [2021-11-12 23:17:47,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:17:47,449 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319016002] [2021-11-12 23:17:47,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:17:47,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:17:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:17:47,859 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-12 23:17:47,859 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:17:47,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319016002] [2021-11-12 23:17:47,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319016002] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:17:47,860 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:17:47,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-12 23:17:47,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280538671] [2021-11-12 23:17:47,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:17:47,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:17:47,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:17:47,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:17:47,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:17:47,861 INFO L87 Difference]: Start difference. First operand 602 states and 1362 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 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) [2021-11-12 23:17:49,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:17:49,088 INFO L93 Difference]: Finished difference Result 1215 states and 2713 transitions. [2021-11-12 23:17:49,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-12 23:17:49,089 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 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 [2021-11-12 23:17:49,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:17:49,097 INFO L225 Difference]: With dead ends: 1215 [2021-11-12 23:17:49,097 INFO L226 Difference]: Without dead ends: 1183 [2021-11-12 23:17:49,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2021-11-12 23:17:49,098 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 147 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 618.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.62ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 753.32ms IncrementalHoareTripleChecker+Time [2021-11-12 23:17:49,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 0 Invalid, 1133 Unknown, 0 Unchecked, 5.62ms Time], IncrementalHoareTripleChecker [30 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 753.32ms Time] [2021-11-12 23:17:49,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2021-11-12 23:17:49,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 722. [2021-11-12 23:17:49,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 720 states have (on average 2.370833333333333) internal successors, (1707), 721 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:17:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1707 transitions. [2021-11-12 23:17:49,129 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1707 transitions. Word has length 28 [2021-11-12 23:17:49,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:17:49,129 INFO L470 AbstractCegarLoop]: Abstraction has 722 states and 1707 transitions. [2021-11-12 23:17:49,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 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) [2021-11-12 23:17:49,130 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1707 transitions. [2021-11-12 23:17:49,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-12 23:17:49,131 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:17:49,131 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:17:49,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-12 23:17:49,132 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-12 23:17:49,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:17:49,132 INFO L85 PathProgramCache]: Analyzing trace with hash -244043574, now seen corresponding path program 4 times [2021-11-12 23:17:49,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:17:49,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650303803] [2021-11-12 23:17:49,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:17:49,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:17:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:17:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-12 23:17:49,537 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:17:49,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650303803] [2021-11-12 23:17:49,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650303803] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:17:49,538 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:17:49,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-12 23:17:49,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35845941] [2021-11-12 23:17:49,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:17:49,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-12 23:17:49,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:17:49,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-12 23:17:49,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-11-12 23:17:49,539 INFO L87 Difference]: Start difference. First operand 722 states and 1707 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) [2021-11-12 23:17:50,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:17:50,728 INFO L93 Difference]: Finished difference Result 914 states and 2095 transitions. [2021-11-12 23:17:50,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-12 23:17:50,729 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 [2021-11-12 23:17:50,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:17:50,735 INFO L225 Difference]: With dead ends: 914 [2021-11-12 23:17:50,736 INFO L226 Difference]: Without dead ends: 914 [2021-11-12 23:17:50,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=198, Invalid=924, Unknown=0, NotChecked=0, Total=1122 [2021-11-12 23:17:50,737 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 240 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 528.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.95ms SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 620.42ms IncrementalHoareTripleChecker+Time [2021-11-12 23:17:50,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 0 Invalid, 948 Unknown, 0 Unchecked, 4.95ms Time], IncrementalHoareTripleChecker [55 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 620.42ms Time] [2021-11-12 23:17:50,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2021-11-12 23:17:50,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 584. [2021-11-12 23:17:50,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 582 states have (on average 2.259450171821306) internal successors, (1315), 583 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:17:50,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1315 transitions. [2021-11-12 23:17:50,760 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1315 transitions. Word has length 28 [2021-11-12 23:17:50,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:17:50,761 INFO L470 AbstractCegarLoop]: Abstraction has 584 states and 1315 transitions. [2021-11-12 23:17:50,761 INFO L471 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) [2021-11-12 23:17:50,761 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1315 transitions. [2021-11-12 23:17:50,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-12 23:17:50,763 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:17:50,763 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:17:50,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-12 23:17:50,763 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-12 23:17:50,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:17:50,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1128988441, now seen corresponding path program 1 times [2021-11-12 23:17:50,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:17:50,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176918509] [2021-11-12 23:17:50,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:17:50,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:17:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:17:51,550 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:17:51,550 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:17:51,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176918509] [2021-11-12 23:17:51,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176918509] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:17:51,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021713372] [2021-11-12 23:17:51,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:17:51,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:17:51,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:17:51,551 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:17:51,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-12 23:17:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:17:51,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 69 conjunts are in the unsatisfiable core [2021-11-12 23:17:51,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:17:51,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-12 23:17:52,169 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-12 23:17:52,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2021-11-12 23:17:52,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2021-11-12 23:17:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:17:52,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:17:54,896 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_99| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) is different from false [2021-11-12 23:18:06,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2021-11-12 23:18:07,181 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-12 23:18:07,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021713372] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:18:07,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [551023316] [2021-11-12 23:18:07,183 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-12 23:18:07,185 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:18:07,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 17] total 51 [2021-11-12 23:18:07,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726354991] [2021-11-12 23:18:07,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:18:07,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-11-12 23:18:07,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:18:07,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-11-12 23:18:07,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2367, Unknown=1, NotChecked=98, Total=2652 [2021-11-12 23:18:07,192 INFO L87 Difference]: Start difference. First operand 584 states and 1315 transitions. Second operand has 52 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 52 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:18:08,469 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ .cse3 (- 4)))) (.cse0 (select .cse2 0))) (and (= c_~top~0 0) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse0 799) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork1_push_~x#1|) (<= 0 .cse1) (not (= 4294967294 (mod (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))) 4294967296))) (<= .cse1 799) (<= c_~top~0 1) (<= 0 .cse0) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_99| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (not (= 4294967294 (mod (select .cse2 (+ |c_~#arr~0.offset| (* |c_t2Thread1of1ForFork0_dec_top_#t~post34#1| 4) (- 8))) 4294967296))) (<= |c_t1Thread1of1ForFork1_push_~x#1| 799)))) is different from false [2021-11-12 23:18:09,228 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ (* c_~top~0 4) (- 4))))) (and (= c_~top~0 0) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork1_push_~x#1|) (<= 0 .cse0) (<= .cse0 799) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_99| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (<= |c_t1Thread1of1ForFork1_push_~x#1| 799))) is different from false [2021-11-12 23:18:10,864 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ .cse3 (- 4)))) (.cse0 (select .cse2 0))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse0 799) (= |c_~#arr~0.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (= c_~top~0 1) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (<= 0 .cse1) (not (= 4294967294 (mod (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))) 4294967296))) (<= .cse1 799) (<= c_~top~0 1) (<= 0 .cse0) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_99| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))))))) is different from false [2021-11-12 23:18:11,741 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ (* c_~top~0 4) (- 4)))) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) 0))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse0 799) (= |c_~#arr~0.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (= c_~top~0 1) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (<= 0 .cse1) (<= .cse1 799) (<= c_~top~0 1) (<= 0 .cse0) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_99| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))))) is different from false [2021-11-12 23:18:14,271 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse1 (select .cse0 0))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select .cse0 (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (<= .cse1 799) (= |c_~#arr~0.offset| 0) (= c_~top~0 2) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (<= 0 .cse1) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_99| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))))))) is different from false [2021-11-12 23:18:15,496 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_99| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))))) is different from false [2021-11-12 23:18:57,405 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select .cse0 (+ |c_~#arr~0.offset| .cse1 (- 4))) 4294967296) 4294967294)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (or (let ((.cse2 (select .cse0 (+ .cse1 (- 4))))) (and (= |c_~#arr~0.offset| 0) (<= .cse2 799) (<= 0 .cse2))) (<= c_~top~0 0)) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_99| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))))) is different from false [2021-11-12 23:18:58,183 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select .cse0 (+ |c_~#arr~0.offset| .cse1 (- 4))) 4294967296) 4294967294)) (= |c_~#arr~0.offset| 0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (or (let ((.cse2 (select .cse0 (+ .cse1 (- 8))))) (and (<= .cse2 799) (<= 0 .cse2))) (< (* 4 c_~top~0) 8)) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_99| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))))) is different from false [2021-11-12 23:19:00,638 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select .cse0 (+ |c_~#arr~0.offset| .cse1 (- 4))) 4294967296) 4294967294)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (not (= 4294967294 (mod (select .cse0 (+ |c_~#arr~0.offset| .cse1 (- 8))) 4294967296))) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_99| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))))) is different from false [2021-11-12 23:19:03,352 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4)) (.cse0 (* 4 c_~top~0))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (or (< .cse0 4) (let ((.cse1 (select .cse2 (+ .cse3 (- 4))))) (and (<= .cse1 799) (<= 0 .cse1)))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 4))) 4294967296) 4294967294)) (= |c_~#arr~0.offset| 0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (or (let ((.cse4 (select .cse2 (+ .cse3 (- 8))))) (and (<= .cse4 799) (<= 0 .cse4))) (< .cse0 8)) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_99| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))))) is different from false [2021-11-12 23:19:04,467 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~top~0 4))) (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (+ .cse1 (- 4)))) (let ((.cse7 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) .cse5)) (.cse2 (select .cse0 0)) (.cse3 (= |c_~#arr~0.offset| 0)) (.cse6 (* 4 c_~top~0))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select .cse0 (+ |c_~#arr~0.offset| .cse1)) 4294967296) 4294967294)) (<= .cse2 799) .cse3 (or (let ((.cse4 (select .cse0 .cse5))) (and .cse3 (<= .cse4 799) (<= 0 .cse4))) (< .cse6 4)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_t2Thread1of1ForFork0_pop_~stack#1.base|) (+ .cse1 |c_t2Thread1of1ForFork0_pop_~stack#1.offset|)) 4294967296))) (= |c_t2Thread1of1ForFork0_pop_#in~stack#1.offset| 0) (= c_~top~0 1) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (<= 0 .cse7) (<= .cse7 799) (<= c_~top~0 1) (<= 0 .cse2) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_99| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (or (let ((.cse8 (select .cse0 (+ .cse1 (- 8))))) (and (<= .cse8 799) .cse3 (<= 0 .cse8))) (< .cse6 8)) (= |c_t2Thread1of1ForFork0_pop_~stack#1.offset| 0))))) is different from false [2021-11-12 23:19:13,710 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select .cse0 (+ |c_~#arr~0.offset| .cse1 (- 4))) 4294967296) 4294967294)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (or (let ((.cse2 (select .cse0 (+ .cse1 (- 4))))) (and (= |c_~#arr~0.offset| 0) (<= .cse2 799) (<= 0 .cse2))) (<= c_~top~0 0)) (not (= 4294967294 (mod (select .cse0 (+ |c_~#arr~0.offset| .cse1 (- 8))) 4294967296))) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_99| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))))) is different from false [2021-11-12 23:19:20,728 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~top~0 4))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse0 (- 4))) 4294967296) 4294967294)) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_t2Thread1of1ForFork0_pop_~stack#1.base|) (+ .cse0 |c_t2Thread1of1ForFork0_pop_~stack#1.offset|)) 4294967296))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_99| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))))) is different from false [2021-11-12 23:19:23,579 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select .cse0 (+ |c_~#arr~0.offset| .cse1 (- 4))) 4294967296) 4294967294)) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_t2Thread1of1ForFork0_pop_~stack#1.base|) (+ .cse1 |c_t2Thread1of1ForFork0_pop_~stack#1.offset|)) 4294967296))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (or (let ((.cse2 (select .cse0 (+ .cse1 (- 4))))) (and (= |c_~#arr~0.offset| 0) (<= .cse2 799) (<= 0 .cse2))) (<= c_~top~0 0)) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_99| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_99| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))))) is different from false [2021-11-12 23:19:23,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:19:23,663 INFO L93 Difference]: Finished difference Result 2338 states and 5094 transitions. [2021-11-12 23:19:23,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2021-11-12 23:19:23,663 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 52 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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 [2021-11-12 23:19:23,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:19:23,677 INFO L225 Difference]: With dead ends: 2338 [2021-11-12 23:19:23,677 INFO L226 Difference]: Without dead ends: 2221 [2021-11-12 23:19:23,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 152 ConstructedPredicates, 15 IntricatePredicates, 2 DeprecatedPredicates, 5733 ImplicationChecksByTransitivity, 86.8s TimeCoverageRelationStatistics Valid=1537, Invalid=17644, Unknown=61, NotChecked=4320, Total=23562 [2021-11-12 23:19:23,686 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 589 mSDsluCounter, 2758 mSDsCounter, 0 mSdLazyCounter, 6003 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3689.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 27.62ms SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 6003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1789 IncrementalHoareTripleChecker+Unchecked, 4342.96ms IncrementalHoareTripleChecker+Time [2021-11-12 23:19:23,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [589 Valid, 0 Invalid, 7857 Unknown, 0 Unchecked, 27.62ms Time], IncrementalHoareTripleChecker [65 Valid, 6003 Invalid, 0 Unknown, 1789 Unchecked, 4342.96ms Time] [2021-11-12 23:19:23,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2021-11-12 23:19:23,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 1261. [2021-11-12 23:19:23,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1259 states have (on average 2.409054805401112) internal successors, (3033), 1260 states have internal predecessors, (3033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:23,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 3033 transitions. [2021-11-12 23:19:23,734 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 3033 transitions. Word has length 36 [2021-11-12 23:19:23,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:19:23,734 INFO L470 AbstractCegarLoop]: Abstraction has 1261 states and 3033 transitions. [2021-11-12 23:19:23,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 52 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:23,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 3033 transitions. [2021-11-12 23:19:23,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-12 23:19:23,737 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:19:23,738 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:19:23,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-12 23:19:23,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-12 23:19:23,953 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-12 23:19:23,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:19:23,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1451251639, now seen corresponding path program 2 times [2021-11-12 23:19:23,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:19:23,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702994217] [2021-11-12 23:19:23,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:19:23,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:19:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:19:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:19:24,793 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:19:24,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702994217] [2021-11-12 23:19:24,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702994217] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:19:24,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335184697] [2021-11-12 23:19:24,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-12 23:19:24,793 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:19:24,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:19:24,797 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:19:24,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-12 23:19:24,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-12 23:19:24,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:19:24,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 69 conjunts are in the unsatisfiable core [2021-11-12 23:19:24,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:19:25,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-12 23:19:25,428 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-12 23:19:25,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2021-11-12 23:19:26,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2021-11-12 23:19:26,090 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:19:26,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:19:27,940 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_push_#t~ret38#1_105| Int) (|t1Thread1of1ForFork1_push_~x#1| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| c_~top~0))) is different from false [2021-11-12 23:19:44,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2021-11-12 23:19:44,746 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-12 23:19:44,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335184697] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:19:44,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [227907457] [2021-11-12 23:19:44,748 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-12 23:19:44,749 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:19:44,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 17] total 51 [2021-11-12 23:19:44,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738017850] [2021-11-12 23:19:44,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:19:44,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-11-12 23:19:44,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:19:44,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-11-12 23:19:44,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2369, Unknown=1, NotChecked=98, Total=2652 [2021-11-12 23:19:44,753 INFO L87 Difference]: Start difference. First operand 1261 states and 3033 transitions. Second operand has 52 states, 51 states have (on average 1.9215686274509804) internal successors, (98), 52 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:19:46,148 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ .cse3 (- 4)))) (.cse0 (select .cse2 0))) (and (= c_~top~0 0) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse0 799) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork1_push_~x#1|) (<= 0 .cse1) (not (= 4294967294 (mod (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))) 4294967296))) (<= .cse1 799) (<= c_~top~0 1) (<= 0 .cse0) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret38#1_105| Int) (|t1Thread1of1ForFork1_push_~x#1| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| c_~top~0))) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0) (not (= 4294967294 (mod (select .cse2 (+ |c_~#arr~0.offset| (* |c_t2Thread1of1ForFork0_dec_top_#t~post34#1| 4) (- 8))) 4294967296))) (<= |c_t1Thread1of1ForFork1_push_~x#1| 799)))) is different from false [2021-11-12 23:19:46,894 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ (* c_~top~0 4) (- 4))))) (and (= c_~top~0 0) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork1_push_~x#1|) (<= 0 .cse0) (<= .cse0 799) (<= c_~top~0 1) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret38#1_105| Int) (|t1Thread1of1ForFork1_push_~x#1| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| c_~top~0))) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0) (<= |c_t1Thread1of1ForFork1_push_~x#1| 799))) is different from false [2021-11-12 23:19:48,379 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ .cse3 (- 4)))) (.cse0 (select .cse2 0))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse0 799) (= |c_~#arr~0.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (= c_~top~0 1) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (<= 0 .cse1) (not (= 4294967294 (mod (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))) 4294967296))) (<= .cse1 799) (<= c_~top~0 1) (<= 0 .cse0) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret38#1_105| Int) (|t1Thread1of1ForFork1_push_~x#1| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| c_~top~0))) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0)))) is different from false [2021-11-12 23:19:49,168 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ (* c_~top~0 4) (- 4)))) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) 0))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse0 799) (= |c_~#arr~0.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (= c_~top~0 1) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (<= 0 .cse1) (<= .cse1 799) (<= c_~top~0 1) (<= 0 .cse0) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret38#1_105| Int) (|t1Thread1of1ForFork1_push_~x#1| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| c_~top~0))) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0))) is different from false [2021-11-12 23:19:50,063 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ (* c_~top~0 4) (- 4)))) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) 0))) (and (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse0 799) (= |c_~#arr~0.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (= c_~top~0 1) (<= 0 .cse1) (<= .cse1 799) (<= c_~top~0 1) (<= 0 .cse0) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret38#1_105| Int) (|t1Thread1of1ForFork1_push_~x#1| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| c_~top~0))) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0))) is different from false [2021-11-12 23:19:52,403 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse1 (select .cse0 0))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select .cse0 (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (<= .cse1 799) (= |c_~#arr~0.offset| 0) (= c_~top~0 2) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret38#1_105| Int) (|t1Thread1of1ForFork1_push_~x#1| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| c_~top~0)))))) is different from false [2021-11-12 23:19:53,784 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret38#1_105| Int) (|t1Thread1of1ForFork1_push_~x#1| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| c_~top~0)))) is different from false [2021-11-12 23:20:36,896 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select .cse0 (+ |c_~#arr~0.offset| .cse1 (- 4))) 4294967296) 4294967294)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (or (let ((.cse2 (select .cse0 (+ .cse1 (- 4))))) (and (= |c_~#arr~0.offset| 0) (<= .cse2 799) (<= 0 .cse2))) (<= c_~top~0 0)) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret38#1_105| Int) (|t1Thread1of1ForFork1_push_~x#1| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| c_~top~0))))) is different from false [2021-11-12 23:20:37,665 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select .cse0 (+ |c_~#arr~0.offset| .cse1 (- 4))) 4294967296) 4294967294)) (= |c_~#arr~0.offset| 0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (or (let ((.cse2 (select .cse0 (+ .cse1 (- 8))))) (and (<= .cse2 799) (<= 0 .cse2))) (< (* 4 c_~top~0) 8)) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret38#1_105| Int) (|t1Thread1of1ForFork1_push_~x#1| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| c_~top~0))))) is different from false [2021-11-12 23:20:41,465 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select .cse0 (+ |c_~#arr~0.offset| .cse1 (- 4))) 4294967296) 4294967294)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (not (= 4294967294 (mod (select .cse0 (+ |c_~#arr~0.offset| .cse1 (- 8))) 4294967296))) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret38#1_105| Int) (|t1Thread1of1ForFork1_push_~x#1| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| c_~top~0))))) is different from false [2021-11-12 23:20:44,017 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4)) (.cse0 (* 4 c_~top~0))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (or (< .cse0 4) (let ((.cse1 (select .cse2 (+ .cse3 (- 4))))) (and (<= .cse1 799) (<= 0 .cse1)))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 4))) 4294967296) 4294967294)) (= |c_~#arr~0.offset| 0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (or (let ((.cse4 (select .cse2 (+ .cse3 (- 8))))) (and (<= .cse4 799) (<= 0 .cse4))) (< .cse0 8)) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret38#1_105| Int) (|t1Thread1of1ForFork1_push_~x#1| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| c_~top~0))))) is different from false [2021-11-12 23:20:46,073 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~top~0 4))) (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (+ .cse1 (- 4)))) (let ((.cse7 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) .cse5)) (.cse2 (select .cse0 0)) (.cse3 (= |c_~#arr~0.offset| 0)) (.cse6 (* 4 c_~top~0))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select .cse0 (+ |c_~#arr~0.offset| .cse1)) 4294967296) 4294967294)) (<= .cse2 799) .cse3 (or (let ((.cse4 (select .cse0 .cse5))) (and .cse3 (<= .cse4 799) (<= 0 .cse4))) (< .cse6 4)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_t2Thread1of1ForFork0_pop_~stack#1.base|) (+ .cse1 |c_t2Thread1of1ForFork0_pop_~stack#1.offset|)) 4294967296))) (= |c_t2Thread1of1ForFork0_pop_#in~stack#1.offset| 0) (= c_~top~0 1) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (<= 0 .cse7) (<= .cse7 799) (<= c_~top~0 1) (<= 0 .cse2) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret38#1_105| Int) (|t1Thread1of1ForFork1_push_~x#1| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| c_~top~0))) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0) (or (let ((.cse8 (select .cse0 (+ .cse1 (- 8))))) (and (<= .cse8 799) .cse3 (<= 0 .cse8))) (< .cse6 8)) (= |c_t2Thread1of1ForFork0_pop_~stack#1.offset| 0))))) is different from false [2021-11-12 23:20:50,133 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~top~0 4))) (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (+ .cse8 (- 4)))) (let ((.cse6 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) .cse4)) (.cse0 (select .cse3 0)) (.cse1 (= |c_~#arr~0.offset| 0)) (.cse5 (* 4 c_~top~0))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse0 799) .cse1 (or (let ((.cse2 (select .cse3 .cse4))) (and .cse1 (<= .cse2 799) (<= 0 .cse2))) (< .cse5 4)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (= |c_t2Thread1of1ForFork0_pop_#in~stack#1.offset| 0) (= c_~top~0 1) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (<= 0 .cse6) (<= .cse6 799) (<= c_~top~0 1) (<= 0 .cse0) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret38#1_105| Int) (|t1Thread1of1ForFork1_push_~x#1| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| c_~top~0))) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0) (or (let ((.cse7 (select .cse3 (+ .cse8 (- 8))))) (and (<= .cse7 799) .cse1 (<= 0 .cse7))) (< .cse5 8)) (= |c_t2Thread1of1ForFork0_pop_~stack#1.offset| 0))))) is different from false [2021-11-12 23:20:55,991 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select .cse0 (+ |c_~#arr~0.offset| .cse1 (- 4))) 4294967296) 4294967294)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (or (let ((.cse2 (select .cse0 (+ .cse1 (- 4))))) (and (= |c_~#arr~0.offset| 0) (<= .cse2 799) (<= 0 .cse2))) (<= c_~top~0 0)) (not (= 4294967294 (mod (select .cse0 (+ |c_~#arr~0.offset| .cse1 (- 8))) 4294967296))) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret38#1_105| Int) (|t1Thread1of1ForFork1_push_~x#1| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| c_~top~0))))) is different from false [2021-11-12 23:21:04,886 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~top~0 4))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse0 (- 4))) 4294967296) 4294967294)) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_t2Thread1of1ForFork0_pop_~stack#1.base|) (+ .cse0 |c_t2Thread1of1ForFork0_pop_~stack#1.offset|)) 4294967296))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret38#1_105| Int) (|t1Thread1of1ForFork1_push_~x#1| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| c_~top~0))))) is different from false [2021-11-12 23:21:07,347 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select .cse0 (+ |c_~#arr~0.offset| .cse1 (- 4))) 4294967296) 4294967294)) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_t2Thread1of1ForFork0_pop_~stack#1.base|) (+ .cse1 |c_t2Thread1of1ForFork0_pop_~stack#1.offset|)) 4294967296))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (or (let ((.cse2 (select .cse0 (+ .cse1 (- 4))))) (and (= |c_~#arr~0.offset| 0) (<= .cse2 799) (<= 0 .cse2))) (<= c_~top~0 0)) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret38#1_105| Int) (|t1Thread1of1ForFork1_push_~x#1| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_105| c_~top~0))))) is different from false [2021-11-12 23:21:07,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:07,877 INFO L93 Difference]: Finished difference Result 3482 states and 7737 transitions. [2021-11-12 23:21:07,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2021-11-12 23:21:07,878 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.9215686274509804) internal successors, (98), 52 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have 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 [2021-11-12 23:21:07,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:07,897 INFO L225 Difference]: With dead ends: 3482 [2021-11-12 23:21:07,898 INFO L226 Difference]: Without dead ends: 3261 [2021-11-12 23:21:07,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 170 ConstructedPredicates, 17 IntricatePredicates, 2 DeprecatedPredicates, 7466 ImplicationChecksByTransitivity, 96.6s TimeCoverageRelationStatistics Valid=1724, Invalid=22144, Unknown=70, NotChecked=5474, Total=29412 [2021-11-12 23:21:07,908 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 573 mSDsluCounter, 4640 mSDsCounter, 0 mSdLazyCounter, 9143 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4699.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 11221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 29.48ms SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 9143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2004 IncrementalHoareTripleChecker+Unchecked, 5536.24ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:07,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [573 Valid, 0 Invalid, 11221 Unknown, 0 Unchecked, 29.48ms Time], IncrementalHoareTripleChecker [74 Valid, 9143 Invalid, 0 Unknown, 2004 Unchecked, 5536.24ms Time] [2021-11-12 23:21:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3261 states. [2021-11-12 23:21:07,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3261 to 1509. [2021-11-12 23:21:07,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1507 states have (on average 2.4897146648971464) internal successors, (3752), 1508 states have internal predecessors, (3752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:21:07,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 3752 transitions. [2021-11-12 23:21:07,973 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 3752 transitions. Word has length 36 [2021-11-12 23:21:07,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:07,974 INFO L470 AbstractCegarLoop]: Abstraction has 1509 states and 3752 transitions. [2021-11-12 23:21:07,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.9215686274509804) internal successors, (98), 52 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:21:07,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 3752 transitions. [2021-11-12 23:21:07,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-12 23:21:07,978 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:07,978 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:21:08,016 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-12 23:21:08,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-12 23:21:08,201 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-12 23:21:08,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:08,201 INFO L85 PathProgramCache]: Analyzing trace with hash -654325725, now seen corresponding path program 3 times [2021-11-12 23:21:08,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:08,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103681261] [2021-11-12 23:21:08,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:08,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:08,765 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:21:08,765 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:08,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103681261] [2021-11-12 23:21:08,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103681261] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:21:08,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103226826] [2021-11-12 23:21:08,766 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-12 23:21:08,766 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:21:08,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:21:08,774 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:21:08,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-12 23:21:08,873 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-12 23:21:08,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:21:08,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 65 conjunts are in the unsatisfiable core [2021-11-12 23:21:08,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:21:09,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2021-11-12 23:21:09,533 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-12 23:21:09,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 49 [2021-11-12 23:21:10,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 45 [2021-11-12 23:21:38,797 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:21:38,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:21:40,897 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_111| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_111| 4) |c_t1Thread1of1ForFork1_push_~stack#1.offset|) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_111| c_~top~0))) is different from false [2021-11-12 23:22:16,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2021-11-12 23:22:16,922 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-12 23:22:16,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103226826] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:22:16,923 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1524201142] [2021-11-12 23:22:16,923 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-12 23:22:16,925 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:22:16,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 50 [2021-11-12 23:22:16,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377030384] [2021-11-12 23:22:16,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:22:16,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-11-12 23:22:16,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:22:16,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-11-12 23:22:16,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2279, Unknown=15, NotChecked=96, Total=2550 [2021-11-12 23:22:16,927 INFO L87 Difference]: Start difference. First operand 1509 states and 3752 transitions. Second operand has 51 states, 50 states have (on average 2.08) internal successors, (104), 51 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:22:18,262 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse0 (select .cse4 (+ .cse5 (- 8)))) (.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ .cse5 (- 4)))) (.cse1 (select .cse4 0)) (.cse2 (select .cse4 (+ (* |c_t2Thread1of1ForFork0_dec_top_#t~post34#1| 4) (- 8))))) (and (= c_~top~0 0) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse0 799) (<= .cse1 799) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork1_push_~x#1|) (<= 0 .cse2) (<= 0 .cse0) (<= 0 .cse3) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_111| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_111| 4) |c_t1Thread1of1ForFork1_push_~stack#1.offset|) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_111| c_~top~0))) (<= .cse3 799) (<= 0 .cse1) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0) (<= .cse2 799) (<= |c_t1Thread1of1ForFork1_push_~x#1| 799)))) is different from false [2021-11-12 23:22:19,158 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ (* c_~top~0 4) (- 4))))) (and (= c_~top~0 0) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork1_push_~x#1|) (<= 0 .cse0) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_111| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_111| 4) |c_t1Thread1of1ForFork1_push_~stack#1.offset|) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_111| c_~top~0))) (<= .cse0 799) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0) (<= |c_t1Thread1of1ForFork1_push_~x#1| 799))) is different from false [2021-11-12 23:22:21,162 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~top~0 4))) (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ .cse2 (- 8)))) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ .cse2 (- 4))))) (and (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse0 799) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork1_push_~x#1|) (<= 0 .cse0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (<= 0 .cse1) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_111| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_111| 4) |c_t1Thread1of1ForFork1_push_~stack#1.offset|) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_111| c_~top~0))) (<= .cse1 799) (< (div |c_t1Thread1of1ForFork1_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork1_push_~x#1| (- 1)) 799) 4294967296) 1)) (< |c_t1Thread1of1ForFork1_push_~x#1| 4294967296) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0)))) is different from false [2021-11-12 23:22:22,124 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ (* c_~top~0 4) (- 4))))) (and (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork1_push_~x#1|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (<= 0 .cse0) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_111| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_111| 4) |c_t1Thread1of1ForFork1_push_~stack#1.offset|) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_111| c_~top~0))) (<= .cse0 799) (< (div |c_t1Thread1of1ForFork1_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork1_push_~x#1| (- 1)) 799) 4294967296) 1)) (< |c_t1Thread1of1ForFork1_push_~x#1| 4294967296) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0))) is different from false [2021-11-12 23:22:23,056 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ (* c_~top~0 4) (- 4))))) (and (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= 0 .cse0) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_111| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_111| 4) |c_t1Thread1of1ForFork1_push_~stack#1.offset|) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_111| c_~top~0))) (<= .cse0 799) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0))) is different from false [2021-11-12 23:22:26,421 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 799) 4294967296) 1)) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork1_push_~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_111| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_111| 4) |c_t1Thread1of1ForFork1_push_~stack#1.offset|) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_111| c_~top~0))) (<= 0 .cse0) (< (div |c_t1Thread1of1ForFork1_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork1_push_~x#1| (- 1)) 799) 4294967296) 1)) (< |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) is different from false [2021-11-12 23:22:29,758 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 799) 4294967296) 1)) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_111| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_111| 4) |c_t1Thread1of1ForFork1_push_~stack#1.offset|) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_111| c_~top~0))) (<= 0 .cse0))) is different from false [2021-11-12 23:22:34,396 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 4)))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 799) 4294967296) 1)) (<= 0 .cse1) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork1_push_~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_111| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_111| 4) |c_t1Thread1of1ForFork1_push_~stack#1.offset|) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_111| c_~top~0))) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ 799 (* .cse1 (- 1))) 4294967296) 1)) (< .cse1 4294967296) (< (div |c_t1Thread1of1ForFork1_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork1_push_~x#1| (- 1)) 799) 4294967296) 1)) (< |c_t1Thread1of1ForFork1_push_~x#1| 4294967296)))) is different from false [2021-11-12 23:22:52,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:22:52,413 INFO L93 Difference]: Finished difference Result 6175 states and 14740 transitions. [2021-11-12 23:22:52,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-11-12 23:22:52,414 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.08) internal successors, (104), 51 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have 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 [2021-11-12 23:22:52,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:22:52,451 INFO L225 Difference]: With dead ends: 6175 [2021-11-12 23:22:52,451 INFO L226 Difference]: Without dead ends: 6175 [2021-11-12 23:22:52,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 123 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 3279 ImplicationChecksByTransitivity, 98.9s TimeCoverageRelationStatistics Valid=1194, Invalid=12159, Unknown=23, NotChecked=2124, Total=15500 [2021-11-12 23:22:52,454 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 628 mSDsluCounter, 2045 mSDsCounter, 0 mSdLazyCounter, 4175 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3151.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 4969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.69ms SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 4175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 675 IncrementalHoareTripleChecker+Unchecked, 3640.01ms IncrementalHoareTripleChecker+Time [2021-11-12 23:22:52,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [628 Valid, 2 Invalid, 4969 Unknown, 0 Unchecked, 18.69ms Time], IncrementalHoareTripleChecker [119 Valid, 4175 Invalid, 0 Unknown, 675 Unchecked, 3640.01ms Time] [2021-11-12 23:22:52,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6175 states. [2021-11-12 23:22:52,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6175 to 2562. [2021-11-12 23:22:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2562 states, 2560 states have (on average 2.62578125) internal successors, (6722), 2561 states have internal predecessors, (6722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:22:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 6722 transitions. [2021-11-12 23:22:52,587 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 6722 transitions. Word has length 36 [2021-11-12 23:22:52,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:22:52,587 INFO L470 AbstractCegarLoop]: Abstraction has 2562 states and 6722 transitions. [2021-11-12 23:22:52,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.08) internal successors, (104), 51 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:22:52,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 6722 transitions. [2021-11-12 23:22:52,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-12 23:22:52,592 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:22:52,592 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:22:52,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-12 23:22:52,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-12 23:22:52,809 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-12 23:22:52,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:22:52,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1680650279, now seen corresponding path program 4 times [2021-11-12 23:22:52,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:22:52,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911482742] [2021-11-12 23:22:52,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:22:52,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:22:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:22:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:22:53,496 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:22:53,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911482742] [2021-11-12 23:22:53,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911482742] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:22:53,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163766979] [2021-11-12 23:22:53,497 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-12 23:22:53,497 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:22:53,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:22:53,501 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:22:53,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-12 23:22:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:22:53,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 65 conjunts are in the unsatisfiable core [2021-11-12 23:22:53,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:22:53,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2021-11-12 23:22:54,455 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-12 23:22:54,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 49 [2021-11-12 23:22:55,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 45 [2021-11-12 23:22:55,449 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:22:55,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:22:57,940 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_117| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_117| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_117| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) is different from false [2021-11-12 23:23:36,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2021-11-12 23:23:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-12 23:23:36,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163766979] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:23:36,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [125795068] [2021-11-12 23:23:36,293 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-12 23:23:36,294 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:23:36,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 50 [2021-11-12 23:23:36,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538967779] [2021-11-12 23:23:36,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:23:36,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-11-12 23:23:36,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:23:36,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-11-12 23:23:36,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2293, Unknown=1, NotChecked=96, Total=2550 [2021-11-12 23:23:36,296 INFO L87 Difference]: Start difference. First operand 2562 states and 6722 transitions. Second operand has 51 states, 50 states have (on average 2.08) internal successors, (104), 51 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:23:37,546 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse0 (select .cse4 (+ .cse5 (- 8)))) (.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ .cse5 (- 4)))) (.cse1 (select .cse4 0)) (.cse2 (select .cse4 (+ (* |c_t2Thread1of1ForFork0_dec_top_#t~post34#1| 4) (- 8))))) (and (= c_~top~0 0) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse0 799) (<= .cse1 799) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork1_push_~x#1|) (<= 0 .cse2) (<= 0 .cse0) (<= 0 .cse3) (<= .cse3 799) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_117| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_117| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_117| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (<= 0 .cse1) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0) (<= .cse2 799) (<= |c_t1Thread1of1ForFork1_push_~x#1| 799)))) is different from false [2021-11-12 23:23:38,487 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ (* c_~top~0 4) (- 4))))) (and (= c_~top~0 0) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork1_push_~x#1|) (<= 0 .cse0) (<= .cse0 799) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_117| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_117| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_117| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0) (<= |c_t1Thread1of1ForFork1_push_~x#1| 799))) is different from false [2021-11-12 23:23:40,546 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~top~0 4))) (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ .cse2 (- 8)))) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ .cse2 (- 4))))) (and (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse0 799) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork1_push_~x#1|) (<= 0 .cse0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (<= 0 .cse1) (<= .cse1 799) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_117| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_117| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_117| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (< (div |c_t1Thread1of1ForFork1_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork1_push_~x#1| (- 1)) 799) 4294967296) 1)) (< |c_t1Thread1of1ForFork1_push_~x#1| 4294967296) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0)))) is different from false [2021-11-12 23:23:41,544 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ (* c_~top~0 4) (- 4))))) (and (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork1_push_~x#1|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (<= 0 .cse0) (<= .cse0 799) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_117| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_117| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_117| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (< (div |c_t1Thread1of1ForFork1_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork1_push_~x#1| (- 1)) 799) 4294967296) 1)) (< |c_t1Thread1of1ForFork1_push_~x#1| 4294967296) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0))) is different from false [2021-11-12 23:23:42,444 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ (* c_~top~0 4) (- 4))))) (and (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= 0 .cse0) (<= .cse0 799) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_117| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_117| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_117| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0))) is different from false [2021-11-12 23:23:46,035 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 799) 4294967296) 1)) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork1_push_~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_117| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_117| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_117| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (<= 0 .cse0) (< (div |c_t1Thread1of1ForFork1_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork1_push_~x#1| (- 1)) 799) 4294967296) 1)) (< |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) is different from false [2021-11-12 23:23:47,351 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 799) 4294967296) 1)) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_117| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_117| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_117| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (<= 0 .cse0))) is different from false [2021-11-12 23:23:52,670 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 4)))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 799) 4294967296) 1)) (<= 0 .cse1) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork1_push_~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_117| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_117| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_117| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ 799 (* .cse1 (- 1))) 4294967296) 1)) (< .cse1 4294967296) (< (div |c_t1Thread1of1ForFork1_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork1_push_~x#1| (- 1)) 799) 4294967296) 1)) (< |c_t1Thread1of1ForFork1_push_~x#1| 4294967296)))) is different from false [2021-11-12 23:23:54,559 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~top~0 4))) (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ .cse2 (- 4)))) (.cse1 (select (select |c_#memory_int| |c_t2Thread1of1ForFork0_pop_~stack#1.base|) .cse2))) (and (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork1_push_~x#1|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (<= 0 .cse0) (<= .cse0 799) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_117| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_117| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_117| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (< (div |c_t1Thread1of1ForFork1_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork1_push_~x#1| (- 1)) 799) 4294967296) 1)) (< |c_t1Thread1of1ForFork1_push_~x#1| 4294967296) (<= 0 .cse1) (<= .cse1 799) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0) (= |c_t2Thread1of1ForFork0_pop_~stack#1.offset| 0)))) is different from false [2021-11-12 23:23:59,640 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~top~0 4))) (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse2 (- 4)))) (.cse1 (select (select |c_#memory_int| |c_t2Thread1of1ForFork0_pop_~stack#1.base|) (+ .cse2 |c_t2Thread1of1ForFork0_pop_~stack#1.offset|)))) (and (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 799) 4294967296) 1)) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork1_push_~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (< (div .cse1 (- 4294967296)) (+ 1 (div (+ (* .cse1 (- 1)) 799) 4294967296))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_117| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_117| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_117| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (<= 0 .cse0) (< (div |c_t1Thread1of1ForFork1_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork1_push_~x#1| (- 1)) 799) 4294967296) 1)) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork1_push_~x#1| 4294967296) (<= 0 .cse1)))) is different from false [2021-11-12 23:24:00,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:00,267 INFO L93 Difference]: Finished difference Result 7468 states and 18034 transitions. [2021-11-12 23:24:00,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2021-11-12 23:24:00,268 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.08) internal successors, (104), 51 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have 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 [2021-11-12 23:24:00,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:00,290 INFO L225 Difference]: With dead ends: 7468 [2021-11-12 23:24:00,290 INFO L226 Difference]: Without dead ends: 7468 [2021-11-12 23:24:00,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 131 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 3789 ImplicationChecksByTransitivity, 60.8s TimeCoverageRelationStatistics Valid=1276, Invalid=13519, Unknown=11, NotChecked=2750, Total=17556 [2021-11-12 23:24:00,293 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 637 mSDsluCounter, 2828 mSDsCounter, 0 mSdLazyCounter, 5895 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4099.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 6559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 20.41ms SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 5895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 546 IncrementalHoareTripleChecker+Unchecked, 4718.81ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:00,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [637 Valid, 1 Invalid, 6559 Unknown, 0 Unchecked, 20.41ms Time], IncrementalHoareTripleChecker [118 Valid, 5895 Invalid, 0 Unknown, 546 Unchecked, 4718.81ms Time] [2021-11-12 23:24:00,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7468 states. [2021-11-12 23:24:00,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7468 to 2308. [2021-11-12 23:24:00,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2308 states, 2306 states have (on average 2.6392020815264527) internal successors, (6086), 2307 states have internal predecessors, (6086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 6086 transitions. [2021-11-12 23:24:00,433 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 6086 transitions. Word has length 36 [2021-11-12 23:24:00,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:00,433 INFO L470 AbstractCegarLoop]: Abstraction has 2308 states and 6086 transitions. [2021-11-12 23:24:00,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.08) internal successors, (104), 51 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:00,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 6086 transitions. [2021-11-12 23:24:00,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-12 23:24:00,440 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:00,440 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:24:00,477 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-11-12 23:24:00,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:24:00,657 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-12 23:24:00,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:00,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1051983685, now seen corresponding path program 5 times [2021-11-12 23:24:00,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:00,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295231019] [2021-11-12 23:24:00,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:00,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:01,392 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:24:01,392 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:01,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295231019] [2021-11-12 23:24:01,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295231019] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:24:01,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338911684] [2021-11-12 23:24:01,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-12 23:24:01,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:24:01,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:24:01,397 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:24:01,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-12 23:24:01,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-12 23:24:01,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:24:01,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 71 conjunts are in the unsatisfiable core [2021-11-12 23:24:01,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:24:01,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 107 [2021-11-12 23:24:01,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-12 23:24:01,937 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-12 23:24:01,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-11-12 23:24:02,194 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-12 23:24:02,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2021-11-12 23:24:02,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2021-11-12 23:24:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:24:02,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:24:05,080 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_123| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_123| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_123| c_~top~0))) is different from false [2021-11-12 23:24:33,489 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#id2~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~pre52#1_44| Int)) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) |ULTIMATE.start_main_~#id2~0#1.offset| |v_ULTIMATE.start_main_#t~pre52#1_44|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))) is different from false [2021-11-12 23:24:47,808 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#id2~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~pre52#1_44| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) |ULTIMATE.start_main_~#id2~0#1.offset| |v_ULTIMATE.start_main_#t~pre52#1_44|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) is different from false [2021-11-12 23:24:47,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 262 [2021-11-12 23:24:49,514 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-11-12 23:24:49,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338911684] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:24:49,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [182458189] [2021-11-12 23:24:49,515 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-12 23:24:49,517 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:24:49,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2021-11-12 23:24:49,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751293279] [2021-11-12 23:24:49,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:24:49,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-11-12 23:24:49,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:49,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-11-12 23:24:49,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2188, Unknown=9, NotChecked=288, Total=2652 [2021-11-12 23:24:49,523 INFO L87 Difference]: Start difference. First operand 2308 states and 6086 transitions. Second operand has 52 states, 51 states have (on average 2.0392156862745097) internal successors, (104), 51 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:50,907 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_~top~0 4))) (let ((.cse6 (+ .cse7 (- 4))) (.cse5 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse0 (select .cse5 (+ .cse7 (- 8)))) (.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) .cse6)) (.cse1 (select .cse5 0)) (.cse2 (select .cse5 (+ (* |c_t2Thread1of1ForFork0_dec_top_#t~post34#1| 4) (- 8)))) (.cse4 (select .cse5 .cse6))) (and (= c_~top~0 0) (not (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_ULTIMATE.start_main_~#id2~0#1.base|)) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse0 799) (<= .cse1 799) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork1_push_~x#1|) (<= 0 .cse2) (not (= |c_~#m~0.base| |c_~#arr~0.base|)) (<= 0 .cse0) (<= 0 .cse3) (<= .cse3 799) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_123| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_123| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_123| c_~top~0))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (<= 0 .cse1) (<= .cse4 799) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0) (<= .cse2 799) (<= |c_t1Thread1of1ForFork1_push_~x#1| 799) (<= 0 .cse4))))) is different from false [2021-11-12 23:24:51,898 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ (* c_~top~0 4) (- 4))))) (and (= c_~top~0 0) (not (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_ULTIMATE.start_main_~#id2~0#1.base|)) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork1_push_~x#1|) (<= 0 .cse0) (<= .cse0 799) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_123| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_123| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_123| c_~top~0))) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0) (<= |c_t1Thread1of1ForFork1_push_~x#1| 799))) is different from false [2021-11-12 23:24:52,860 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~top~0 4))) (let ((.cse5 (+ .cse6 (- 4))) (.cse4 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse0 (select .cse4 (+ .cse6 (- 8)))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) .cse5)) (.cse1 (select .cse4 0)) (.cse3 (select .cse4 .cse5))) (and (= c_~top~0 0) (not (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_ULTIMATE.start_main_~#id2~0#1.base|)) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse0 799) (<= .cse1 799) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork1_push_~x#1|) (not (= |c_~#m~0.base| |c_~#arr~0.base|)) (<= 0 .cse0) (<= 0 .cse2) (<= .cse2 799) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_123| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_123| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_123| c_~top~0))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (<= 0 .cse1) (<= .cse3 799) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0) (<= |c_t1Thread1of1ForFork1_push_~x#1| 799) (<= 0 .cse3))))) is different from false [2021-11-12 23:24:54,907 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse0 (select .cse3 (+ .cse4 (- 8)))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ .cse4 (- 4)))) (.cse1 (select .cse3 0))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse0 799) (<= .cse1 799) (= |c_~#arr~0.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (<= 0 .cse0) (= c_~top~0 1) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (<= 0 .cse2) (<= .cse2 799) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_123| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_123| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_123| c_~top~0))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (<= 0 .cse1) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0)))) is different from false [2021-11-12 23:24:55,869 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ (* c_~top~0 4) (- 4)))) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) 0))) (and (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296))) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse0 799) (= |c_~#arr~0.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (= c_~top~0 1) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (<= 0 .cse1) (<= .cse1 799) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_123| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_123| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_123| c_~top~0))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (<= 0 .cse0) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0))) is different from false [2021-11-12 23:25:00,024 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) 0))) (and (= |c_t1Thread1of1ForFork1_inc_top_#t~post33#1| 1) (<= .cse0 799) (= |c_~#arr~0.offset| 0) (forall ((|ULTIMATE.start_main_~#id2~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~pre52#1_44| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) |ULTIMATE.start_main_~#id2~0#1.offset| |v_ULTIMATE.start_main_#t~pre52#1_44|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* |c_t1Thread1of1ForFork1_inc_top_#t~post33#1| 4))) 4294967296)))) (<= 0 .cse0))) is different from false [2021-11-12 23:25:10,967 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (+ (* c_~top~0 4) (- 4)))) (let ((.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) .cse5)) (.cse0 (select .cse4 0)) (.cse2 (select (select |c_#memory_int| |c_t2Thread1of1ForFork0_pop_~stack#1.base|) 0)) (.cse3 (select .cse4 .cse5))) (and (= c_~top~0 0) (not (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_ULTIMATE.start_main_~#id2~0#1.base|)) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse0 799) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork1_push_~x#1|) (<= 0 .cse1) (<= .cse1 799) (<= .cse2 799) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_123| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_123| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_123| c_~top~0))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (<= 0 .cse0) (<= .cse3 799) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0) (<= 0 .cse2) (<= |c_t1Thread1of1ForFork1_push_~x#1| 799) (= |c_t2Thread1of1ForFork0_pop_~stack#1.offset| 0) (<= 0 .cse3)))) is different from false [2021-11-12 23:25:14,443 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ .cse1 (- 4)))) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) 0))) (and (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse0 799) (= |c_~#arr~0.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_t2Thread1of1ForFork0_pop_~stack#1.base|) (+ .cse1 |c_t2Thread1of1ForFork0_pop_~stack#1.offset|)) 4294967296))) (= c_~top~0 1) (<= 0 .cse2) (<= .cse2 799) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_123| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_123| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_123| c_~top~0))) (<= 0 .cse0) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0)))) is different from false [2021-11-12 23:25:15,422 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ (* c_~top~0 4) (- 4)))) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) 0))) (and (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse0 799) (= |c_~#arr~0.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (= c_~top~0 1) (<= 0 .cse1) (<= .cse1 799) (forall ((|t1Thread1of1ForFork1_push_~x#1| Int) (|v_t1Thread1of1ForFork1_push_#t~ret38#1_123| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret38#1_123| 4)) |t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork1_push_#t~ret38#1_123| c_~top~0))) (<= 0 .cse0) (= |c_t1Thread1of1ForFork1_push_~stack#1.offset| 0))) is different from false [2021-11-12 23:25:17,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:25:17,455 INFO L93 Difference]: Finished difference Result 3562 states and 9080 transitions. [2021-11-12 23:25:17,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-11-12 23:25:17,455 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.0392156862745097) internal successors, (104), 51 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have 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 [2021-11-12 23:25:17,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:25:17,464 INFO L225 Difference]: With dead ends: 3562 [2021-11-12 23:25:17,464 INFO L226 Difference]: Without dead ends: 3553 [2021-11-12 23:25:17,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 40 SyntacticMatches, 9 SemanticMatches, 97 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 73.1s TimeCoverageRelationStatistics Valid=662, Invalid=6843, Unknown=25, NotChecked=2172, Total=9702 [2021-11-12 23:25:17,466 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 383 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1793.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 3298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.61ms SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 661 IncrementalHoareTripleChecker+Unchecked, 2069.22ms IncrementalHoareTripleChecker+Time [2021-11-12 23:25:17,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [383 Valid, 2 Invalid, 3298 Unknown, 0 Unchecked, 9.61ms Time], IncrementalHoareTripleChecker [103 Valid, 2534 Invalid, 0 Unknown, 661 Unchecked, 2069.22ms Time] [2021-11-12 23:25:17,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3553 states. [2021-11-12 23:25:17,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3553 to 2659. [2021-11-12 23:25:17,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2659 states, 2657 states have (on average 2.6552502822732404) internal successors, (7055), 2658 states have internal predecessors, (7055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:25:17,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2659 states to 2659 states and 7055 transitions. [2021-11-12 23:25:17,552 INFO L78 Accepts]: Start accepts. Automaton has 2659 states and 7055 transitions. Word has length 36 [2021-11-12 23:25:17,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:25:17,552 INFO L470 AbstractCegarLoop]: Abstraction has 2659 states and 7055 transitions. [2021-11-12 23:25:17,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.0392156862745097) internal successors, (104), 51 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:25:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2659 states and 7055 transitions. [2021-11-12 23:25:17,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-12 23:25:17,557 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:25:17,557 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:25:17,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-12 23:25:17,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-12 23:25:17,777 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-12 23:25:17,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:25:17,778 INFO L85 PathProgramCache]: Analyzing trace with hash -831540333, now seen corresponding path program 6 times [2021-11-12 23:25:17,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:25:17,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816654333] [2021-11-12 23:25:17,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:25:17,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:25:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:25:18,397 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:25:18,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816654333] [2021-11-12 23:25:18,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816654333] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:25:18,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810300360] [2021-11-12 23:25:18,397 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-12 23:25:18,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:25:18,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:25:18,398 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:25:18,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-12 23:25:18,512 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-12 23:25:18,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:25:18,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 75 conjunts are in the unsatisfiable core [2021-11-12 23:25:18,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:25:18,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 656 treesize of output 624 [2021-11-12 23:25:18,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2021-11-12 23:25:19,139 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-12 23:25:19,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 43 [2021-11-12 23:25:19,446 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-12 23:25:19,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 49 [2021-11-12 23:25:20,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 45 [2021-11-12 23:26:10,104 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:26:10,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:27:06,311 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#id2~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~pre52#1_45| Int)) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) |ULTIMATE.start_main_~#id2~0#1.offset| |v_ULTIMATE.start_main_#t~pre52#1_45|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))) is different from false [2021-11-12 23:27:26,786 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#id2~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~pre52#1_45| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) |ULTIMATE.start_main_~#id2~0#1.offset| |v_ULTIMATE.start_main_#t~pre52#1_45|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) is different from false [2021-11-12 23:27:26,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 262 [2021-11-12 23:27:27,072 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-12 23:27:27,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810300360] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:27:27,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1556459303] [2021-11-12 23:27:27,073 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-12 23:27:27,075 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:27:27,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 18] total 54 [2021-11-12 23:27:27,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232508965] [2021-11-12 23:27:27,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:27:27,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2021-11-12 23:27:27,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:27:27,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-11-12 23:27:27,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2659, Unknown=38, NotChecked=210, Total=3080 [2021-11-12 23:27:27,077 INFO L87 Difference]: Start difference. First operand 2659 states and 7055 transitions. Second operand has 56 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 55 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:28:10,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:28:10,743 INFO L93 Difference]: Finished difference Result 5177 states and 12797 transitions. [2021-11-12 23:28:10,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-11-12 23:28:10,743 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 55 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have 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 [2021-11-12 23:28:10,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:28:10,759 INFO L225 Difference]: With dead ends: 5177 [2021-11-12 23:28:10,759 INFO L226 Difference]: Without dead ends: 5177 [2021-11-12 23:28:10,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 35 SyntacticMatches, 11 SemanticMatches, 118 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3334 ImplicationChecksByTransitivity, 167.2s TimeCoverageRelationStatistics Valid=1658, Invalid=12118, Unknown=38, NotChecked=466, Total=14280 [2021-11-12 23:28:10,761 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1158 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 2560 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3531.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.16ms SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 2560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 680 IncrementalHoareTripleChecker+Unchecked, 3939.88ms IncrementalHoareTripleChecker+Time [2021-11-12 23:28:10,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1158 Valid, 0 Invalid, 3609 Unknown, 0 Unchecked, 15.16ms Time], IncrementalHoareTripleChecker [369 Valid, 2560 Invalid, 0 Unknown, 680 Unchecked, 3939.88ms Time] [2021-11-12 23:28:10,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5177 states. [2021-11-12 23:28:10,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5177 to 3485. [2021-11-12 23:28:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3485 states, 3483 states have (on average 2.686190066035027) internal successors, (9356), 3484 states have internal predecessors, (9356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:28:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 3485 states and 9356 transitions. [2021-11-12 23:28:10,888 INFO L78 Accepts]: Start accepts. Automaton has 3485 states and 9356 transitions. Word has length 36 [2021-11-12 23:28:10,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:28:10,889 INFO L470 AbstractCegarLoop]: Abstraction has 3485 states and 9356 transitions. [2021-11-12 23:28:10,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 55 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:28:10,889 INFO L276 IsEmpty]: Start isEmpty. Operand 3485 states and 9356 transitions. [2021-11-12 23:28:10,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-12 23:28:10,895 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:28:10,896 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:28:10,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-12 23:28:11,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-12 23:28:11,121 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-12 23:28:11,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:28:11,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1060137811, now seen corresponding path program 7 times [2021-11-12 23:28:11,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:28:11,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157273412] [2021-11-12 23:28:11,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:28:11,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:28:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:28:11,862 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:28:11,863 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:28:11,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157273412] [2021-11-12 23:28:11,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157273412] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:28:11,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360892524] [2021-11-12 23:28:11,863 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-12 23:28:11,864 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:28:11,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:28:11,889 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:28:11,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59f48e9c-e56d-4e98-88bd-6231336693be/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-12 23:28:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:28:12,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-12 23:28:12,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:28:12,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 173 [2021-11-12 23:28:12,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2021-11-12 23:28:12,612 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-12 23:28:12,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 38 [2021-11-12 23:28:12,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:28:12,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2021-11-12 23:28:14,126 INFO L354 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2021-11-12 23:28:14,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 56 [2021-11-12 23:29:04,208 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:29:04,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:30:01,447 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:30:01,488 INFO L354 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2021-11-12 23:30:01,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 66 [2021-11-12 23:30:01,497 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-12 23:30:01,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 62 [2021-11-12 23:30:01,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2021-11-12 23:30:01,554 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-12 23:30:01,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 72 [2021-11-12 23:30:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:30:04,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360892524] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:30:04,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [146490270] [2021-11-12 23:30:04,152 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-12 23:30:04,154 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:30:04,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 20] total 58 [2021-11-12 23:30:04,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928501743] [2021-11-12 23:30:04,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:30:04,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2021-11-12 23:30:04,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:30:04,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-11-12 23:30:04,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=3183, Unknown=43, NotChecked=0, Total=3540 [2021-11-12 23:30:04,156 INFO L87 Difference]: Start difference. First operand 3485 states and 9356 transitions. Second operand has 60 states, 59 states have (on average 1.8305084745762712) internal successors, (108), 59 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) [2021-11-12 23:30:41,755 WARN L227 SmtUtils]: Spent 9.91s on a formula simplification. DAG size of input: 54 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)