./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/stack-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/stack-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7 --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 a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 20:05:28,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 20:05:28,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 20:05:28,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 20:05:28,811 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 20:05:28,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 20:05:28,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 20:05:28,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 20:05:28,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 20:05:28,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 20:05:28,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 20:05:28,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 20:05:28,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 20:05:28,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 20:05:28,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 20:05:28,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 20:05:28,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 20:05:28,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 20:05:28,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 20:05:28,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 20:05:28,857 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 20:05:28,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 20:05:28,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 20:05:28,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 20:05:28,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 20:05:28,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 20:05:28,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 20:05:28,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 20:05:28,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 20:05:28,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 20:05:28,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 20:05:28,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 20:05:28,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 20:05:28,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 20:05:28,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 20:05:28,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 20:05:28,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 20:05:28,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 20:05:28,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 20:05:28,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 20:05:28,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 20:05:28,880 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 20:05:28,921 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 20:05:28,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 20:05:28,922 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 20:05:28,922 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 20:05:28,929 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 20:05:28,929 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 20:05:28,930 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 20:05:28,930 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 20:05:28,930 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 20:05:28,930 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 20:05:28,931 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 20:05:28,932 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 20:05:28,932 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 20:05:28,932 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 20:05:28,932 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 20:05:28,933 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 20:05:28,933 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 20:05:28,933 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 20:05:28,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 20:05:28,934 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 20:05:28,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 20:05:28,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 20:05:28,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 20:05:28,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 20:05:28,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 20:05:28,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 20:05:28,937 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 20:05:28,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 20:05:28,937 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 20:05:28,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 20:05:28,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 20:05:28,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 20:05:28,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:05:28,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 20:05:28,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 20:05:28,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 20:05:28,940 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 20:05:28,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 20:05:28,940 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 20:05:28,940 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 20:05:28,941 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 20:05:28,941 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_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/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_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7 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 -> a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 [2021-11-25 20:05:29,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 20:05:29,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 20:05:29,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 20:05:29,313 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 20:05:29,314 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 20:05:29,315 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/pthread/stack-1.i [2021-11-25 20:05:29,385 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/data/4ded228cf/10ded7033d364c808638da7c333e66e3/FLAGb99222d80 [2021-11-25 20:05:29,964 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 20:05:29,964 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/sv-benchmarks/c/pthread/stack-1.i [2021-11-25 20:05:29,996 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/data/4ded228cf/10ded7033d364c808638da7c333e66e3/FLAGb99222d80 [2021-11-25 20:05:30,262 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/data/4ded228cf/10ded7033d364c808638da7c333e66e3 [2021-11-25 20:05:30,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 20:05:30,268 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 20:05:30,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 20:05:30,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 20:05:30,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 20:05:30,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:05:30" (1/1) ... [2021-11-25 20:05:30,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38fa5f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:05:30, skipping insertion in model container [2021-11-25 20:05:30,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:05:30" (1/1) ... [2021-11-25 20:05:30,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 20:05:30,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 20:05:30,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/sv-benchmarks/c/pthread/stack-1.i[41520,41533] [2021-11-25 20:05:30,959 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:05:30,975 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 20:05:31,032 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/sv-benchmarks/c/pthread/stack-1.i[41520,41533] [2021-11-25 20:05:31,050 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:05:31,138 INFO L208 MainTranslator]: Completed translation [2021-11-25 20:05:31,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:05:31 WrapperNode [2021-11-25 20:05:31,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 20:05:31,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 20:05:31,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 20:05:31,140 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 20:05:31,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:05:31" (1/1) ... [2021-11-25 20:05:31,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:05:31" (1/1) ... [2021-11-25 20:05:31,228 INFO L137 Inliner]: procedures = 277, calls = 45, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 154 [2021-11-25 20:05:31,229 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 20:05:31,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 20:05:31,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 20:05:31,230 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 20:05:31,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:05:31" (1/1) ... [2021-11-25 20:05:31,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:05:31" (1/1) ... [2021-11-25 20:05:31,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:05:31" (1/1) ... [2021-11-25 20:05:31,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:05:31" (1/1) ... [2021-11-25 20:05:31,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:05:31" (1/1) ... [2021-11-25 20:05:31,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:05:31" (1/1) ... [2021-11-25 20:05:31,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:05:31" (1/1) ... [2021-11-25 20:05:31,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 20:05:31,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 20:05:31,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 20:05:31,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 20:05:31,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:05:31" (1/1) ... [2021-11-25 20:05:31,316 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:05:31,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:05:31,340 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 20:05:31,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 20:05:31,387 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-11-25 20:05:31,387 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-11-25 20:05:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-11-25 20:05:31,388 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-11-25 20:05:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 20:05:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 20:05:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-25 20:05:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 20:05:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-25 20:05:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 20:05:31,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 20:05:31,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 20:05:31,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 20:05:31,391 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-25 20:05:31,540 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 20:05:31,542 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 20:05:31,778 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 20:05:31,788 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 20:05:31,788 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-25 20:05:31,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:05:31 BoogieIcfgContainer [2021-11-25 20:05:31,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 20:05:31,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 20:05:31,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 20:05:31,795 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 20:05:31,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:05:30" (1/3) ... [2021-11-25 20:05:31,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4943e76a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:05:31, skipping insertion in model container [2021-11-25 20:05:31,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:05:31" (2/3) ... [2021-11-25 20:05:31,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4943e76a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:05:31, skipping insertion in model container [2021-11-25 20:05:31,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:05:31" (3/3) ... [2021-11-25 20:05:31,798 INFO L111 eAbstractionObserver]: Analyzing ICFG stack-1.i [2021-11-25 20:05:31,802 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-25 20:05:31,802 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 20:05:31,803 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-25 20:05:31,803 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-25 20:05:31,840 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,840 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,840 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,840 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,840 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,841 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,841 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,841 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,841 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,841 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,842 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,842 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,842 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,842 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,862 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,863 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,863 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,863 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,863 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,863 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,864 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,864 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,864 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,864 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,865 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,865 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,865 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,865 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,865 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,865 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,866 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,866 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,866 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,866 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,866 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,866 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,867 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,867 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,867 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,867 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,867 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,867 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,868 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,868 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,868 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,868 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,869 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,869 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,869 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,869 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,869 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,869 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,869 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,870 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,870 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,870 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,870 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,870 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,871 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,871 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,871 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,871 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,871 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,871 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,871 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,872 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,872 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,872 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,872 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,872 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,872 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,873 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,873 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,873 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,873 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,873 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,874 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,874 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,874 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,874 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,874 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,875 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,875 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,875 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,875 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,875 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,875 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,876 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,876 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,876 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,876 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,876 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,877 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,877 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,877 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,877 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,877 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,878 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,878 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,878 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,878 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,878 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,879 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,879 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,879 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,879 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,879 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,879 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,880 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,880 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,880 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,880 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,880 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,880 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,881 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,881 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,881 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,881 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,882 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,882 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,882 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,882 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,882 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,883 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,883 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,883 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,883 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,883 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,884 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,884 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,884 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,884 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,884 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,885 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,885 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,885 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,886 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,886 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,886 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,887 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,887 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,887 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,887 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,887 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,887 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,888 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,888 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,888 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,888 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,888 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,888 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,889 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,889 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,889 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,889 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,889 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,889 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,890 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,890 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,890 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,890 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,891 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,891 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,891 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,891 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,891 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,891 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,892 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,892 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,892 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,892 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,892 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,892 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,893 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,893 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,893 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,893 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,893 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,893 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,893 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,894 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,894 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,894 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,894 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,894 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,894 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,895 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,895 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,895 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,895 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,895 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,895 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,895 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,896 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,896 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,896 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,896 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,896 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,896 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,897 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,897 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,897 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,897 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,897 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,898 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,898 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,898 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,898 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,898 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,898 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,899 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,899 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,899 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,899 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,899 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,900 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,900 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,900 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,900 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,900 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,900 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,901 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,901 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,901 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,901 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,901 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,901 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,902 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,902 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,902 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,902 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,902 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,902 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,903 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,903 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,903 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,903 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,903 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,903 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,903 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,907 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,908 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,908 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,908 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,908 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,908 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,909 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,909 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,909 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,909 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,909 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,909 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,910 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,910 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,910 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,910 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,910 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,910 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,911 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,911 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,911 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,911 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,911 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,916 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,916 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,916 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,916 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,916 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,918 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,918 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,918 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,918 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,918 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,918 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,919 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:05:31,921 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-11-25 20:05:31,965 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 20:05:31,972 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-25 20:05:31,972 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-25 20:05:31,989 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-25 20:05:32,002 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 176 transitions, 368 flow [2021-11-25 20:05:32,005 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 176 transitions, 368 flow [2021-11-25 20:05:32,006 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 173 places, 176 transitions, 368 flow [2021-11-25 20:05:32,087 INFO L129 PetriNetUnfolder]: 10/174 cut-off events. [2021-11-25 20:05:32,088 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-11-25 20:05:32,094 INFO L84 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 174 events. 10/174 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 422 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 126. Up to 3 conditions per place. [2021-11-25 20:05:32,103 INFO L116 LiptonReduction]: Number of co-enabled transitions 8324 [2021-11-25 20:05:37,349 INFO L131 LiptonReduction]: Checked pairs total: 11162 [2021-11-25 20:05:37,350 INFO L133 LiptonReduction]: Total number of compositions: 166 [2021-11-25 20:05:37,367 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 36 transitions, 88 flow [2021-11-25 20:05:37,408 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 282 states, 279 states have (on average 2.6917562724014337) internal successors, (751), 281 states have internal predecessors, (751), 0 states have call successors, (0), 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-25 20:05:37,411 INFO L276 IsEmpty]: Start isEmpty. Operand has 282 states, 279 states have (on average 2.6917562724014337) internal successors, (751), 281 states have internal predecessors, (751), 0 states have call successors, (0), 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-25 20:05:37,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-25 20:05:37,416 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:05:37,417 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-25 20:05:37,417 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-25 20:05:37,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:05:37,426 INFO L85 PathProgramCache]: Analyzing trace with hash -509395203, now seen corresponding path program 1 times [2021-11-25 20:05:37,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:05:37,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969461890] [2021-11-25 20:05:37,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:05:37,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:05:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:05:37,654 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-25 20:05:37,654 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:05:37,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969461890] [2021-11-25 20:05:37,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969461890] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:05:37,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:05:37,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 20:05:37,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386577543] [2021-11-25 20:05:37,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:05:37,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:05:37,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:05:37,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:05:37,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:05:37,688 INFO L87 Difference]: Start difference. First operand has 282 states, 279 states have (on average 2.6917562724014337) internal successors, (751), 281 states have internal predecessors, (751), 0 states have call successors, (0), 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-25 20:05:37,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:05:37,822 INFO L93 Difference]: Finished difference Result 414 states and 1064 transitions. [2021-11-25 20:05:37,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:05:37,825 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-25 20:05:37,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:05:37,841 INFO L225 Difference]: With dead ends: 414 [2021-11-25 20:05:37,841 INFO L226 Difference]: Without dead ends: 396 [2021-11-25 20:05:37,842 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-25 20:05:37,846 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:05:37,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:05:37,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-11-25 20:05:37,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 372. [2021-11-25 20:05:37,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 369 states have (on average 2.6856368563685638) internal successors, (991), 371 states have internal predecessors, (991), 0 states have call successors, (0), 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-25 20:05:37,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 991 transitions. [2021-11-25 20:05:37,913 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 991 transitions. Word has length 6 [2021-11-25 20:05:37,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:05:37,913 INFO L470 AbstractCegarLoop]: Abstraction has 372 states and 991 transitions. [2021-11-25 20:05:37,913 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-25 20:05:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 991 transitions. [2021-11-25 20:05:37,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-25 20:05:37,915 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:05:37,915 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:05:37,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 20:05:37,915 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-25 20:05:37,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:05:37,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1101509934, now seen corresponding path program 1 times [2021-11-25 20:05:37,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:05:37,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409692165] [2021-11-25 20:05:37,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:05:37,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:05:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:05:38,016 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-25 20:05:38,016 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:05:38,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409692165] [2021-11-25 20:05:38,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409692165] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:05:38,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:05:38,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 20:05:38,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900655264] [2021-11-25 20:05:38,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:05:38,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:05:38,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:05:38,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:05:38,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:05:38,020 INFO L87 Difference]: Start difference. First operand 372 states and 991 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-25 20:05:38,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:05:38,085 INFO L93 Difference]: Finished difference Result 410 states and 1089 transitions. [2021-11-25 20:05:38,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:05:38,086 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-25 20:05:38,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:05:38,091 INFO L225 Difference]: With dead ends: 410 [2021-11-25 20:05:38,091 INFO L226 Difference]: Without dead ends: 410 [2021-11-25 20:05:38,093 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-25 20:05:38,095 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 17 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:05:38,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 3 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:05:38,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-11-25 20:05:38,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2021-11-25 20:05:38,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 407 states have (on average 2.675675675675676) internal successors, (1089), 409 states have internal predecessors, (1089), 0 states have call successors, (0), 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-25 20:05:38,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1089 transitions. [2021-11-25 20:05:38,139 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1089 transitions. Word has length 10 [2021-11-25 20:05:38,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:05:38,139 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 1089 transitions. [2021-11-25 20:05:38,139 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-25 20:05:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1089 transitions. [2021-11-25 20:05:38,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-25 20:05:38,142 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:05:38,142 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:05:38,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 20:05:38,143 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-25 20:05:38,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:05:38,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1530966523, now seen corresponding path program 1 times [2021-11-25 20:05:38,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:05:38,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606987293] [2021-11-25 20:05:38,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:05:38,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:05:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:05:38,303 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-25 20:05:38,304 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:05:38,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606987293] [2021-11-25 20:05:38,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606987293] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:05:38,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919581614] [2021-11-25 20:05:38,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:05:38,310 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:05:38,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:05:38,319 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:05:38,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 20:05:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:05:38,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 20:05:38,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:05:38,535 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-25 20:05:38,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:05:38,586 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-25 20:05:38,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919581614] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:05:38,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [999478705] [2021-11-25 20:05:38,596 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-25 20:05:38,598 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:05:38,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2021-11-25 20:05:38,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62122925] [2021-11-25 20:05:38,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:05:38,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 20:05:38,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:05:38,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 20:05:38,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-25 20:05:38,601 INFO L87 Difference]: Start difference. First operand 410 states and 1089 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-25 20:05:38,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:05:38,956 INFO L93 Difference]: Finished difference Result 998 states and 2565 transitions. [2021-11-25 20:05:38,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 20:05:38,957 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-25 20:05:38,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:05:38,965 INFO L225 Difference]: With dead ends: 998 [2021-11-25 20:05:38,965 INFO L226 Difference]: Without dead ends: 986 [2021-11-25 20:05:38,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:05:38,966 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 150 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:05:38,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 0 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 20:05:38,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2021-11-25 20:05:38,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 678. [2021-11-25 20:05:38,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 675 states have (on average 2.6977777777777776) internal successors, (1821), 677 states have internal predecessors, (1821), 0 states have call successors, (0), 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-25 20:05:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1821 transitions. [2021-11-25 20:05:38,995 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1821 transitions. Word has length 13 [2021-11-25 20:05:38,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:05:38,995 INFO L470 AbstractCegarLoop]: Abstraction has 678 states and 1821 transitions. [2021-11-25 20:05:38,996 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-25 20:05:38,996 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1821 transitions. [2021-11-25 20:05:38,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-25 20:05:38,998 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:05:38,998 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:05:39,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 20:05:39,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-11-25 20:05:39,225 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-25 20:05:39,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:05:39,226 INFO L85 PathProgramCache]: Analyzing trace with hash -253426811, now seen corresponding path program 1 times [2021-11-25 20:05:39,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:05:39,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27414739] [2021-11-25 20:05:39,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:05:39,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:05:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:05:39,315 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-25 20:05:39,315 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:05:39,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27414739] [2021-11-25 20:05:39,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27414739] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:05:39,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:05:39,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:05:39,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113356746] [2021-11-25 20:05:39,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:05:39,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:05:39,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:05:39,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:05:39,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:05:39,317 INFO L87 Difference]: Start difference. First operand 678 states and 1821 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-25 20:05:39,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:05:39,384 INFO L93 Difference]: Finished difference Result 300 states and 681 transitions. [2021-11-25 20:05:39,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:05:39,384 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-25 20:05:39,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:05:39,387 INFO L225 Difference]: With dead ends: 300 [2021-11-25 20:05:39,387 INFO L226 Difference]: Without dead ends: 300 [2021-11-25 20:05:39,387 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-25 20:05:39,391 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 23 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:05:39,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 1 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:05:39,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-11-25 20:05:39,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 282. [2021-11-25 20:05:39,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 280 states have (on average 2.25) internal successors, (630), 281 states have internal predecessors, (630), 0 states have call successors, (0), 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-25 20:05:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 630 transitions. [2021-11-25 20:05:39,426 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 630 transitions. Word has length 16 [2021-11-25 20:05:39,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:05:39,427 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 630 transitions. [2021-11-25 20:05:39,427 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-25 20:05:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 630 transitions. [2021-11-25 20:05:39,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 20:05:39,428 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:05:39,428 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:05:39,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 20:05:39,429 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-25 20:05:39,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:05:39,429 INFO L85 PathProgramCache]: Analyzing trace with hash -583131400, now seen corresponding path program 1 times [2021-11-25 20:05:39,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:05:39,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992081444] [2021-11-25 20:05:39,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:05:39,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:05:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:05:39,505 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-25 20:05:39,505 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:05:39,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992081444] [2021-11-25 20:05:39,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992081444] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:05:39,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:05:39,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:05:39,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238369710] [2021-11-25 20:05:39,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:05:39,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:05:39,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:05:39,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:05:39,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:05:39,508 INFO L87 Difference]: Start difference. First operand 282 states and 630 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-25 20:05:39,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:05:39,577 INFO L93 Difference]: Finished difference Result 340 states and 756 transitions. [2021-11-25 20:05:39,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:05:39,578 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-25 20:05:39,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:05:39,582 INFO L225 Difference]: With dead ends: 340 [2021-11-25 20:05:39,583 INFO L226 Difference]: Without dead ends: 340 [2021-11-25 20:05:39,583 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-25 20:05:39,584 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:05:39,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 1 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:05:39,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-11-25 20:05:39,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 284. [2021-11-25 20:05:39,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 282 states have (on average 2.2588652482269502) internal successors, (637), 283 states have internal predecessors, (637), 0 states have call successors, (0), 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-25 20:05:39,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 637 transitions. [2021-11-25 20:05:39,595 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 637 transitions. Word has length 17 [2021-11-25 20:05:39,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:05:39,595 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 637 transitions. [2021-11-25 20:05:39,596 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-25 20:05:39,596 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 637 transitions. [2021-11-25 20:05:39,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 20:05:39,599 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:05:39,599 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-25 20:05:39,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-25 20:05:39,600 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-25 20:05:39,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:05:39,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1911993315, now seen corresponding path program 1 times [2021-11-25 20:05:39,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:05:39,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70743942] [2021-11-25 20:05:39,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:05:39,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:05:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:05:40,087 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-25 20:05:40,087 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:05:40,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70743942] [2021-11-25 20:05:40,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70743942] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:05:40,088 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:05:40,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 20:05:40,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470649075] [2021-11-25 20:05:40,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:05:40,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 20:05:40,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:05:40,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 20:05:40,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:05:40,091 INFO L87 Difference]: Start difference. First operand 284 states and 637 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:05:41,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:05:41,512 INFO L93 Difference]: Finished difference Result 525 states and 1135 transitions. [2021-11-25 20:05:41,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-25 20:05:41,513 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-25 20:05:41,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:05:41,517 INFO L225 Difference]: With dead ends: 525 [2021-11-25 20:05:41,517 INFO L226 Difference]: Without dead ends: 472 [2021-11-25 20:05:41,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2021-11-25 20:05:41,518 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 118 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:05:41,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 0 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-25 20:05:41,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-11-25 20:05:41,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 346. [2021-11-25 20:05:41,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 344 states have (on average 2.2674418604651163) internal successors, (780), 345 states have internal predecessors, (780), 0 states have call successors, (0), 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-25 20:05:41,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 780 transitions. [2021-11-25 20:05:41,531 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 780 transitions. Word has length 21 [2021-11-25 20:05:41,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:05:41,532 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 780 transitions. [2021-11-25 20:05:41,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:05:41,532 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 780 transitions. [2021-11-25 20:05:41,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 20:05:41,533 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:05:41,533 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-25 20:05:41,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-25 20:05:41,534 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-25 20:05:41,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:05:41,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1395187971, now seen corresponding path program 2 times [2021-11-25 20:05:41,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:05:41,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447323412] [2021-11-25 20:05:41,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:05:41,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:05:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:05:42,106 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-25 20:05:42,106 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:05:42,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447323412] [2021-11-25 20:05:42,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447323412] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:05:42,107 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:05:42,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 20:05:42,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799603456] [2021-11-25 20:05:42,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:05:42,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 20:05:42,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:05:42,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 20:05:42,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2021-11-25 20:05:42,109 INFO L87 Difference]: Start difference. First operand 346 states and 780 transitions. Second operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 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-25 20:05:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:05:43,144 INFO L93 Difference]: Finished difference Result 542 states and 1176 transitions. [2021-11-25 20:05:43,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-25 20:05:43,149 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 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-25 20:05:43,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:05:43,152 INFO L225 Difference]: With dead ends: 542 [2021-11-25 20:05:43,152 INFO L226 Difference]: Without dead ends: 496 [2021-11-25 20:05:43,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2021-11-25 20:05:43,153 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 20:05:43,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-25 20:05:43,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-11-25 20:05:43,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 370. [2021-11-25 20:05:43,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 368 states have (on average 2.244565217391304) internal successors, (826), 369 states have internal predecessors, (826), 0 states have call successors, (0), 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-25 20:05:43,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 826 transitions. [2021-11-25 20:05:43,184 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 826 transitions. Word has length 21 [2021-11-25 20:05:43,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:05:43,184 INFO L470 AbstractCegarLoop]: Abstraction has 370 states and 826 transitions. [2021-11-25 20:05:43,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 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-25 20:05:43,185 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 826 transitions. [2021-11-25 20:05:43,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 20:05:43,191 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:05:43,191 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2021-11-25 20:05:43,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-25 20:05:43,192 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-25 20:05:43,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:05:43,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1493244155, now seen corresponding path program 2 times [2021-11-25 20:05:43,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:05:43,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169199324] [2021-11-25 20:05:43,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:05:43,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:05:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:05:43,284 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-25 20:05:43,284 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:05:43,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169199324] [2021-11-25 20:05:43,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169199324] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:05:43,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261894849] [2021-11-25 20:05:43,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:05:43,285 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:05:43,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:05:43,286 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:05:43,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 20:05:43,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-25 20:05:43,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:05:43,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 20:05:43,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:05:43,496 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-25 20:05:43,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:05:43,577 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-25 20:05:43,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261894849] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:05:43,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1839164459] [2021-11-25 20:05:43,578 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-25 20:05:43,578 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:05:43,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2021-11-25 20:05:43,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133019170] [2021-11-25 20:05:43,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:05:43,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 20:05:43,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:05:43,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 20:05:43,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:05:43,580 INFO L87 Difference]: Start difference. First operand 370 states and 826 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 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-25 20:05:43,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:05:43,838 INFO L93 Difference]: Finished difference Result 704 states and 1509 transitions. [2021-11-25 20:05:43,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 20:05:43,839 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 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-25 20:05:43,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:05:43,844 INFO L225 Difference]: With dead ends: 704 [2021-11-25 20:05:43,844 INFO L226 Difference]: Without dead ends: 704 [2021-11-25 20:05:43,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2021-11-25 20:05:43,845 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 136 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:05:43,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 0 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:05:43,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-11-25 20:05:43,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 482. [2021-11-25 20:05:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 480 states have (on average 2.25) internal successors, (1080), 481 states have internal predecessors, (1080), 0 states have call successors, (0), 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-25 20:05:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1080 transitions. [2021-11-25 20:05:43,865 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1080 transitions. Word has length 27 [2021-11-25 20:05:43,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:05:43,865 INFO L470 AbstractCegarLoop]: Abstraction has 482 states and 1080 transitions. [2021-11-25 20:05:43,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 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-25 20:05:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1080 transitions. [2021-11-25 20:05:43,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-25 20:05:43,867 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:05:43,867 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-25 20:05:43,893 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-25 20:05:44,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:05:44,081 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-25 20:05:44,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:05:44,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2120607685, now seen corresponding path program 3 times [2021-11-25 20:05:44,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:05:44,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923545014] [2021-11-25 20:05:44,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:05:44,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:05:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:05:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:05:44,588 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:05:44,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923545014] [2021-11-25 20:05:44,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923545014] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:05:44,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593367225] [2021-11-25 20:05:44,589 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:05:44,589 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:05:44,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:05:44,590 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:05:44,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 20:05:44,699 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:05:44,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:05:44,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 61 conjunts are in the unsatisfiable core [2021-11-25 20:05:44,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:05:45,254 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 19 treesize of output 15 [2021-11-25 20:05:45,886 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 77 treesize of output 45 [2021-11-25 20:05:46,147 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:05:46,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:05:46,508 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 70 treesize of output 54 [2021-11-25 20:05:46,722 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-25 20:05:46,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593367225] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-25 20:05:46,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-25 20:05:46,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15, 15] total 41 [2021-11-25 20:05:46,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452470774] [2021-11-25 20:05:46,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:05:46,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 20:05:46,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:05:46,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 20:05:46,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1591, Unknown=0, NotChecked=0, Total=1722 [2021-11-25 20:05:46,725 INFO L87 Difference]: Start difference. First operand 482 states and 1080 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 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-25 20:05:48,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:05:48,628 INFO L93 Difference]: Finished difference Result 955 states and 2118 transitions. [2021-11-25 20:05:48,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-25 20:05:48,628 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 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-25 20:05:48,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:05:48,636 INFO L225 Difference]: With dead ends: 955 [2021-11-25 20:05:48,636 INFO L226 Difference]: Without dead ends: 955 [2021-11-25 20:05:48,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=299, Invalid=3361, Unknown=0, NotChecked=0, Total=3660 [2021-11-25 20:05:48,638 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 147 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:05:48,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 7 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-25 20:05:48,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2021-11-25 20:05:48,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 630. [2021-11-25 20:05:48,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 628 states have (on average 2.323248407643312) internal successors, (1459), 629 states have internal predecessors, (1459), 0 states have call successors, (0), 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-25 20:05:48,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 1459 transitions. [2021-11-25 20:05:48,664 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 1459 transitions. Word has length 28 [2021-11-25 20:05:48,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:05:48,664 INFO L470 AbstractCegarLoop]: Abstraction has 630 states and 1459 transitions. [2021-11-25 20:05:48,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 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-25 20:05:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 1459 transitions. [2021-11-25 20:05:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-25 20:05:48,667 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:05:48,667 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-25 20:05:48,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 20:05:48,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:05:48,881 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-25 20:05:48,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:05:48,881 INFO L85 PathProgramCache]: Analyzing trace with hash 219930875, now seen corresponding path program 4 times [2021-11-25 20:05:48,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:05:48,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516388427] [2021-11-25 20:05:48,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:05:48,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:05:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:05:49,649 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:05:49,650 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:05:49,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516388427] [2021-11-25 20:05:49,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516388427] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:05:49,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905465002] [2021-11-25 20:05:49,650 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:05:49,651 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:05:49,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:05:49,653 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:05:49,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 20:05:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:05:49,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 70 conjunts are in the unsatisfiable core [2021-11-25 20:05:49,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:05:49,833 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:05:49,833 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 15 treesize of output 15 [2021-11-25 20:05:50,368 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 19 treesize of output 15 [2021-11-25 20:05:50,604 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 50 treesize of output 46 [2021-11-25 20:05:51,107 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 77 treesize of output 45 [2021-11-25 20:06:15,651 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:06:15,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:06:15,978 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_297 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_297) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) is different from false [2021-11-25 20:06:15,986 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_297 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_297) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))) 4294967296) 4294967294))) is different from false [2021-11-25 20:06:15,993 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_297 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_297) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) is different from false [2021-11-25 20:06:16,001 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:06:16,001 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 1 case distinctions, treesize of input 29 treesize of output 30 [2021-11-25 20:06:16,011 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:06:16,012 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 49 treesize of output 52 [2021-11-25 20:06:16,017 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 28 treesize of output 22 [2021-11-25 20:06:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2021-11-25 20:06:16,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905465002] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:06:16,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [205653511] [2021-11-25 20:06:16,382 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java: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-25 20:06:16,382 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:06:16,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 14] total 45 [2021-11-25 20:06:16,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071403684] [2021-11-25 20:06:16,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:06:16,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-25 20:06:16,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:06:16,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-25 20:06:16,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1750, Unknown=15, NotChecked=258, Total=2162 [2021-11-25 20:06:16,385 INFO L87 Difference]: Start difference. First operand 630 states and 1459 transitions. Second operand has 47 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 46 states have internal predecessors, (83), 0 states have call successors, (0), 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-25 20:06:30,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:06:30,460 INFO L93 Difference]: Finished difference Result 2265 states and 5060 transitions. [2021-11-25 20:06:30,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-11-25 20:06:30,461 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 46 states have internal predecessors, (83), 0 states have call successors, (0), 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-25 20:06:30,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:06:30,477 INFO L225 Difference]: With dead ends: 2265 [2021-11-25 20:06:30,477 INFO L226 Difference]: Without dead ends: 2265 [2021-11-25 20:06:30,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 2664 ImplicationChecksByTransitivity, 36.5s TimeCoverageRelationStatistics Valid=885, Invalid=9406, Unknown=23, NotChecked=606, Total=10920 [2021-11-25 20:06:30,481 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 418 mSDsluCounter, 2386 mSDsCounter, 0 mSdLazyCounter, 4505 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 5968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 4505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1423 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:06:30,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [418 Valid, 2 Invalid, 5968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 4505 Invalid, 0 Unknown, 1423 Unchecked, 3.4s Time] [2021-11-25 20:06:30,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2021-11-25 20:06:30,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 729. [2021-11-25 20:06:30,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 727 states have (on average 2.3493810178817056) internal successors, (1708), 728 states have internal predecessors, (1708), 0 states have call successors, (0), 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-25 20:06:30,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1708 transitions. [2021-11-25 20:06:30,520 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1708 transitions. Word has length 28 [2021-11-25 20:06:30,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:06:30,521 INFO L470 AbstractCegarLoop]: Abstraction has 729 states and 1708 transitions. [2021-11-25 20:06:30,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 46 states have internal predecessors, (83), 0 states have call successors, (0), 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-25 20:06:30,521 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1708 transitions. [2021-11-25 20:06:30,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-25 20:06:30,523 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:06:30,523 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-25 20:06:30,556 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 20:06:30,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-25 20:06:30,749 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-25 20:06:30,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:06:30,750 INFO L85 PathProgramCache]: Analyzing trace with hash -12305353, now seen corresponding path program 5 times [2021-11-25 20:06:30,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:06:30,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712557034] [2021-11-25 20:06:30,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:06:30,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:06:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:06:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:06:31,315 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:06:31,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712557034] [2021-11-25 20:06:31,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712557034] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:06:31,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295235357] [2021-11-25 20:06:31,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:06:31,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:06:31,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:06:31,316 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:06:31,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 20:06:31,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-25 20:06:31,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:06:31,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 60 conjunts are in the unsatisfiable core [2021-11-25 20:06:31,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:06:31,439 INFO L354 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2021-11-25 20:06:31,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2021-11-25 20:06:31,829 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 19 treesize of output 15 [2021-11-25 20:06:31,909 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 58 treesize of output 54 [2021-11-25 20:06:32,474 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-25 20:06:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:06:32,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:06:33,149 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_351) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))))) (= .cse0 (+ (* 4294967296 (div .cse0 4294967296)) 4294967294))))) is different from false [2021-11-25 20:06:33,159 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:06:33,160 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 1 case distinctions, treesize of input 56 treesize of output 45 [2021-11-25 20:06:33,168 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:06:33,168 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 71 treesize of output 66 [2021-11-25 20:06:33,183 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 42 treesize of output 30 [2021-11-25 20:06:33,490 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:06:33,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295235357] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:06:33,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2084592568] [2021-11-25 20:06:33,490 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-25 20:06:33,491 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:06:33,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 42 [2021-11-25 20:06:33,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77880259] [2021-11-25 20:06:33,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:06:33,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-11-25 20:06:33,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:06:33,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-11-25 20:06:33,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1684, Unknown=1, NotChecked=82, Total=1892 [2021-11-25 20:06:33,494 INFO L87 Difference]: Start difference. First operand 729 states and 1708 transitions. Second operand has 44 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 43 states have internal predecessors, (82), 0 states have call successors, (0), 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-25 20:06:49,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:06:49,040 INFO L93 Difference]: Finished difference Result 2245 states and 4929 transitions. [2021-11-25 20:06:49,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-11-25 20:06:49,041 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 43 states have internal predecessors, (82), 0 states have call successors, (0), 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-25 20:06:49,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:06:49,055 INFO L225 Difference]: With dead ends: 2245 [2021-11-25 20:06:49,055 INFO L226 Difference]: Without dead ends: 2245 [2021-11-25 20:06:49,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 122 ConstructedPredicates, 1 IntricatePredicates, 3 DeprecatedPredicates, 3938 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=1842, Invalid=13157, Unknown=11, NotChecked=242, Total=15252 [2021-11-25 20:06:49,061 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 741 mSDsluCounter, 2226 mSDsCounter, 0 mSdLazyCounter, 4953 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 4953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 326 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:06:49,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [741 Valid, 0 Invalid, 5459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 4953 Invalid, 0 Unknown, 326 Unchecked, 4.0s Time] [2021-11-25 20:06:49,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2021-11-25 20:06:49,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 657. [2021-11-25 20:06:49,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 655 states have (on average 2.3099236641221372) internal successors, (1513), 656 states have internal predecessors, (1513), 0 states have call successors, (0), 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-25 20:06:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1513 transitions. [2021-11-25 20:06:49,098 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1513 transitions. Word has length 28 [2021-11-25 20:06:49,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:06:49,099 INFO L470 AbstractCegarLoop]: Abstraction has 657 states and 1513 transitions. [2021-11-25 20:06:49,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 43 states have internal predecessors, (82), 0 states have call successors, (0), 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-25 20:06:49,099 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1513 transitions. [2021-11-25 20:06:49,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-25 20:06:49,101 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:06:49,101 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-25 20:06:49,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-25 20:06:49,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-25 20:06:49,321 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-25 20:06:49,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:06:49,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1535289925, now seen corresponding path program 6 times [2021-11-25 20:06:49,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:06:49,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422913011] [2021-11-25 20:06:49,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:06:49,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:06:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:06:50,032 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:06:50,032 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:06:50,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422913011] [2021-11-25 20:06:50,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422913011] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:06:50,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256129625] [2021-11-25 20:06:50,033 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:06:50,033 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:06:50,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:06:50,034 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:06:50,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 20:06:50,148 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:06:50,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:06:50,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 70 conjunts are in the unsatisfiable core [2021-11-25 20:06:50,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:06:50,171 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:06:50,172 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 15 treesize of output 15 [2021-11-25 20:06:50,658 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 19 treesize of output 15 [2021-11-25 20:06:50,752 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 58 treesize of output 54 [2021-11-25 20:06:51,392 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 77 treesize of output 45 [2021-11-25 20:06:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:06:52,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:06:52,794 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_406) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))))) (= (+ (* 4294967296 (div .cse0 4294967296)) 4294967294) .cse0)))) is different from false [2021-11-25 20:06:52,804 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:06:52,805 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 1 case distinctions, treesize of input 56 treesize of output 45 [2021-11-25 20:06:52,814 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:06:52,814 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 71 treesize of output 66 [2021-11-25 20:06:52,818 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 42 treesize of output 30 [2021-11-25 20:06:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:06:53,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256129625] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:06:53,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [257137975] [2021-11-25 20:06:53,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-25 20:06:53,152 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:06:53,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 14] total 44 [2021-11-25 20:06:53,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093304287] [2021-11-25 20:06:53,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:06:53,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-11-25 20:06:53,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:06:53,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-11-25 20:06:53,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1844, Unknown=1, NotChecked=86, Total=2070 [2021-11-25 20:06:53,155 INFO L87 Difference]: Start difference. First operand 657 states and 1513 transitions. Second operand has 46 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 45 states have internal predecessors, (82), 0 states have call successors, (0), 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-25 20:07:01,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:07:01,260 INFO L93 Difference]: Finished difference Result 1279 states and 2782 transitions. [2021-11-25 20:07:01,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-11-25 20:07:01,260 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 45 states have internal predecessors, (82), 0 states have call successors, (0), 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-25 20:07:01,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:07:01,267 INFO L225 Difference]: With dead ends: 1279 [2021-11-25 20:07:01,267 INFO L226 Difference]: Without dead ends: 1279 [2021-11-25 20:07:01,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 101 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=924, Invalid=9365, Unknown=17, NotChecked=200, Total=10506 [2021-11-25 20:07:01,271 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 550 mSDsluCounter, 2647 mSDsCounter, 0 mSdLazyCounter, 5852 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 5852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 510 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-11-25 20:07:01,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [550 Valid, 0 Invalid, 6501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 5852 Invalid, 0 Unknown, 510 Unchecked, 3.6s Time] [2021-11-25 20:07:01,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2021-11-25 20:07:01,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 602. [2021-11-25 20:07:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 600 states have (on average 2.3033333333333332) internal successors, (1382), 601 states have internal predecessors, (1382), 0 states have call successors, (0), 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-25 20:07:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1382 transitions. [2021-11-25 20:07:01,313 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1382 transitions. Word has length 28 [2021-11-25 20:07:01,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:07:01,314 INFO L470 AbstractCegarLoop]: Abstraction has 602 states and 1382 transitions. [2021-11-25 20:07:01,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 45 states have internal predecessors, (82), 0 states have call successors, (0), 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-25 20:07:01,314 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1382 transitions. [2021-11-25 20:07:01,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 20:07:01,316 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:01,317 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:07:01,354 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-25 20:07:01,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-25 20:07:01,541 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-25 20:07:01,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:01,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1628568180, now seen corresponding path program 1 times [2021-11-25 20:07:01,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:01,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901792263] [2021-11-25 20:07:01,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:01,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:01,669 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:07:01,670 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:07:01,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901792263] [2021-11-25 20:07:01,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901792263] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:07:01,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541665587] [2021-11-25 20:07:01,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:01,670 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:07:01,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:07:01,671 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:07:01,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 20:07:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:01,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 20:07:01,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:07:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-25 20:07:01,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:07:01,943 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-25 20:07:01,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541665587] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:07:01,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1970289444] [2021-11-25 20:07:01,944 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-25 20:07:01,945 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:07:01,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2021-11-25 20:07:01,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263817194] [2021-11-25 20:07:01,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:07:01,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 20:07:01,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:07:01,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 20:07:01,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:07:01,948 INFO L87 Difference]: Start difference. First operand 602 states and 1382 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 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-25 20:07:02,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:07:02,305 INFO L93 Difference]: Finished difference Result 926 states and 2019 transitions. [2021-11-25 20:07:02,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 20:07:02,305 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-25 20:07:02,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:07:02,311 INFO L225 Difference]: With dead ends: 926 [2021-11-25 20:07:02,311 INFO L226 Difference]: Without dead ends: 886 [2021-11-25 20:07:02,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2021-11-25 20:07:02,312 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 129 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:07:02,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 0 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 20:07:02,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2021-11-25 20:07:02,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 664. [2021-11-25 20:07:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 662 states have (on average 2.3429003021148036) internal successors, (1551), 663 states have internal predecessors, (1551), 0 states have call successors, (0), 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-25 20:07:02,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1551 transitions. [2021-11-25 20:07:02,334 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1551 transitions. Word has length 31 [2021-11-25 20:07:02,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:07:02,334 INFO L470 AbstractCegarLoop]: Abstraction has 664 states and 1551 transitions. [2021-11-25 20:07:02,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 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-25 20:07:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1551 transitions. [2021-11-25 20:07:02,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:07:02,336 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:02,336 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-25 20:07:02,369 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-25 20:07:02,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:07:02,562 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-25 20:07:02,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:02,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1437122815, now seen corresponding path program 1 times [2021-11-25 20:07:02,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:02,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762626711] [2021-11-25 20:07:02,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:02,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:03,276 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-25 20:07:03,276 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:07:03,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762626711] [2021-11-25 20:07:03,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762626711] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:07:03,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357661765] [2021-11-25 20:07:03,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:03,276 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:07:03,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:07:03,277 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:07:03,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 20:07:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:03,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-25 20:07:03,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:07:03,782 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 19 treesize of output 15 [2021-11-25 20:07:04,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:07:04,281 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-25 20:07:05,113 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:07:05,114 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 45 [2021-11-25 20:07:43,483 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-25 20:07:43,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:08:06,020 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:08:06,021 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 1 case distinctions, treesize of input 35 treesize of output 36 [2021-11-25 20:08:06,030 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:08:06,031 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 36 treesize of output 40 [2021-11-25 20:08:06,050 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 49 treesize of output 42 [2021-11-25 20:08:06,074 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:08:06,074 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 63 treesize of output 67 [2021-11-25 20:08:06,729 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-25 20:08:06,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357661765] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:08:06,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [927262409] [2021-11-25 20:08:06,730 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-25 20:08:06,730 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:08:06,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 62 [2021-11-25 20:08:06,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478036026] [2021-11-25 20:08:06,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:08:06,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-11-25 20:08:06,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:08:06,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-11-25 20:08:06,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=3559, Unknown=32, NotChecked=0, Total=4032 [2021-11-25 20:08:06,733 INFO L87 Difference]: Start difference. First operand 664 states and 1551 transitions. Second operand has 64 states, 63 states have (on average 1.6984126984126984) internal successors, (107), 63 states have internal predecessors, (107), 0 states have call successors, (0), 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-25 20:09:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:00,798 INFO L93 Difference]: Finished difference Result 1426 states and 3128 transitions. [2021-11-25 20:09:00,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-11-25 20:09:00,798 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 1.6984126984126984) internal successors, (107), 63 states have internal predecessors, (107), 0 states have call successors, (0), 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-25 20:09:00,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:00,806 INFO L225 Difference]: With dead ends: 1426 [2021-11-25 20:09:00,806 INFO L226 Difference]: Without dead ends: 1409 [2021-11-25 20:09:00,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3961 ImplicationChecksByTransitivity, 114.2s TimeCoverageRelationStatistics Valid=1334, Invalid=10179, Unknown=43, NotChecked=0, Total=11556 [2021-11-25 20:09:00,810 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 535 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 2235 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1616 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:00,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [535 Valid, 0 Invalid, 3917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2235 Invalid, 0 Unknown, 1616 Unchecked, 2.0s Time] [2021-11-25 20:09:00,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2021-11-25 20:09:00,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1027. [2021-11-25 20:09:00,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1025 states have (on average 2.346341463414634) internal successors, (2405), 1026 states have internal predecessors, (2405), 0 states have call successors, (0), 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-25 20:09:00,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 2405 transitions. [2021-11-25 20:09:00,857 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 2405 transitions. Word has length 36 [2021-11-25 20:09:00,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:00,857 INFO L470 AbstractCegarLoop]: Abstraction has 1027 states and 2405 transitions. [2021-11-25 20:09:00,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 1.6984126984126984) internal successors, (107), 63 states have internal predecessors, (107), 0 states have call successors, (0), 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-25 20:09:00,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 2405 transitions. [2021-11-25 20:09:00,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:09:00,860 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:00,860 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-25 20:09:00,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-25 20:09:01,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-25 20:09:01,085 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-25 20:09:01,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:01,086 INFO L85 PathProgramCache]: Analyzing trace with hash -232468701, now seen corresponding path program 2 times [2021-11-25 20:09:01,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:01,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294205175] [2021-11-25 20:09:01,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:01,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:01,953 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-25 20:09:01,954 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:01,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294205175] [2021-11-25 20:09:01,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294205175] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:09:01,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805778067] [2021-11-25 20:09:01,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:09:01,955 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:09:01,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:09:01,955 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:09:01,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-25 20:09:02,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:09:02,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:09:02,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 71 conjunts are in the unsatisfiable core [2021-11-25 20:09:02,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:09:02,456 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 19 treesize of output 15 [2021-11-25 20:09:03,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:09:03,120 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 71 treesize of output 43 [2021-11-25 20:09:03,949 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-25 20:09:38,548 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-25 20:09:38,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:09:40,645 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_135| Int) (v_ArrVal_587 Int)) (or (not (let ((.cse0 (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| 4)) v_ArrVal_587)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= (+ 4294967294 (* 4294967296 (div .cse0 4294967296))) .cse0))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| c_~top~0))) is different from false [2021-11-25 20:09:42,043 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_135| Int) (v_ArrVal_587 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_86| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_86| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_86| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| 4)) v_ArrVal_587)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= .cse0 (+ (* 4294967296 (div .cse0 4294967296)) 4294967294)))))) is different from false [2021-11-25 20:09:59,442 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 70 treesize of output 54 [2021-11-25 20:09:59,712 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-25 20:09:59,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805778067] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:09:59,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [160657657] [2021-11-25 20:09:59,712 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-25 20:09:59,714 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:09:59,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 57 [2021-11-25 20:09:59,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227835502] [2021-11-25 20:09:59,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:09:59,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2021-11-25 20:09:59,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:59,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-11-25 20:09:59,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2884, Unknown=19, NotChecked=218, Total=3306 [2021-11-25 20:09:59,716 INFO L87 Difference]: Start difference. First operand 1027 states and 2405 transitions. Second operand has 58 states, 57 states have (on average 1.8596491228070176) internal successors, (106), 58 states have internal predecessors, (106), 0 states have call successors, (0), 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-25 20:10:03,162 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0)) (.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4)))) (.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= .cse0 4) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_135| Int) (v_ArrVal_587 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_86| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_86| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (let ((.cse2 (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_86| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| 4)) v_ArrVal_587)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= .cse2 (+ (* 4294967296 (div .cse2 4294967296)) 4294967294)))))) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse3) (<= 0 .cse1) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= .cse3 4) (<= 4 (* 4 c_~top~0)))) is different from false [2021-11-25 20:10:04,286 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)))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_135| Int) (v_ArrVal_587 Int)) (or (not (let ((.cse1 (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| 4)) v_ArrVal_587)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= (+ 4294967294 (* 4294967296 (div .cse1 4294967296))) .cse1))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| c_~top~0))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 5 |c_~#arr~0.base|) (<= 0 .cse2) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= c_~top~0 1) (<= .cse2 4) (<= 4 (* 4 c_~top~0)))) is different from false [2021-11-25 20:10:09,435 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 4)))) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8)))) (.cse2 (select .cse4 0))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= .cse2 4) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_135| Int) (v_ArrVal_587 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_86| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_86| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (let ((.cse3 (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_86| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| 4)) v_ArrVal_587)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= .cse3 (+ (* 4294967296 (div .cse3 4294967296)) 4294967294)))))) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= c_~top~0 2) (<= 0 .cse1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 .cse2) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) is different from false [2021-11-25 20:10:10,903 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 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_135| Int) (v_ArrVal_587 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_86| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_86| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (let ((.cse1 (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_86| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| 4)) v_ArrVal_587)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= .cse1 (+ (* 4294967296 (div .cse1 4294967296)) 4294967294)))))) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296))) is different from false [2021-11-25 20:10:11,993 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 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_135| Int) (v_ArrVal_587 Int)) (or (not (let ((.cse1 (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| 4)) v_ArrVal_587)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= (+ 4294967294 (* 4294967296 (div .cse1 4294967296))) .cse1))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| c_~top~0))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 5 |c_~#arr~0.base|) (<= 0 .cse0))) is different from false [2021-11-25 20:10:23,509 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 4)))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse1 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_135| Int) (v_ArrVal_587 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_86| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_86| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (let ((.cse2 (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_86| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| 4)) v_ArrVal_587)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= .cse2 (+ (* 4294967296 (div .cse2 4294967296)) 4294967294)))))) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) is different from false [2021-11-25 20:10:25,335 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (not (= |c_t1Thread1of1ForFork0_push_~x#1| (+ 4294967294 (* 4294967296 (div |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_135| Int) (v_ArrVal_587 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_86| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_86| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_86| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| 4)) v_ArrVal_587)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= .cse0 (+ (* 4294967296 (div .cse0 4294967296)) 4294967294)))))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (not (let ((.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= (+ 4294967294 (* 4294967296 (div .cse1 4294967296))) .cse1))) (not (= |c_t1Thread1of1ForFork0_push_#in~x#1| (+ 4294967294 (* 4294967296 (div |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))))) is different from false [2021-11-25 20:10:59,413 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse0 (select .cse3 (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4)))) (.cse1 (select .cse3 0))) (and (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (<= .cse1 4) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_135| Int) (v_ArrVal_587 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_86| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_86| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (let ((.cse2 (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_86| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| 4)) v_ArrVal_587)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= .cse2 (+ (* 4294967296 (div .cse2 4294967296)) 4294967294)))))) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse0) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 0 .cse1) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) is different from false [2021-11-25 20:11:08,868 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (and (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_135| Int) (v_ArrVal_587 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_86| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_86| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_86| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| 4)) v_ArrVal_587)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= .cse0 (+ (* 4294967296 (div .cse0 4294967296)) 4294967294)))))) (not (let ((.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (= (+ 4294967294 (* 4294967296 (div .cse1 4294967296))) .cse1))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (not (let ((.cse4 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 4))))) (= (+ 4294967294 (* 4294967296 (div .cse4 4294967296))) .cse4))) (not (= |c_t1Thread1of1ForFork0_push_#in~x#1| (+ 4294967294 (* 4294967296 (div |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296))))))) is different from false [2021-11-25 20:11:16,650 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_135| Int) (v_ArrVal_587 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_86| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_86| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_86| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| 4)) v_ArrVal_587)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= .cse0 (+ (* 4294967296 (div .cse0 4294967296)) 4294967294)))))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (not (let ((.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= (+ 4294967294 (* 4294967296 (div .cse1 4294967296))) .cse1))) (not (= |c_t1Thread1of1ForFork0_push_#in~x#1| (+ 4294967294 (* 4294967296 (div |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))))) is different from false [2021-11-25 20:11:22,343 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 (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_135| Int) (v_ArrVal_587 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_86| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_86| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (let ((.cse1 (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_86| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_135| 4)) v_ArrVal_587)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= .cse1 (+ (* 4294967296 (div .cse1 4294967296)) 4294967294)))))) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296))) is different from false [2021-11-25 20:11:40,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:11:40,615 INFO L93 Difference]: Finished difference Result 4377 states and 9710 transitions. [2021-11-25 20:11:40,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2021-11-25 20:11:40,616 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.8596491228070176) internal successors, (106), 58 states have internal predecessors, (106), 0 states have call successors, (0), 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-25 20:11:40,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:11:40,638 INFO L225 Difference]: With dead ends: 4377 [2021-11-25 20:11:40,638 INFO L226 Difference]: Without dead ends: 4352 [2021-11-25 20:11:40,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 175 ConstructedPredicates, 13 IntricatePredicates, 1 DeprecatedPredicates, 8187 ImplicationChecksByTransitivity, 151.0s TimeCoverageRelationStatistics Valid=2005, Invalid=24717, Unknown=62, NotChecked=4368, Total=31152 [2021-11-25 20:11:40,643 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1287 mSDsluCounter, 3189 mSDsCounter, 0 mSdLazyCounter, 6100 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 6100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2077 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2021-11-25 20:11:40,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1287 Valid, 0 Invalid, 8368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 6100 Invalid, 0 Unknown, 2077 Unchecked, 6.7s Time] [2021-11-25 20:11:40,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4352 states. [2021-11-25 20:11:40,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4352 to 1929. [2021-11-25 20:11:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1927 states have (on average 2.5090814737934615) internal successors, (4835), 1928 states have internal predecessors, (4835), 0 states have call successors, (0), 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-25 20:11:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 4835 transitions. [2021-11-25 20:11:40,755 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 4835 transitions. Word has length 36 [2021-11-25 20:11:40,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:11:40,756 INFO L470 AbstractCegarLoop]: Abstraction has 1929 states and 4835 transitions. [2021-11-25 20:11:40,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 1.8596491228070176) internal successors, (106), 58 states have internal predecessors, (106), 0 states have call successors, (0), 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-25 20:11:40,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 4835 transitions. [2021-11-25 20:11:40,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:11:40,760 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:11:40,760 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-25 20:11:40,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-25 20:11:40,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-25 20:11:40,981 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-25 20:11:40,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:11:40,982 INFO L85 PathProgramCache]: Analyzing trace with hash 613455763, now seen corresponding path program 3 times [2021-11-25 20:11:40,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:11:40,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502882985] [2021-11-25 20:11:40,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:11:40,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:11:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:11:41,812 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-25 20:11:41,813 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:11:41,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502882985] [2021-11-25 20:11:41,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502882985] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:11:41,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316669581] [2021-11-25 20:11:41,813 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:11:41,813 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:11:41,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:11:41,814 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:11:41,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-25 20:11:41,922 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:11:41,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:11:41,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 83 conjunts are in the unsatisfiable core [2021-11-25 20:11:41,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:11:42,333 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 19 treesize of output 15 [2021-11-25 20:11:42,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:11:42,931 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-25 20:11:43,854 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 77 treesize of output 45 [2021-11-25 20:12:18,337 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-25 20:12:18,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:12:19,535 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 70 treesize of output 54 [2021-11-25 20:12:19,828 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-25 20:12:19,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316669581] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:12:19,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1524182715] [2021-11-25 20:12:19,829 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java: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-25 20:12:19,830 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:12:19,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 19] total 58 [2021-11-25 20:12:19,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34430546] [2021-11-25 20:12:19,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:12:19,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2021-11-25 20:12:19,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:12:19,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-11-25 20:12:19,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=3180, Unknown=16, NotChecked=0, Total=3422 [2021-11-25 20:12:19,832 INFO L87 Difference]: Start difference. First operand 1929 states and 4835 transitions. Second operand has 59 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 59 states have internal predecessors, (106), 0 states have call successors, (0), 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-25 20:12:48,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:12:48,692 INFO L93 Difference]: Finished difference Result 3985 states and 9340 transitions. [2021-11-25 20:12:48,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-11-25 20:12:48,693 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 59 states have internal predecessors, (106), 0 states have call successors, (0), 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-25 20:12:48,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:12:48,715 INFO L225 Difference]: With dead ends: 3985 [2021-11-25 20:12:48,715 INFO L226 Difference]: Without dead ends: 3683 [2021-11-25 20:12:48,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 35 SyntacticMatches, 16 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5974 ImplicationChecksByTransitivity, 61.6s TimeCoverageRelationStatistics Valid=1306, Invalid=14931, Unknown=19, NotChecked=0, Total=16256 [2021-11-25 20:12:48,717 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 698 mSDsluCounter, 2292 mSDsCounter, 0 mSdLazyCounter, 4203 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 4203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1192 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:12:48,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [698 Valid, 0 Invalid, 5508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 4203 Invalid, 0 Unknown, 1192 Unchecked, 4.4s Time] [2021-11-25 20:12:48,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3683 states. [2021-11-25 20:12:48,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3683 to 1462. [2021-11-25 20:12:48,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1460 states have (on average 2.4095890410958902) internal successors, (3518), 1461 states have internal predecessors, (3518), 0 states have call successors, (0), 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-25 20:12:48,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 3518 transitions. [2021-11-25 20:12:48,802 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 3518 transitions. Word has length 36 [2021-11-25 20:12:48,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:12:48,802 INFO L470 AbstractCegarLoop]: Abstraction has 1462 states and 3518 transitions. [2021-11-25 20:12:48,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 59 states have internal predecessors, (106), 0 states have call successors, (0), 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-25 20:12:48,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 3518 transitions. [2021-11-25 20:12:48,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:12:48,808 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:12:48,808 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-25 20:12:48,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-25 20:12:49,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-25 20:12:49,021 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-25 20:12:49,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:12:49,022 INFO L85 PathProgramCache]: Analyzing trace with hash -872676519, now seen corresponding path program 4 times [2021-11-25 20:12:49,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:12:49,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092227584] [2021-11-25 20:12:49,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:12:49,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:12:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:12:50,271 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-25 20:12:50,271 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:12:50,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092227584] [2021-11-25 20:12:50,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092227584] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:12:50,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106929796] [2021-11-25 20:12:50,272 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:12:50,273 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:12:50,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:12:50,274 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:12:50,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-25 20:12:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:12:50,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 96 conjunts are in the unsatisfiable core [2021-11-25 20:12:50,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:12:50,442 INFO L354 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2021-11-25 20:12:50,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2021-11-25 20:12:50,873 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 19 treesize of output 15 [2021-11-25 20:12:50,985 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 21 treesize of output 21 [2021-11-25 20:12:51,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:12:51,241 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 30 treesize of output 25 [2021-11-25 20:12:52,021 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:12:52,022 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2021-11-25 20:12:52,167 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-25 20:12:52,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:12:53,317 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_712 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_712) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= (+ 4294967294 (* 4294967296 (div .cse0 4294967296))) .cse0)))) (<= c_~top~0 0)) is different from false [2021-11-25 20:12:53,333 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_712 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_712) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))))) (= (+ 4294967294 (* 4294967296 (div .cse0 4294967296))) .cse0)))) (<= (+ |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 1) 0)) is different from false [2021-11-25 20:12:53,347 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_712 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_712) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))))) (= (+ (* 4294967296 (div .cse0 4294967296)) 4294967294) .cse0)))) (<= (+ c_~top~0 1) 0)) is different from false [2021-11-25 20:12:53,360 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:12:53,360 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 1 case distinctions, treesize of input 56 treesize of output 45 [2021-11-25 20:12:53,375 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:12:53,375 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 71 treesize of output 66 [2021-11-25 20:12:53,382 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 42 treesize of output 30 [2021-11-25 20:12:53,864 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-25 20:12:53,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106929796] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:12:53,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [806801230] [2021-11-25 20:12:53,865 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-25 20:12:53,865 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:12:53,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 20] total 56 [2021-11-25 20:12:53,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322871688] [2021-11-25 20:12:53,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:12:53,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2021-11-25 20:12:53,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:12:53,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-11-25 20:12:53,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=2668, Unknown=3, NotChecked=324, Total=3306 [2021-11-25 20:12:53,868 INFO L87 Difference]: Start difference. First operand 1462 states and 3518 transitions. Second operand has 58 states, 57 states have (on average 1.719298245614035) internal successors, (98), 57 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-25 20:13:03,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:13:03,316 INFO L93 Difference]: Finished difference Result 3338 states and 7604 transitions. [2021-11-25 20:13:03,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2021-11-25 20:13:03,316 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.719298245614035) internal successors, (98), 57 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-25 20:13:03,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:13:03,322 INFO L225 Difference]: With dead ends: 3338 [2021-11-25 20:13:03,322 INFO L226 Difference]: Without dead ends: 3121 [2021-11-25 20:13:03,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 36 SyntacticMatches, 10 SemanticMatches, 116 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 4004 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1507, Invalid=11609, Unknown=6, NotChecked=684, Total=13806 [2021-11-25 20:13:03,323 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 682 mSDsluCounter, 1978 mSDsCounter, 0 mSdLazyCounter, 3869 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 3869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1437 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:13:03,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [682 Valid, 0 Invalid, 5433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 3869 Invalid, 0 Unknown, 1437 Unchecked, 3.4s Time] [2021-11-25 20:13:03,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3121 states. [2021-11-25 20:13:03,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3121 to 1788. [2021-11-25 20:13:03,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1786 states have (on average 2.4535274356103023) internal successors, (4382), 1787 states have internal predecessors, (4382), 0 states have call successors, (0), 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-25 20:13:03,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 4382 transitions. [2021-11-25 20:13:03,378 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 4382 transitions. Word has length 36 [2021-11-25 20:13:03,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:13:03,379 INFO L470 AbstractCegarLoop]: Abstraction has 1788 states and 4382 transitions. [2021-11-25 20:13:03,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 1.719298245614035) internal successors, (98), 57 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-25 20:13:03,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 4382 transitions. [2021-11-25 20:13:03,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:13:03,383 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:13:03,383 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-25 20:13:03,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-25 20:13:03,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-25 20:13:03,609 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-25 20:13:03,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:13:03,610 INFO L85 PathProgramCache]: Analyzing trace with hash 864356767, now seen corresponding path program 5 times [2021-11-25 20:13:03,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:13:03,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223706357] [2021-11-25 20:13:03,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:13:03,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:13:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:13:04,564 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-25 20:13:04,565 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:13:04,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223706357] [2021-11-25 20:13:04,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223706357] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:13:04,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673827520] [2021-11-25 20:13:04,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:13:04,565 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:13:04,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:13:04,566 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:13:04,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-25 20:13:04,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:13:04,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:13:04,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 82 conjunts are in the unsatisfiable core [2021-11-25 20:13:04,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:13:04,732 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-25 20:13:04,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2021-11-25 20:13:05,082 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 19 treesize of output 15 [2021-11-25 20:13:05,399 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 62 treesize of output 58 [2021-11-25 20:13:05,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:13:05,824 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 71 treesize of output 43 [2021-11-25 20:13:06,632 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-25 20:13:41,364 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-25 20:13:41,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:13:48,146 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_154| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_93| Int) (v_ArrVal_778 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_154| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_93| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_154| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_93|) v_ArrVal_778)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) is different from false [2021-11-25 20:14:12,625 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_777) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))) is different from false [2021-11-25 20:14:12,632 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_777) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))) 4294967296) 4294967294))) is different from false [2021-11-25 20:14:12,639 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_777) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2021-11-25 20:14:12,646 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:14:12,646 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 1 case distinctions, treesize of input 29 treesize of output 30 [2021-11-25 20:14:12,656 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:14:12,657 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 49 treesize of output 52 [2021-11-25 20:14:12,662 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 28 treesize of output 22 [2021-11-25 20:14:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-25 20:14:13,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673827520] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:14:13,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [333980197] [2021-11-25 20:14:13,027 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-25 20:14:13,028 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:14:13,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 61 [2021-11-25 20:14:13,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083543048] [2021-11-25 20:14:13,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:14:13,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2021-11-25 20:14:13,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:14:13,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-11-25 20:14:13,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3203, Unknown=22, NotChecked=468, Total=3906 [2021-11-25 20:14:13,030 INFO L87 Difference]: Start difference. First operand 1788 states and 4382 transitions. Second operand has 63 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 62 states have internal predecessors, (107), 0 states have call successors, (0), 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-25 20:14:16,949 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0)) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4)))) (.cse2 (select .cse4 0)) (.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= 0 .cse0) (not (= 5 |c_ULTIMATE.start_main_~#id2~0#1.base|)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= .cse0 4) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= .cse2 4) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse3) (<= 0 .cse1) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= c_~top~0 1) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 0 .cse2) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_154| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_93| Int) (v_ArrVal_778 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_154| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_93| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_154| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_93|) v_ArrVal_778)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= .cse3 4) (<= 4 (* 4 c_~top~0))))) is different from false [2021-11-25 20:14:23,118 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 4)))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8)))) (.cse2 (select .cse3 0))) (and (<= 0 .cse0) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= .cse2 4) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= c_~top~0 2) (<= 0 .cse1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 .cse2) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_154| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_93| Int) (v_ArrVal_778 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_154| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_93| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_154| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_93|) v_ArrVal_778)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))))))) is different from false [2021-11-25 20:14:25,038 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 (< .cse0 4294967296) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_154| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_93| Int) (v_ArrVal_778 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_154| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_93| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_154| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_93|) v_ArrVal_778)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))))) is different from false [2021-11-25 20:14:30,929 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 4)))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8)))) (.cse2 (select .cse3 0))) (and (not (= 5 |c_ULTIMATE.start_main_~#id2~0#1.base|)) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= .cse2 4) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= c_~top~0 2) (<= 0 .cse1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 .cse2) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_154| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_93| Int) (v_ArrVal_778 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_154| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_93| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_154| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_93|) v_ArrVal_778)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) is different from false [2021-11-25 20:14:47,834 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 .cse2 (+ |c_~#arr~0.offset| .cse3 (- 4)))) (.cse0 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (not (= 5 |c_ULTIMATE.start_main_~#id2~0#1.base|)) (<= 0 .cse0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse1 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_154| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_93| Int) (v_ArrVal_778 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_154| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_93| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_154| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_93|) v_ArrVal_778)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) is different from false [2021-11-25 20:14:52,020 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 .cse2 (+ |c_~#arr~0.offset| .cse3 (- 4)))) (.cse0 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (not (= 5 |c_ULTIMATE.start_main_~#id2~0#1.base|)) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse1 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_154| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_93| Int) (v_ArrVal_778 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_154| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_93| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_154| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_93|) v_ArrVal_778)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) is different from false [2021-11-25 20:14:53,994 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 .cse2 (+ |c_~#arr~0.offset| .cse3 (- 4)))) (.cse0 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (not (= 5 |c_ULTIMATE.start_main_~#id2~0#1.base|)) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse1 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_154| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_93| Int) (v_ArrVal_778 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_154| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_93| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_154| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_93|) v_ArrVal_778)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) is different from false [2021-11-25 20:14:55,989 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4)))) (.cse1 (select .cse2 0))) (and (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (<= .cse1 4) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse0) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_154| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_93| Int) (v_ArrVal_778 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_154| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_93| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_154| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_93|) v_ArrVal_778)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))))))) is different from false [2021-11-25 20:15:12,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:15:12,842 INFO L93 Difference]: Finished difference Result 4241 states and 9692 transitions. [2021-11-25 20:15:12,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2021-11-25 20:15:12,842 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 62 states have internal predecessors, (107), 0 states have call successors, (0), 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-25 20:15:12,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:15:12,850 INFO L225 Difference]: With dead ends: 4241 [2021-11-25 20:15:12,850 INFO L226 Difference]: Without dead ends: 4207 [2021-11-25 20:15:12,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 151 ConstructedPredicates, 12 IntricatePredicates, 4 DeprecatedPredicates, 4903 ImplicationChecksByTransitivity, 119.3s TimeCoverageRelationStatistics Valid=1723, Invalid=18035, Unknown=30, NotChecked=3468, Total=23256 [2021-11-25 20:15:12,852 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 758 mSDsluCounter, 3274 mSDsCounter, 0 mSdLazyCounter, 6279 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 9891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 6279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3456 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:15:12,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [758 Valid, 1 Invalid, 9891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 6279 Invalid, 0 Unknown, 3456 Unchecked, 8.1s Time] [2021-11-25 20:15:12,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4207 states. [2021-11-25 20:15:12,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4207 to 2061. [2021-11-25 20:15:12,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2061 states, 2059 states have (on average 2.457989315201554) internal successors, (5061), 2060 states have internal predecessors, (5061), 0 states have call successors, (0), 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-25 20:15:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 5061 transitions. [2021-11-25 20:15:12,922 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 5061 transitions. Word has length 36 [2021-11-25 20:15:12,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:15:12,923 INFO L470 AbstractCegarLoop]: Abstraction has 2061 states and 5061 transitions. [2021-11-25 20:15:12,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 62 states have internal predecessors, (107), 0 states have call successors, (0), 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-25 20:15:12,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 5061 transitions. [2021-11-25 20:15:12,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:15:12,927 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:15:12,927 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-25 20:15:12,960 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-25 20:15:13,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-25 20:15:13,142 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-25 20:15:13,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:15:13,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1876770491, now seen corresponding path program 6 times [2021-11-25 20:15:13,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:15:13,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725710900] [2021-11-25 20:15:13,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:15:13,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:15:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:15:14,591 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-25 20:15:14,591 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:15:14,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725710900] [2021-11-25 20:15:14,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725710900] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:15:14,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353738966] [2021-11-25 20:15:14,591 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:15:14,591 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:15:14,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:15:14,593 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:15:14,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-25 20:15:14,712 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:15:14,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:15:14,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 87 conjunts are in the unsatisfiable core [2021-11-25 20:15:14,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:15:14,743 INFO L354 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2021-11-25 20:15:14,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2021-11-25 20:15:15,249 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 19 treesize of output 15 [2021-11-25 20:15:15,548 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 42 treesize of output 38 [2021-11-25 20:15:15,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:15:15,979 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-25 20:15:17,030 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 77 treesize of output 45 [2021-11-25 20:15:43,581 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-25 20:15:43,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:15:52,546 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (forall ((v_ArrVal_841 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_841) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= (+ 4294967294 (* 4294967296 (div .cse0 4294967296))) .cse0))))) is different from false [2021-11-25 20:15:52,556 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_841 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_841) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))))) (= (+ (* 4294967296 (div .cse0 4294967296)) 4294967294) .cse0)))) (= (+ |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 1) 0)) is different from false [2021-11-25 20:15:52,565 WARN L838 $PredicateComparison]: unable to prove that (or (= (+ c_~top~0 1) 0) (forall ((v_ArrVal_841 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_841) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))))) (= .cse0 (+ (* 4294967296 (div .cse0 4294967296)) 4294967294)))))) is different from false [2021-11-25 20:15:52,578 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:15:52,578 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 1 case distinctions, treesize of input 56 treesize of output 45 [2021-11-25 20:15:52,588 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:15:52,588 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 71 treesize of output 66 [2021-11-25 20:15:52,592 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 42 treesize of output 30 [2021-11-25 20:15:52,992 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-25 20:15:52,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353738966] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:15:52,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1552965155] [2021-11-25 20:15:52,992 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-25 20:15:52,992 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:15:52,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 20] total 63 [2021-11-25 20:15:52,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522551793] [2021-11-25 20:15:52,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:15:52,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2021-11-25 20:15:52,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:15:52,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-11-25 20:15:52,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=3430, Unknown=18, NotChecked=366, Total=4160 [2021-11-25 20:15:52,994 INFO L87 Difference]: Start difference. First operand 2061 states and 5061 transitions. Second operand has 65 states, 64 states have (on average 1.65625) internal successors, (106), 64 states have internal predecessors, (106), 0 states have call successors, (0), 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-25 20:16:17,624 WARN L227 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 20:16:40,690 WARN L227 SmtUtils]: Spent 13.68s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 20:16:45,954 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (+ c_~top~0 1) 0)) (.cse1 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|))) (.cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse3 (select (select |c_#memory_int| |c_~#arr~0.base|) |c_~#arr~0.offset|))) (and (not (= 5 |c_ULTIMATE.start_main_~#id2~0#1.base|)) (or .cse0 (and (not (= (mod (+ |c_t1Thread1of1ForFork0_push_#in~x#1| 2) 4294967296) 0)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) .cse1 .cse2)) (= |c_~#arr~0.offset| 0) (<= 0 .cse3) (< (div .cse3 (- 4294967296)) (+ (div (+ (* .cse3 (- 1)) 4) 4294967296) 1)) (= c_~top~0 1) (= 5 |c_~#arr~0.base|) (or .cse0 (and (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) .cse1 (not (= (mod (+ 2 |c_t1Thread1of1ForFork0_push_~x#1|) 4294967296) 0)))) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_161| Int) (v_ArrVal_842 Int)) (or (not (let ((.cse4 (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_161| 4)) v_ArrVal_842)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= .cse4 (+ (* 4294967296 (div .cse4 4294967296)) 4294967294)))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_161| c_~top~0))) (= c_~top~0 0)) .cse2 (< .cse3 4294967296))) is different from false [2021-11-25 20:16:54,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:16:54,357 INFO L93 Difference]: Finished difference Result 4642 states and 10681 transitions. [2021-11-25 20:16:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2021-11-25 20:16:54,358 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 1.65625) internal successors, (106), 64 states have internal predecessors, (106), 0 states have call successors, (0), 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-25 20:16:54,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:16:54,370 INFO L225 Difference]: With dead ends: 4642 [2021-11-25 20:16:54,370 INFO L226 Difference]: Without dead ends: 4367 [2021-11-25 20:16:54,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 43 SyntacticMatches, 20 SemanticMatches, 161 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 8926 ImplicationChecksByTransitivity, 92.2s TimeCoverageRelationStatistics Valid=2188, Invalid=22920, Unknown=30, NotChecked=1268, Total=26406 [2021-11-25 20:16:54,373 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 808 mSDsluCounter, 3460 mSDsCounter, 0 mSdLazyCounter, 6727 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 9649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 6727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2763 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:16:54,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [808 Valid, 0 Invalid, 9649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 6727 Invalid, 0 Unknown, 2763 Unchecked, 6.4s Time] [2021-11-25 20:16:54,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4367 states. [2021-11-25 20:16:54,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4367 to 2555. [2021-11-25 20:16:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2555 states, 2553 states have (on average 2.4680767724245984) internal successors, (6301), 2554 states have internal predecessors, (6301), 0 states have call successors, (0), 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-25 20:16:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 6301 transitions. [2021-11-25 20:16:54,461 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 6301 transitions. Word has length 36 [2021-11-25 20:16:54,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:16:54,461 INFO L470 AbstractCegarLoop]: Abstraction has 2555 states and 6301 transitions. [2021-11-25 20:16:54,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 1.65625) internal successors, (106), 64 states have internal predecessors, (106), 0 states have call successors, (0), 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-25 20:16:54,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 6301 transitions. [2021-11-25 20:16:54,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:16:54,467 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:16:54,468 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-25 20:16:54,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-25 20:16:54,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:16:54,710 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-25 20:16:54,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:16:54,710 INFO L85 PathProgramCache]: Analyzing trace with hash -492584605, now seen corresponding path program 7 times [2021-11-25 20:16:54,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:16:54,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039986903] [2021-11-25 20:16:54,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:16:54,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:16:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:16:55,796 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-25 20:16:55,797 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:16:55,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039986903] [2021-11-25 20:16:55,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039986903] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:16:55,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215416243] [2021-11-25 20:16:55,797 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:16:55,797 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:16:55,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:16:55,798 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:16:55,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-25 20:16:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:16:55,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 96 conjunts are in the unsatisfiable core [2021-11-25 20:16:55,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:16:55,970 INFO L354 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2021-11-25 20:16:55,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2021-11-25 20:16:56,246 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 13 treesize of output 9 [2021-11-25 20:16:56,560 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 21 treesize of output 21 [2021-11-25 20:16:56,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:16:56,789 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 30 treesize of output 25 [2021-11-25 20:16:57,624 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-25 20:16:57,723 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-25 20:16:57,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:16:58,796 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_906 Int) (v_ArrVal_905 (Array Int Int))) (not (let ((.cse0 (let ((.cse2 (* c_~top~0 4))) (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_905))) (store .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse2 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_906))) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse2 (- 4)))))) (= (+ (* 4294967296 (div .cse0 4294967296)) 4294967294) .cse0)))) (<= c_~top~0 0)) is different from false [2021-11-25 20:16:58,825 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_906 Int) (v_ArrVal_905 (Array Int Int))) (not (let ((.cse0 (let ((.cse1 (* c_~top~0 4))) (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_905) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse1) v_ArrVal_906) (+ |c_~#arr~0.offset| .cse1 (- 4)))))) (= .cse0 (+ 4294967294 (* 4294967296 (div .cse0 4294967296))))))) (<= c_~top~0 0)) is different from false [2021-11-25 20:16:58,845 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_906 Int) (v_ArrVal_905 (Array Int Int))) (not (let ((.cse0 (let ((.cse1 (* |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))) (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_905) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse1 4) v_ArrVal_906) (+ |c_~#arr~0.offset| .cse1))))) (= .cse0 (+ (* 4294967296 (div .cse0 4294967296)) 4294967294))))) (<= (+ |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 1) 0)) is different from false [2021-11-25 20:16:58,861 WARN L838 $PredicateComparison]: unable to prove that (or (<= (+ c_~top~0 1) 0) (forall ((v_ArrVal_906 Int) (v_ArrVal_905 (Array Int Int))) (not (let ((.cse0 (let ((.cse1 (* c_~top~0 4))) (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_905) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse1 4) v_ArrVal_906) (+ |c_~#arr~0.offset| .cse1))))) (= (+ 4294967294 (* 4294967296 (div .cse0 4294967296))) .cse0))))) is different from false [2021-11-25 20:16:58,871 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:16:58,872 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 1 case distinctions, treesize of input 72 treesize of output 61 [2021-11-25 20:16:58,884 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:16:58,884 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 103 treesize of output 105 [2021-11-25 20:16:58,889 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 108 treesize of output 96 [2021-11-25 20:16:58,919 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-25 20:16:58,936 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:16:58,937 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 84 treesize of output 82 [2021-11-25 20:16:59,392 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-25 20:16:59,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215416243] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:16:59,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [909273491] [2021-11-25 20:16:59,393 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-25 20:16:59,394 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:16:59,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 21] total 61 [2021-11-25 20:16:59,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081782623] [2021-11-25 20:16:59,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:16:59,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2021-11-25 20:16:59,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:16:59,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-11-25 20:16:59,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=3095, Unknown=4, NotChecked=468, Total=3906 [2021-11-25 20:16:59,396 INFO L87 Difference]: Start difference. First operand 2555 states and 6301 transitions. Second operand has 63 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 62 states have internal predecessors, (102), 0 states have call successors, (0), 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-25 20:17:09,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:17:09,472 INFO L93 Difference]: Finished difference Result 4254 states and 10159 transitions. [2021-11-25 20:17:09,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-11-25 20:17:09,472 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 62 states have internal predecessors, (102), 0 states have call successors, (0), 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-25 20:17:09,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:17:09,485 INFO L225 Difference]: With dead ends: 4254 [2021-11-25 20:17:09,485 INFO L226 Difference]: Without dead ends: 4254 [2021-11-25 20:17:09,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 37 SyntacticMatches, 11 SemanticMatches, 133 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 5690 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1641, Invalid=15387, Unknown=18, NotChecked=1044, Total=18090 [2021-11-25 20:17:09,487 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 489 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 2960 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 5004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1952 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-11-25 20:17:09,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 1 Invalid, 5004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2960 Invalid, 0 Unknown, 1952 Unchecked, 2.6s Time] [2021-11-25 20:17:09,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4254 states. [2021-11-25 20:17:09,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4254 to 2931. [2021-11-25 20:17:09,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2931 states, 2929 states have (on average 2.500512120177535) internal successors, (7324), 2930 states have internal predecessors, (7324), 0 states have call successors, (0), 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-25 20:17:09,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2931 states to 2931 states and 7324 transitions. [2021-11-25 20:17:09,573 INFO L78 Accepts]: Start accepts. Automaton has 2931 states and 7324 transitions. Word has length 36 [2021-11-25 20:17:09,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:17:09,573 INFO L470 AbstractCegarLoop]: Abstraction has 2931 states and 7324 transitions. [2021-11-25 20:17:09,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 62 states have internal predecessors, (102), 0 states have call successors, (0), 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-25 20:17:09,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2931 states and 7324 transitions. [2021-11-25 20:17:09,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:17:09,581 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:17:09,581 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-25 20:17:09,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-25 20:17:09,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:17:09,797 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-25 20:17:09,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:17:09,798 INFO L85 PathProgramCache]: Analyzing trace with hash -756021259, now seen corresponding path program 8 times [2021-11-25 20:17:09,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:17:09,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149199741] [2021-11-25 20:17:09,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:17:09,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:17:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:17:10,856 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-25 20:17:10,856 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:17:10,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149199741] [2021-11-25 20:17:10,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149199741] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:17:10,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202780681] [2021-11-25 20:17:10,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:17:10,857 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:17:10,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:17:10,865 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:17:10,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-25 20:17:11,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:17:11,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:17:11,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 87 conjunts are in the unsatisfiable core [2021-11-25 20:17:11,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:17:11,054 INFO L354 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2021-11-25 20:17:11,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2021-11-25 20:17:11,342 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 13 treesize of output 9 [2021-11-25 20:17:11,630 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 21 treesize of output 21 [2021-11-25 20:17:11,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:17:11,856 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 30 treesize of output 25 [2021-11-25 20:17:12,642 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-25 20:17:12,761 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-25 20:17:12,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:17:15,192 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_971 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_175| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_175| c_~top~0) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_175| 4)) v_ArrVal_971)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= (+ (* 4294967296 (div .cse0 4294967296)) 4294967294) .cse0))))) is different from false [2021-11-25 20:17:24,907 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_971 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_102| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_175| Int) (v_ArrVal_969 (Array Int Int))) (or (not (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_969))) (store .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_102| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_175| 4)) v_ArrVal_971))) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= (+ (* 4294967296 (div .cse0 4294967296)) 4294967294) .cse0))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_102| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_175| c_~top~0))) is different from false [2021-11-25 20:17:24,960 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_971 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_102| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_175| Int) (v_ArrVal_969 (Array Int Int))) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_175| c_~top~0) (not (let ((.cse0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_969) |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_102| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_175| 4)) v_ArrVal_971) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= .cse0 (+ 4294967294 (* 4294967296 (div .cse0 4294967296)))))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_102| |c_~#arr~0.offset|))) is different from false [2021-11-25 20:17:25,052 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_971 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_102| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_175| Int) (v_ArrVal_969 (Array Int Int))) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_102| |c_~#arr~0.offset|) (not (let ((.cse0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_969) |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_102| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_175| 4)) v_ArrVal_971) (+ |c_~#arr~0.offset| (* |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))))) (= .cse0 (+ 4294967294 (* 4294967296 (div .cse0 4294967296)))))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_175| (+ |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)))) is different from false [2021-11-25 20:17:25,108 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_971 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_102| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_175| Int) (v_ArrVal_969 (Array Int Int))) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_175| (+ c_~top~0 1)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_102| |c_~#arr~0.offset|) (not (let ((.cse0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_969) |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_102| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_175| 4)) v_ArrVal_971) (+ |c_~#arr~0.offset| (* c_~top~0 4))))) (= (+ (* 4294967296 (div .cse0 4294967296)) 4294967294) .cse0))))) is different from false [2021-11-25 20:17:25,125 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:17:25,125 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 1 case distinctions, treesize of input 70 treesize of output 59 [2021-11-25 20:17:25,145 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:17:25,145 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 99 treesize of output 101 [2021-11-25 20:17:25,149 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:17:25,151 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 68 treesize of output 56 [2021-11-25 20:17:25,220 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-25 20:17:25,235 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:17:25,243 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:17:25,243 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 42 treesize of output 40 [2021-11-25 20:17:25,620 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-11-25 20:17:25,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202780681] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:17:25,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2028295069] [2021-11-25 20:17:25,620 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-25 20:17:25,621 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:17:25,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 60 [2021-11-25 20:17:25,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011269022] [2021-11-25 20:17:25,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:17:25,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2021-11-25 20:17:25,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:17:25,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-11-25 20:17:25,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=2968, Unknown=7, NotChecked=570, Total=3782 [2021-11-25 20:17:25,623 INFO L87 Difference]: Start difference. First operand 2931 states and 7324 transitions. Second operand has 62 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 0 states have call successors, (0), 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-25 20:17:27,604 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (* c_~top~0 4)))) (and (= c_~top~0 0) (= c_~top~0 |c_t1Thread1of1ForFork0_push_#t~ret35#1|) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (= 5 |c_~#arr~0.base|) (<= 0 .cse0) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (<= .cse0 4) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (forall ((v_ArrVal_971 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_102| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_175| Int) (v_ArrVal_969 (Array Int Int))) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_175| (+ c_~top~0 1)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_102| |c_~#arr~0.offset|) (not (let ((.cse1 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_969) |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_102| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_175| 4)) v_ArrVal_971) (+ |c_~#arr~0.offset| (* c_~top~0 4))))) (= (+ (* 4294967296 (div .cse1 4294967296)) 4294967294) .cse1))))))) is different from false [2021-11-25 20:17:28,843 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) 0))) (and (= |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 0) (= |c_~#arr~0.offset| 0) (<= .cse0 4) (= 5 |c_~#arr~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (forall ((v_ArrVal_971 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_102| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_175| Int) (v_ArrVal_969 (Array Int Int))) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_102| |c_~#arr~0.offset|) (not (let ((.cse1 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_969) |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_102| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_175| 4)) v_ArrVal_971) (+ |c_~#arr~0.offset| (* |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))))) (= .cse1 (+ 4294967294 (* 4294967296 (div .cse1 4294967296)))))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_175| (+ |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)))) (<= 0 .cse0))) is different from false [2021-11-25 20:17:29,963 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) 0))) (and (forall ((v_ArrVal_971 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_102| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_175| Int) (v_ArrVal_969 (Array Int Int))) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_175| c_~top~0) (not (let ((.cse0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_969) |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_102| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_175| 4)) v_ArrVal_971) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= .cse0 (+ 4294967294 (* 4294967296 (div .cse0 4294967296)))))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_102| |c_~#arr~0.offset|))) (= |c_~#arr~0.offset| 0) (<= .cse1 4) (= c_~top~0 1) (= 5 |c_~#arr~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (<= 0 .cse1))) is different from false [2021-11-25 20:17:31,155 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0)) (.cse3 (select (select |c_#memory_int| |c_~#arr~0.base|) 0))) (and (<= 0 .cse0) (forall ((v_ArrVal_971 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_102| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_175| Int) (v_ArrVal_969 (Array Int Int))) (or (not (let ((.cse1 (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_969))) (store .cse2 |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select .cse2 |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_102| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_175| 4)) v_ArrVal_971))) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= (+ (* 4294967296 (div .cse1 4294967296)) 4294967294) .cse1))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_102| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_175| c_~top~0))) (= |c_~#arr~0.offset| 0) (not (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_ULTIMATE.start_main_~#id2~0#1.base|)) (<= .cse0 4) (<= .cse3 4) (= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= c_~top~0 1) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 0 .cse3) (<= 4 (* 4 c_~top~0)))) is different from false [2021-11-25 20:17:32,330 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0)) (.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) 0)) (.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= .cse0 4) (<= .cse1 4) (= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((v_ArrVal_971 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_175| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_175| c_~top~0) (not (let ((.cse2 (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_175| 4)) v_ArrVal_971)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= (+ (* 4294967296 (div .cse2 4294967296)) 4294967294) .cse2))))) (<= 0 .cse3) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 0 .cse1) (<= .cse3 4) (<= 4 (* 4 c_~top~0)))) is different from false [2021-11-25 20:17:35,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:17:35,076 INFO L93 Difference]: Finished difference Result 3727 states and 9042 transitions. [2021-11-25 20:17:35,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 20:17:35,077 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 0 states have call successors, (0), 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-25 20:17:35,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:17:35,088 INFO L225 Difference]: With dead ends: 3727 [2021-11-25 20:17:35,089 INFO L226 Difference]: Without dead ends: 3552 [2021-11-25 20:17:35,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1331 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=396, Invalid=4602, Unknown=12, NotChecked=1470, Total=6480 [2021-11-25 20:17:35,090 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 264 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 3639 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 812 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:17:35,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 0 Invalid, 4481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3639 Invalid, 0 Unknown, 812 Unchecked, 2.8s Time] [2021-11-25 20:17:35,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3552 states. [2021-11-25 20:17:35,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3552 to 3059. [2021-11-25 20:17:35,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3059 states, 3057 states have (on average 2.498855086686294) internal successors, (7639), 3058 states have internal predecessors, (7639), 0 states have call successors, (0), 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-25 20:17:35,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 7639 transitions. [2021-11-25 20:17:35,165 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 7639 transitions. Word has length 36 [2021-11-25 20:17:35,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:17:35,165 INFO L470 AbstractCegarLoop]: Abstraction has 3059 states and 7639 transitions. [2021-11-25 20:17:35,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 0 states have call successors, (0), 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-25 20:17:35,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 7639 transitions. [2021-11-25 20:17:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:17:35,173 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:17:35,173 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-25 20:17:35,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-25 20:17:35,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-25 20:17:35,398 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-25 20:17:35,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:17:35,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2050345407, now seen corresponding path program 9 times [2021-11-25 20:17:35,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:17:35,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499304374] [2021-11-25 20:17:35,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:17:35,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:17:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:17:36,865 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-25 20:17:36,865 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:17:36,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499304374] [2021-11-25 20:17:36,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499304374] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:17:36,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446249527] [2021-11-25 20:17:36,866 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:17:36,866 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:17:36,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:17:36,867 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:17:36,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-25 20:17:37,021 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:17:37,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:17:37,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 92 conjunts are in the unsatisfiable core [2021-11-25 20:17:37,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:17:37,041 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:17:37,041 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 15 treesize of output 15 [2021-11-25 20:17:37,442 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 19 treesize of output 15 [2021-11-25 20:17:38,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:17:38,092 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-25 20:17:38,332 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 42 treesize of output 38 [2021-11-25 20:17:39,568 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 77 treesize of output 45 [2021-11-25 20:18:20,312 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-25 20:18:20,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:18:20,939 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1036 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1036) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))))) (= (+ (* 4294967296 (div .cse0 4294967296)) 4294967294) .cse0)))) is different from false [2021-11-25 20:18:20,947 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1036 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1036) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))))) (= .cse0 (+ (* 4294967296 (div .cse0 4294967296)) 4294967294))))) is different from false [2021-11-25 20:18:20,955 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1036 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1036) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= (+ 4294967294 (* 4294967296 (div .cse0 4294967296))) .cse0)))) is different from false [2021-11-25 20:18:20,966 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1035 Int) (v_ArrVal_1036 (Array Int Int))) (not (let ((.cse0 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1035)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1036) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= (+ (* 4294967296 (div .cse0 4294967296)) 4294967294) .cse0)))) is different from false [2021-11-25 20:18:20,979 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1035 Int) (v_ArrVal_1036 (Array Int Int))) (not (let ((.cse0 (let ((.cse1 (* c_~top~0 4))) (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ .cse1 |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1035)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1036) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse1 (- 4)))))) (= (+ (* 4294967296 (div .cse0 4294967296)) 4294967294) .cse0)))) is different from false [2021-11-25 20:18:20,990 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1035 Int) (v_ArrVal_1036 (Array Int Int))) (not (let ((.cse0 (let ((.cse1 (* c_~top~0 4))) (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1035)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1036) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse1 (- 4)))))) (= .cse0 (+ 4294967294 (* 4294967296 (div .cse0 4294967296))))))) is different from false [2021-11-25 20:18:21,005 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1035 Int) (v_ArrVal_1036 (Array Int Int))) (not (let ((.cse0 (let ((.cse1 (* c_~top~0 4))) (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse1) v_ArrVal_1035)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1036) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse1 (- 4)))))) (= (+ (* 4294967296 (div .cse0 4294967296)) 4294967294) .cse0)))) is different from false [2021-11-25 20:18:21,029 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1035 Int) (v_ArrVal_1036 (Array Int Int))) (not (let ((.cse0 (let ((.cse1 (* |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))) (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse1 4) v_ArrVal_1035)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1036) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse1))))) (= .cse0 (+ (* 4294967296 (div .cse0 4294967296)) 4294967294))))) is different from false [2021-11-25 20:18:21,045 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1035 Int) (v_ArrVal_1036 (Array Int Int))) (not (let ((.cse0 (let ((.cse1 (* c_~top~0 4))) (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse1 4) v_ArrVal_1035)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1036) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse1))))) (= .cse0 (+ 4294967294 (* 4294967296 (div .cse0 4294967296))))))) is different from false [2021-11-25 20:18:21,095 INFO L354 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2021-11-25 20:18:21,095 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 106 treesize of output 77 [2021-11-25 20:18:21,111 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:18:21,112 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 90 treesize of output 85 [2021-11-25 20:18:21,118 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 42 treesize of output 30 [2021-11-25 20:18:21,657 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2021-11-25 20:18:21,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446249527] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:18:21,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1941518829] [2021-11-25 20:18:21,658 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-25 20:18:21,658 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:18:21,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 22] total 68 [2021-11-25 20:18:21,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754700259] [2021-11-25 20:18:21,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:18:21,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2021-11-25 20:18:21,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:18:21,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2021-11-25 20:18:21,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=3363, Unknown=29, NotChecked=1134, Total=4830 [2021-11-25 20:18:21,660 INFO L87 Difference]: Start difference. First operand 3059 states and 7639 transitions. Second operand has 70 states, 69 states have (on average 1.536231884057971) internal successors, (106), 69 states have internal predecessors, (106), 0 states have call successors, (0), 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-25 20:18:28,795 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1035 Int) (v_ArrVal_1036 (Array Int Int))) (not (let ((.cse0 (let ((.cse1 (* c_~top~0 4))) (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse1 4) v_ArrVal_1035)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1036) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse1))))) (= .cse0 (+ 4294967294 (* 4294967296 (div .cse0 4294967296))))))) (forall ((v_ArrVal_1036 (Array Int Int))) (not (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1036) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (= (+ 4294967294 (* 4294967296 (div .cse2 4294967296))) .cse2))))) is different from false [2021-11-25 20:18:29,069 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1035 Int) (v_ArrVal_1036 (Array Int Int))) (not (let ((.cse0 (let ((.cse1 (* |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))) (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse1 4) v_ArrVal_1035)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1036) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse1))))) (= .cse0 (+ (* 4294967296 (div .cse0 4294967296)) 4294967294))))) (forall ((v_ArrVal_1036 (Array Int Int))) (not (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1036) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))))) (= .cse2 (+ (* 4294967296 (div .cse2 4294967296)) 4294967294)))))) is different from false [2021-11-25 20:18:29,505 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1035 Int) (v_ArrVal_1036 (Array Int Int))) (not (let ((.cse0 (let ((.cse1 (* c_~top~0 4))) (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse1) v_ArrVal_1035)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1036) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse1 (- 4)))))) (= (+ (* 4294967296 (div .cse0 4294967296)) 4294967294) .cse0)))) (forall ((v_ArrVal_1036 (Array Int Int))) (not (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1036) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))))) (= (+ (* 4294967296 (div .cse2 4294967296)) 4294967294) .cse2))))) is different from false [2021-11-25 20:18:36,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:18:36,288 INFO L93 Difference]: Finished difference Result 4030 states and 9867 transitions. [2021-11-25 20:18:36,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-11-25 20:18:36,288 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 1.536231884057971) internal successors, (106), 69 states have internal predecessors, (106), 0 states have call successors, (0), 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-25 20:18:36,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:18:36,296 INFO L225 Difference]: With dead ends: 4030 [2021-11-25 20:18:36,297 INFO L226 Difference]: Without dead ends: 4030 [2021-11-25 20:18:36,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 126 ConstructedPredicates, 12 IntricatePredicates, 5 DeprecatedPredicates, 4351 ImplicationChecksByTransitivity, 56.1s TimeCoverageRelationStatistics Valid=1073, Invalid=12279, Unknown=36, NotChecked=2868, Total=16256 [2021-11-25 20:18:36,299 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 355 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 2306 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 5727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3348 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:18:36,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [355 Valid, 2 Invalid, 5727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2306 Invalid, 0 Unknown, 3348 Unchecked, 2.3s Time] [2021-11-25 20:18:36,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4030 states. [2021-11-25 20:18:36,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4030 to 3103. [2021-11-25 20:18:36,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3103 states, 3101 states have (on average 2.5049983876168977) internal successors, (7768), 3102 states have internal predecessors, (7768), 0 states have call successors, (0), 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-25 20:18:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3103 states to 3103 states and 7768 transitions. [2021-11-25 20:18:36,400 INFO L78 Accepts]: Start accepts. Automaton has 3103 states and 7768 transitions. Word has length 36 [2021-11-25 20:18:36,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:18:36,400 INFO L470 AbstractCegarLoop]: Abstraction has 3103 states and 7768 transitions. [2021-11-25 20:18:36,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 1.536231884057971) internal successors, (106), 69 states have internal predecessors, (106), 0 states have call successors, (0), 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-25 20:18:36,401 INFO L276 IsEmpty]: Start isEmpty. Operand 3103 states and 7768 transitions. [2021-11-25 20:18:36,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:18:36,407 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:18:36,407 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-25 20:18:36,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-25 20:18:36,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-25 20:18:36,633 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-25 20:18:36,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:18:36,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1644465377, now seen corresponding path program 10 times [2021-11-25 20:18:36,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:18:36,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432259264] [2021-11-25 20:18:36,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:18:36,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:18:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:18:37,524 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-25 20:18:37,525 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:18:37,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432259264] [2021-11-25 20:18:37,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432259264] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:18:37,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709002462] [2021-11-25 20:18:37,525 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:18:37,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:18:37,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:18:37,526 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:18:37,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-25 20:18:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:18:37,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 96 conjunts are in the unsatisfiable core [2021-11-25 20:18:37,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:18:37,701 INFO L354 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2021-11-25 20:18:37,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2021-11-25 20:18:37,936 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 13 treesize of output 9 [2021-11-25 20:18:38,011 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 25 treesize of output 25 [2021-11-25 20:18:38,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:18:38,416 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 30 treesize of output 25 [2021-11-25 20:18:39,080 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-25 20:18:39,183 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-25 20:18:39,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:18:40,333 WARN L838 $PredicateComparison]: unable to prove that (or (<= (+ c_~top~0 1) 0) (forall ((v_ArrVal_1098 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1098) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))))) (= .cse0 (+ (* 4294967296 (div .cse0 4294967296)) 4294967294)))))) is different from false [2021-11-25 20:18:40,343 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:18:40,344 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 1 case distinctions, treesize of input 56 treesize of output 45 [2021-11-25 20:18:40,357 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:18:40,357 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 71 treesize of output 66 [2021-11-25 20:18:40,361 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 42 treesize of output 30 [2021-11-25 20:18:40,741 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-25 20:18:40,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709002462] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:18:40,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1557471912] [2021-11-25 20:18:40,741 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-25 20:18:40,741 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:18:40,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 20] total 59 [2021-11-25 20:18:40,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210743897] [2021-11-25 20:18:40,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:18:40,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2021-11-25 20:18:40,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:18:40,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-11-25 20:18:40,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=3206, Unknown=1, NotChecked=116, Total=3660 [2021-11-25 20:18:40,744 INFO L87 Difference]: Start difference. First operand 3103 states and 7768 transitions. Second operand has 61 states, 60 states have (on average 1.7) internal successors, (102), 60 states have internal predecessors, (102), 0 states have call successors, (0), 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-25 20:18:52,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:18:52,272 INFO L93 Difference]: Finished difference Result 4956 states and 11737 transitions. [2021-11-25 20:18:52,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-11-25 20:18:52,273 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 1.7) internal successors, (102), 60 states have internal predecessors, (102), 0 states have call successors, (0), 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-25 20:18:52,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:18:52,278 INFO L225 Difference]: With dead ends: 4956 [2021-11-25 20:18:52,278 INFO L226 Difference]: Without dead ends: 4437 [2021-11-25 20:18:52,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 127 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5149 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=1898, Invalid=14360, Unknown=2, NotChecked=252, Total=16512 [2021-11-25 20:18:52,279 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 761 mSDsluCounter, 2317 mSDsCounter, 0 mSdLazyCounter, 4829 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 4829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1331 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:18:52,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [761 Valid, 0 Invalid, 6303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 4829 Invalid, 0 Unknown, 1331 Unchecked, 4.1s Time] [2021-11-25 20:18:52,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4437 states. [2021-11-25 20:18:52,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4437 to 1763. [2021-11-25 20:18:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1763 states, 1761 states have (on average 2.4775695627484384) internal successors, (4363), 1762 states have internal predecessors, (4363), 0 states have call successors, (0), 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-25 20:18:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 4363 transitions. [2021-11-25 20:18:52,334 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 4363 transitions. Word has length 36 [2021-11-25 20:18:52,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:18:52,334 INFO L470 AbstractCegarLoop]: Abstraction has 1763 states and 4363 transitions. [2021-11-25 20:18:52,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 1.7) internal successors, (102), 60 states have internal predecessors, (102), 0 states have call successors, (0), 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-25 20:18:52,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 4363 transitions. [2021-11-25 20:18:52,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-25 20:18:52,338 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:18:52,338 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, 1] [2021-11-25 20:18:52,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-11-25 20:18:52,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:18:52,565 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-25 20:18:52,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:18:52,566 INFO L85 PathProgramCache]: Analyzing trace with hash 208866287, now seen corresponding path program 1 times [2021-11-25 20:18:52,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:18:52,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710166870] [2021-11-25 20:18:52,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:18:52,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:18:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:18:53,856 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-25 20:18:53,857 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:18:53,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710166870] [2021-11-25 20:18:53,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710166870] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:18:53,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835646406] [2021-11-25 20:18:53,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:18:53,857 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:18:53,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:18:53,858 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:18:53,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_585f35a2-8b54-4e5f-aae7-f1fbaf91bff0/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-25 20:18:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:18:53,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 81 conjunts are in the unsatisfiable core [2021-11-25 20:18:53,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:18:54,011 INFO L354 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2021-11-25 20:18:54,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2021-11-25 20:18:54,379 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 19 treesize of output 15 [2021-11-25 20:18:54,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:18:54,950 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-25 20:18:55,148 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 42 treesize of output 38 [2021-11-25 20:18:56,016 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 77 treesize of output 45 [2021-11-25 20:18:56,287 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-25 20:18:56,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:18:57,001 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 1) (forall ((v_ArrVal_1164 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1164) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))) is different from false [2021-11-25 20:18:57,011 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 0) (forall ((v_ArrVal_1164 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1164) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))) 4294967296))))) is different from false [2021-11-25 20:18:57,020 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (forall ((v_ArrVal_1164 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1164) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) is different from false [2021-11-25 20:18:57,031 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (forall ((v_ArrVal_1163 Int) (v_ArrVal_1164 (Array Int Int))) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1163)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1164) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) is different from false [2021-11-25 20:18:57,055 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (forall ((v_ArrVal_1163 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_196| Int) (v_ArrVal_1164 (Array Int Int))) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_196| c_~top~0) (not (= (mod (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_196| 4)) v_ArrVal_1163)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1164) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))))) is different from false [2021-11-25 20:18:57,101 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1163 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_111| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_196| Int) (v_ArrVal_1164 (Array Int Int))) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_196| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_111| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_111| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_196| 4)) v_ArrVal_1163)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1164) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (= c_~top~0 0)) is different from false [2021-11-25 20:18:57,148 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (forall ((v_ArrVal_1163 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_111| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_196| Int) (v_ArrVal_1164 (Array Int Int))) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_111| |c_~#arr~0.offset|) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_111| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_196| 4)) v_ArrVal_1163)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1164) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_196| c_~top~0)))) is different from false [2021-11-25 20:18:57,270 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1163 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_111| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_196| Int) (v_ArrVal_1164 (Array Int Int))) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_111| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_196| (+ |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_111| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_196| 4)) v_ArrVal_1163)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1164) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))) 4294967296))))) (= (+ |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 1) 0)) is different from false [2021-11-25 20:18:57,316 WARN L838 $PredicateComparison]: unable to prove that (or (= (+ c_~top~0 1) 0) (forall ((v_ArrVal_1163 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_111| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_196| Int) (v_ArrVal_1164 (Array Int Int))) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_196| (+ c_~top~0 1)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_111| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_196| 4)) v_ArrVal_1163)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1164) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_111| |c_~#arr~0.offset|)))) is different from false [2021-11-25 20:18:57,363 INFO L354 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2021-11-25 20:18:57,364 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 53 treesize of output 60 [2021-11-25 20:18:57,391 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:18:57,391 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 67 treesize of output 70 [2021-11-25 20:18:57,397 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 28 treesize of output 22 [2021-11-25 20:18:57,883 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2021-11-25 20:18:57,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835646406] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:18:57,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1679093824] [2021-11-25 20:18:57,884 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java: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-25 20:18:57,885 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:18:57,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21, 22] total 68 [2021-11-25 20:18:57,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827166524] [2021-11-25 20:18:57,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:18:57,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2021-11-25 20:18:57,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:18:57,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2021-11-25 20:18:57,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=3387, Unknown=9, NotChecked=1134, Total=4830 [2021-11-25 20:18:57,887 INFO L87 Difference]: Start difference. First operand 1763 states and 4363 transitions. Second operand has 70 states, 69 states have (on average 1.5942028985507246) internal successors, (110), 69 states have internal predecessors, (110), 0 states have call successors, (0), 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-25 20:18:59,746 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) 0))) (and (= c_~top~0 0) (not (= 5 |c_ULTIMATE.start_main_~#id2~0#1.base|)) (= c_~top~0 |c_t1Thread1of1ForFork0_push_#t~ret35#1|) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= (+ (* 4 |c_t1Thread1of1ForFork0_push_#t~ret35#1|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) 0) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (<= .cse0 4) (or (= (+ c_~top~0 1) 0) (forall ((v_ArrVal_1163 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_111| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_196| Int) (v_ArrVal_1164 (Array Int Int))) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_196| (+ c_~top~0 1)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_111| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_196| 4)) v_ArrVal_1163)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1164) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_111| |c_~#arr~0.offset|)))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 5 |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 0 .cse0))) is different from false [2021-11-25 20:19:00,845 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) 0))) (and (not (= 5 |c_ULTIMATE.start_main_~#id2~0#1.base|)) (= |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 0) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#arr~0.offset| 0) (<= .cse0 4) (= 5 |c_~#arr~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= 0 .cse0) (or (forall ((v_ArrVal_1163 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_111| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_196| Int) (v_ArrVal_1164 (Array Int Int))) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_111| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_196| (+ |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_111| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_196| 4)) v_ArrVal_1163)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1164) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))) 4294967296))))) (= (+ |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 1) 0)))) is different from false [2021-11-25 20:19:02,064 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) 0))) (and (or (= c_~top~0 0) (forall ((v_ArrVal_1163 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_111| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_196| Int) (v_ArrVal_1164 (Array Int Int))) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_111| |c_~#arr~0.offset|) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_111| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_196| 4)) v_ArrVal_1163)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1164) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_196| c_~top~0)))) (not (= 5 |c_ULTIMATE.start_main_~#id2~0#1.base|)) (<= 1 c_~top~0) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#arr~0.offset| 0) (<= .cse0 4) (= 5 |c_~#arr~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= c_~top~0 1) (<= 0 .cse0))) is different from false [2021-11-25 20:19:03,290 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (<= 0 .cse0) (not (= 5 |c_ULTIMATE.start_main_~#id2~0#1.base|)) (<= 1 c_~top~0) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#arr~0.offset| 0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| 5) (<= .cse0 4) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (or (forall ((v_ArrVal_1163 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_111| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_196| Int) (v_ArrVal_1164 (Array Int Int))) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_196| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_111| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_111| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_196| 4)) v_ArrVal_1163)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1164) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (= c_~top~0 0)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|))) is different from false [2021-11-25 20:19:04,329 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) |c_~#arr~0.offset|)) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (not (= 5 |c_ULTIMATE.start_main_~#id2~0#1.base|)) (<= 1 c_~top~0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#arr~0.offset| 0) (<= 0 .cse0) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (= c_~top~0 1) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (<= 0 .cse1) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= c_~top~0 1) (or (= c_~top~0 0) (forall ((v_ArrVal_1163 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_196| Int) (v_ArrVal_1164 (Array Int Int))) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_196| c_~top~0) (not (= (mod (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_196| 4)) v_ArrVal_1163)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1164) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))))) (< .cse0 4294967296) (not (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_ULTIMATE.start_main_~#id2~0#1.base|)) (<= .cse1 4))) is different from false [2021-11-25 20:19:08,467 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse5 (select .cse6 0)) (.cse0 (select .cse6 |c_~#arr~0.offset|)) (.cse1 (= (+ c_~top~0 1) 0)) (.cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse3 (not (= (mod (+ 4294967294 (* |c_t1Thread1of1ForFork0_push_~x#1| 4294967295)) (- 4294967296)) 0))) (.cse4 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)))) (and (not (= 5 |c_ULTIMATE.start_main_~#id2~0#1.base|)) (= |c_~#arr~0.offset| 0) (<= 0 .cse0) (= c_~top~0 2) (or .cse1 (and .cse2 .cse3 (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) .cse4)) (or .cse1 (and (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (= (mod (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967295) 4294967294) (- 4294967296)) 0)) .cse4 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|))) (<= .cse5 4) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (or .cse1 (forall ((v_ArrVal_1163 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_111| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_196| Int) (v_ArrVal_1164 (Array Int Int))) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_196| (+ c_~top~0 1)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_111| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_196| 4)) v_ArrVal_1163)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1164) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_111| |c_~#arr~0.offset|)))) (= 5 |c_~#arr~0.base|) (<= c_~top~0 2) .cse4 (<= 0 .cse5) (< .cse0 4294967296) (or .cse1 (and .cse2 .cse3 (= (+ |c_~#arr~0.offset| (* 4 c_~top~0)) (+ (* 4 |c_t1Thread1of1ForFork0_push_#t~ret35#1|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|)) .cse4))))) is different from false