./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/test-semi1.wvr.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/test-semi1.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1fb758430fdab5e598998cc874ea93afa2de5f622c2b42d836b77952562e01f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:58:18,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:58:18,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:58:18,684 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:58:18,684 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:58:18,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:58:18,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:58:18,688 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:58:18,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:58:18,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:58:18,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:58:18,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:58:18,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:58:18,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:58:18,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:58:18,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:58:18,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:58:18,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:58:18,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:58:18,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:58:18,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:58:18,702 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:58:18,703 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:58:18,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:58:18,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:58:18,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:58:18,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:58:18,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:58:18,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:58:18,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:58:18,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:58:18,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:58:18,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:58:18,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:58:18,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:58:18,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:58:18,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:58:18,714 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:58:18,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:58:18,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:58:18,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:58:18,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 20:58:18,733 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:58:18,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:58:18,734 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:58:18,734 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:58:18,734 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:58:18,735 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:58:18,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:58:18,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:58:18,735 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:58:18,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:58:18,736 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:58:18,736 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:58:18,736 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:58:18,736 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:58:18,737 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:58:18,737 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:58:18,737 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:58:18,737 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:58:18,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:58:18,738 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:58:18,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:58:18,738 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:58:18,738 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:58:18,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:58:18,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:58:18,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:58:18,739 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:58:18,739 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:58:18,739 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:58:18,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:58:18,740 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:58:18,740 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:58:18,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:58:18,740 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> e1fb758430fdab5e598998cc874ea93afa2de5f622c2b42d836b77952562e01f [2022-02-20 20:58:18,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:58:18,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:58:18,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:58:18,946 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:58:18,947 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:58:18,948 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-semi1.wvr.c [2022-02-20 20:58:19,023 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc4d141a5/dacfdc3a03ef4a8fa2bac2ada97fd760/FLAG8f4d992e1 [2022-02-20 20:58:19,381 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:58:19,382 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-semi1.wvr.c [2022-02-20 20:58:19,387 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc4d141a5/dacfdc3a03ef4a8fa2bac2ada97fd760/FLAG8f4d992e1 [2022-02-20 20:58:19,399 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc4d141a5/dacfdc3a03ef4a8fa2bac2ada97fd760 [2022-02-20 20:58:19,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:58:19,402 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:58:19,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:58:19,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:58:19,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:58:19,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:58:19" (1/1) ... [2022-02-20 20:58:19,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75fce05f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:19, skipping insertion in model container [2022-02-20 20:58:19,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:58:19" (1/1) ... [2022-02-20 20:58:19,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:58:19,425 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:58:19,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-semi1.wvr.c[1979,1992] [2022-02-20 20:58:19,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:58:19,587 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:58:19,603 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-semi1.wvr.c[1979,1992] [2022-02-20 20:58:19,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:58:19,615 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:58:19,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:19 WrapperNode [2022-02-20 20:58:19,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:58:19,616 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:58:19,617 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:58:19,617 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:58:19,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:19" (1/1) ... [2022-02-20 20:58:19,628 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:19" (1/1) ... [2022-02-20 20:58:19,646 INFO L137 Inliner]: procedures = 21, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 71 [2022-02-20 20:58:19,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:58:19,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:58:19,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:58:19,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:58:19,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:19" (1/1) ... [2022-02-20 20:58:19,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:19" (1/1) ... [2022-02-20 20:58:19,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:19" (1/1) ... [2022-02-20 20:58:19,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:19" (1/1) ... [2022-02-20 20:58:19,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:19" (1/1) ... [2022-02-20 20:58:19,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:19" (1/1) ... [2022-02-20 20:58:19,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:19" (1/1) ... [2022-02-20 20:58:19,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:58:19,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:58:19,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:58:19,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:58:19,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:19" (1/1) ... [2022-02-20 20:58:19,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:58:19,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:58:19,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 20:58:19,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 20:58:19,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:58:19,750 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-02-20 20:58:19,750 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-02-20 20:58:19,750 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-02-20 20:58:19,751 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-02-20 20:58:19,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:58:19,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:58:19,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:58:19,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-20 20:58:19,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-20 20:58:19,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:58:19,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:58:19,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 20:58:19,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:58:19,754 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-20 20:58:19,829 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:58:19,830 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:58:19,966 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:58:20,027 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:58:20,027 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:58:20,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:58:20 BoogieIcfgContainer [2022-02-20 20:58:20,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:58:20,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:58:20,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:58:20,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:58:20,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:58:19" (1/3) ... [2022-02-20 20:58:20,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5335b074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:58:20, skipping insertion in model container [2022-02-20 20:58:20,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:19" (2/3) ... [2022-02-20 20:58:20,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5335b074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:58:20, skipping insertion in model container [2022-02-20 20:58:20,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:58:20" (3/3) ... [2022-02-20 20:58:20,036 INFO L111 eAbstractionObserver]: Analyzing ICFG test-semi1.wvr.c [2022-02-20 20:58:20,039 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:58:20,040 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:58:20,040 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:58:20,040 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:58:20,107 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,108 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,108 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,109 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,109 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,109 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,110 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,110 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,110 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,112 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,112 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,112 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,124 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,124 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,124 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,124 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,128 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,128 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,128 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:20,171 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-02-20 20:58:20,203 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:58:20,208 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=PETRI_NET, 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 [2022-02-20 20:58:20,209 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 20:58:20,219 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 82 transitions, 180 flow [2022-02-20 20:58:20,255 INFO L129 PetriNetUnfolder]: 3/80 cut-off events. [2022-02-20 20:58:20,255 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-02-20 20:58:20,257 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 80 events. 3/80 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 18 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-02-20 20:58:20,257 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 82 transitions, 180 flow [2022-02-20 20:58:20,261 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 71 transitions, 154 flow [2022-02-20 20:58:20,282 INFO L129 PetriNetUnfolder]: 3/70 cut-off events. [2022-02-20 20:58:20,282 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-02-20 20:58:20,283 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:58:20,283 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:58:20,284 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:58:20,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:58:20,288 INFO L85 PathProgramCache]: Analyzing trace with hash -454694740, now seen corresponding path program 1 times [2022-02-20 20:58:20,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:58:20,297 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735072274] [2022-02-20 20:58:20,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:58:20,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:58:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:58:20,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {89#true} [181] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89#true} is VALID [2022-02-20 20:58:20,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {89#true} [158] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {89#true} is VALID [2022-02-20 20:58:20,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {89#true} [185] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {89#true} is VALID [2022-02-20 20:58:20,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {89#true} [187] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {89#true} is VALID [2022-02-20 20:58:20,841 INFO L290 TraceCheckUtils]: 4: Hoare triple {89#true} [150] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {89#true} is VALID [2022-02-20 20:58:20,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {89#true} [173] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {89#true} is VALID [2022-02-20 20:58:20,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {89#true} [171] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {89#true} is VALID [2022-02-20 20:58:20,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {89#true} [141] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 17)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {89#true} is VALID [2022-02-20 20:58:20,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {89#true} [195] L21-4-->L38: Formula: (= v_~x~0_6 0) InVars {} OutVars{~x~0=v_~x~0_6} AuxVars[] AssignedVars[~x~0] {89#true} is VALID [2022-02-20 20:58:20,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {89#true} [196] L38-->L-1-3: Formula: (= v_~y~0_1 0) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] {89#true} is VALID [2022-02-20 20:58:20,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {89#true} [192] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89#true} is VALID [2022-02-20 20:58:20,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {89#true} [167] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89#true} is VALID [2022-02-20 20:58:20,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {89#true} [137] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {89#true} is VALID [2022-02-20 20:58:20,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {89#true} [166] L-1-6-->L58: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_~#t2~0#1.base] {89#true} is VALID [2022-02-20 20:58:20,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {89#true} [156] L58-->L58-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {89#true} is VALID [2022-02-20 20:58:20,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {89#true} [132] L58-1-->L58-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {89#true} is VALID [2022-02-20 20:58:20,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {89#true} [134] L58-2-->L60: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet3#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet3#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[] {89#true} is VALID [2022-02-20 20:58:20,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {89#true} [190] L60-->L60-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_3| v_~x~0_7) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] {89#true} is VALID [2022-02-20 20:58:20,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {89#true} [157] L60-1-->L61: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {89#true} is VALID [2022-02-20 20:58:20,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {89#true} [124] L61-->L61-1: Formula: (and (<= |v_ULTIMATE.start_main_#t~nondet4#1_2| 2147483647) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet4#1_2| 2147483648))) InVars {ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[] {89#true} is VALID [2022-02-20 20:58:20,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {89#true} [164] L61-1-->L61-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet4#1_3| v_~y~0_2) InVars {ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_3|} OutVars{~y~0=v_~y~0_2, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_3|} AuxVars[] AssignedVars[~y~0] {89#true} is VALID [2022-02-20 20:58:20,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {89#true} [172] L61-2-->L62: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {89#true} is VALID [2022-02-20 20:58:20,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {89#true} [193] L62-->L62-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89#true} is VALID [2022-02-20 20:58:20,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {89#true} [177] L62-1-->L62-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< v_~x~0_8 2147483647) 1 0)) InVars {~x~0=v_~x~0_8} OutVars{~x~0=v_~x~0_8, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {89#true} is VALID [2022-02-20 20:58:20,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {89#true} [149] L62-2-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {89#true} is VALID [2022-02-20 20:58:20,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {89#true} [148] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {89#true} is VALID [2022-02-20 20:58:20,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {89#true} [175] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {89#true} is VALID [2022-02-20 20:58:20,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {89#true} [168] L34-1-->L63: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89#true} is VALID [2022-02-20 20:58:20,848 INFO L290 TraceCheckUtils]: 28: Hoare triple {89#true} [125] L63-->L63-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89#true} is VALID [2022-02-20 20:58:20,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {89#true} [170] L63-1-->L63-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (= v_~x~0_9 v_~y~0_3) 1 0)) InVars {~y~0=v_~y~0_3, ~x~0=v_~x~0_9} OutVars{~y~0=v_~y~0_3, ~x~0=v_~x~0_9, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {91#(or (and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:58:20,862 INFO L290 TraceCheckUtils]: 30: Hoare triple {91#(or (and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [142] L63-2-->L34-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {91#(or (and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:58:20,863 INFO L290 TraceCheckUtils]: 31: Hoare triple {91#(or (and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [159] L34-2-->L35-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {92#(or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0)))} is VALID [2022-02-20 20:58:20,863 INFO L290 TraceCheckUtils]: 32: Hoare triple {92#(or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0)))} [131] L35-3-->L34-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:20,864 INFO L290 TraceCheckUtils]: 33: Hoare triple {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [140] L34-3-->L66: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:20,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [152] L66-->L66-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:20,865 INFO L290 TraceCheckUtils]: 35: Hoare triple {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [188] L66-1-->L66-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:20,866 INFO L290 TraceCheckUtils]: 36: Hoare triple {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [161] L66-2-->L66-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:20,867 INFO L290 TraceCheckUtils]: 37: Hoare triple {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [209] L66-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:20,868 INFO L290 TraceCheckUtils]: 38: Hoare triple {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [202] thread1ENTRY-->L43: Formula: (= v_~x~0_31 (+ v_~x~0_32 1)) InVars {~x~0=v_~x~0_32} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, ~x~0=v_~x~0_31} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~x~0] {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:20,869 INFO L290 TraceCheckUtils]: 39: Hoare triple {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} [203] L43-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:20,869 INFO L290 TraceCheckUtils]: 40: Hoare triple {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} [204] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:20,870 INFO L290 TraceCheckUtils]: 41: Hoare triple {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} [178] L66-4-->L66-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:20,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} [179] L66-5-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:20,872 INFO L290 TraceCheckUtils]: 43: Hoare triple {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} [180] L67-->L67-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:20,872 INFO L290 TraceCheckUtils]: 44: Hoare triple {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} [146] L67-1-->L67-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:20,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} [135] L67-2-->L67-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:20,874 INFO L290 TraceCheckUtils]: 46: Hoare triple {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} [211] L67-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:20,875 INFO L290 TraceCheckUtils]: 47: Hoare triple {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} [176] L67-4-->L67-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:20,875 INFO L290 TraceCheckUtils]: 48: Hoare triple {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} [128] L67-5-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:20,876 INFO L290 TraceCheckUtils]: 49: Hoare triple {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} [184] L68-->L68-1: Formula: (= |v_ULTIMATE.start_main_#t~mem9#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:20,877 INFO L290 TraceCheckUtils]: 50: Hoare triple {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} [212] thread1EXIT-->L68-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem9#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:20,878 INFO L290 TraceCheckUtils]: 51: Hoare triple {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} [129] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:20,879 INFO L290 TraceCheckUtils]: 52: Hoare triple {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} [136] L69-->L69-1: Formula: (= (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) |v_ULTIMATE.start_main_#t~mem10#1_2|) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10#1] {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:20,880 INFO L290 TraceCheckUtils]: 53: Hoare triple {94#(and (<= (+ ~y~0 1) ~x~0) (<= ~x~0 (+ ~y~0 1)))} [205] thread2ENTRY-->L52: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (<= 0 v_~x~0_40) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= v_~x~0_40 (+ v_~x~0_39 1))) InVars {~x~0=v_~x~0_40} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0] {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:20,880 INFO L290 TraceCheckUtils]: 54: Hoare triple {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [206] L52-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:20,881 INFO L290 TraceCheckUtils]: 55: Hoare triple {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [207] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:20,882 INFO L290 TraceCheckUtils]: 56: Hoare triple {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [213] thread2EXIT-->L69-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_5|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_5|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:20,883 INFO L290 TraceCheckUtils]: 57: Hoare triple {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [153] L69-2-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10#1] {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:20,883 INFO L290 TraceCheckUtils]: 58: Hoare triple {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [127] L71-->L71-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:20,884 INFO L290 TraceCheckUtils]: 59: Hoare triple {93#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [143] L71-1-->L71-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (not (= v_~x~0_10 v_~y~0_4)) 1 0)) InVars {~y~0=v_~y~0_4, ~x~0=v_~x~0_10} OutVars{~y~0=v_~y~0_4, ~x~0=v_~x~0_10, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {95#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:20,885 INFO L290 TraceCheckUtils]: 60: Hoare triple {95#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [186] L71-2-->L34-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {95#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:20,885 INFO L290 TraceCheckUtils]: 61: Hoare triple {95#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [123] L34-4-->L35-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {96#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:58:20,886 INFO L290 TraceCheckUtils]: 62: Hoare triple {96#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [200] L35-6-->L34-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] {90#false} is VALID [2022-02-20 20:58:20,886 INFO L290 TraceCheckUtils]: 63: Hoare triple {90#false} [147] L34-5-->L72: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#false} is VALID [2022-02-20 20:58:20,887 INFO L290 TraceCheckUtils]: 64: Hoare triple {90#false} [197] L72-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#false} is VALID [2022-02-20 20:58:20,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:58:20,891 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:58:20,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735072274] [2022-02-20 20:58:20,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735072274] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:58:20,892 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:58:20,892 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:58:20,894 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584643403] [2022-02-20 20:58:20,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:58:20,908 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 20:58:20,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:58:20,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:20,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:58:20,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:58:20,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:58:21,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:58:21,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:58:21,012 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 82 [2022-02-20 20:58:21,016 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 154 flow. Second operand has 8 states, 8 states have (on average 55.75) internal successors, (446), 8 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:21,019 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:58:21,019 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 82 [2022-02-20 20:58:21,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:58:21,311 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2022-02-20 20:58:21,312 INFO L130 PetriNetUnfolder]: For 18/21 co-relation queries the response was YES. [2022-02-20 20:58:21,313 INFO L84 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 92 events. 2/92 cut-off events. For 18/21 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 90 event pairs, 0 based on Foata normal form. 5/94 useless extension candidates. Maximal degree in co-relation 36. Up to 17 conditions per place. [2022-02-20 20:58:21,315 INFO L132 encePairwiseOnDemand]: 68/82 looper letters, 18 selfloop transitions, 4 changer transitions 13/78 dead transitions. [2022-02-20 20:58:21,315 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 78 transitions, 250 flow [2022-02-20 20:58:21,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 20:58:21,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-02-20 20:58:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 570 transitions. [2022-02-20 20:58:21,350 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6951219512195121 [2022-02-20 20:58:21,350 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 570 transitions. [2022-02-20 20:58:21,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 570 transitions. [2022-02-20 20:58:21,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:58:21,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 570 transitions. [2022-02-20 20:58:21,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 57.0) internal successors, (570), 10 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:21,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 82.0) internal successors, (902), 11 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:21,365 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 82.0) internal successors, (902), 11 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:21,366 INFO L186 Difference]: Start difference. First operand has 75 places, 71 transitions, 154 flow. Second operand 10 states and 570 transitions. [2022-02-20 20:58:21,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 78 transitions, 250 flow [2022-02-20 20:58:21,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 78 transitions, 234 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-02-20 20:58:21,379 INFO L242 Difference]: Finished difference. Result has 83 places, 65 transitions, 152 flow [2022-02-20 20:58:21,380 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=152, PETRI_PLACES=83, PETRI_TRANSITIONS=65} [2022-02-20 20:58:21,384 INFO L334 CegarLoopForPetriNet]: 75 programPoint places, 8 predicate places. [2022-02-20 20:58:21,384 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 65 transitions, 152 flow [2022-02-20 20:58:21,400 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 114 states, 113 states have (on average 1.584070796460177) internal successors, (179), 113 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:21,403 INFO L78 Accepts]: Start accepts. Automaton has has 114 states, 113 states have (on average 1.584070796460177) internal successors, (179), 113 states have internal predecessors, (179), 0 states have call successors, (0), 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 65 [2022-02-20 20:58:21,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:58:21,404 INFO L470 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 152 flow [2022-02-20 20:58:21,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 55.75) internal successors, (446), 8 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:21,404 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:58:21,405 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:58:21,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:58:21,405 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:58:21,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:58:21,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1050215850, now seen corresponding path program 2 times [2022-02-20 20:58:21,406 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:58:21,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928869432] [2022-02-20 20:58:21,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:58:21,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:58:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:58:21,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {224#true} [181] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-02-20 20:58:21,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#true} [158] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {224#true} is VALID [2022-02-20 20:58:21,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} [185] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {224#true} is VALID [2022-02-20 20:58:21,682 INFO L290 TraceCheckUtils]: 3: Hoare triple {224#true} [187] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {224#true} is VALID [2022-02-20 20:58:21,682 INFO L290 TraceCheckUtils]: 4: Hoare triple {224#true} [150] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {224#true} is VALID [2022-02-20 20:58:21,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#true} [173] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {224#true} is VALID [2022-02-20 20:58:21,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {224#true} [171] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {224#true} is VALID [2022-02-20 20:58:21,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#true} [141] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 17)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {224#true} is VALID [2022-02-20 20:58:21,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#true} [195] L21-4-->L38: Formula: (= v_~x~0_6 0) InVars {} OutVars{~x~0=v_~x~0_6} AuxVars[] AssignedVars[~x~0] {224#true} is VALID [2022-02-20 20:58:21,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {224#true} [196] L38-->L-1-3: Formula: (= v_~y~0_1 0) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] {224#true} is VALID [2022-02-20 20:58:21,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {224#true} [192] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-02-20 20:58:21,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {224#true} [167] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-02-20 20:58:21,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {224#true} [137] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {224#true} is VALID [2022-02-20 20:58:21,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {224#true} [166] L-1-6-->L58: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_~#t2~0#1.base] {224#true} is VALID [2022-02-20 20:58:21,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {224#true} [156] L58-->L58-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {224#true} is VALID [2022-02-20 20:58:21,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {224#true} [132] L58-1-->L58-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {224#true} is VALID [2022-02-20 20:58:21,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {224#true} [134] L58-2-->L60: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet3#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet3#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[] {224#true} is VALID [2022-02-20 20:58:21,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {224#true} [190] L60-->L60-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_3| v_~x~0_7) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] {224#true} is VALID [2022-02-20 20:58:21,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {224#true} [157] L60-1-->L61: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {224#true} is VALID [2022-02-20 20:58:21,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {224#true} [124] L61-->L61-1: Formula: (and (<= |v_ULTIMATE.start_main_#t~nondet4#1_2| 2147483647) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet4#1_2| 2147483648))) InVars {ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[] {224#true} is VALID [2022-02-20 20:58:21,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {224#true} [164] L61-1-->L61-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet4#1_3| v_~y~0_2) InVars {ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_3|} OutVars{~y~0=v_~y~0_2, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_3|} AuxVars[] AssignedVars[~y~0] {224#true} is VALID [2022-02-20 20:58:21,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {224#true} [172] L61-2-->L62: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {224#true} is VALID [2022-02-20 20:58:21,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {224#true} [193] L62-->L62-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-02-20 20:58:21,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {224#true} [177] L62-1-->L62-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< v_~x~0_8 2147483647) 1 0)) InVars {~x~0=v_~x~0_8} OutVars{~x~0=v_~x~0_8, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {224#true} is VALID [2022-02-20 20:58:21,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {224#true} [149] L62-2-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {224#true} is VALID [2022-02-20 20:58:21,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {224#true} [148] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {224#true} is VALID [2022-02-20 20:58:21,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {224#true} [175] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {224#true} is VALID [2022-02-20 20:58:21,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {224#true} [168] L34-1-->L63: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-02-20 20:58:21,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {224#true} [125] L63-->L63-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-02-20 20:58:21,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {224#true} [170] L63-1-->L63-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (= v_~x~0_9 v_~y~0_3) 1 0)) InVars {~y~0=v_~y~0_3, ~x~0=v_~x~0_9} OutVars{~y~0=v_~y~0_3, ~x~0=v_~x~0_9, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {226#(or (and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:58:21,690 INFO L290 TraceCheckUtils]: 30: Hoare triple {226#(or (and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [142] L63-2-->L34-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {226#(or (and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:58:21,691 INFO L290 TraceCheckUtils]: 31: Hoare triple {226#(or (and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [159] L34-2-->L35-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {227#(or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0)))} is VALID [2022-02-20 20:58:21,691 INFO L290 TraceCheckUtils]: 32: Hoare triple {227#(or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0)))} [131] L35-3-->L34-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,692 INFO L290 TraceCheckUtils]: 33: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [140] L34-3-->L66: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,692 INFO L290 TraceCheckUtils]: 34: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [152] L66-->L66-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,693 INFO L290 TraceCheckUtils]: 35: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [188] L66-1-->L66-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,694 INFO L290 TraceCheckUtils]: 36: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [161] L66-2-->L66-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,694 INFO L290 TraceCheckUtils]: 37: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [209] L66-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,695 INFO L290 TraceCheckUtils]: 38: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [178] L66-4-->L66-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,696 INFO L290 TraceCheckUtils]: 39: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [179] L66-5-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [180] L67-->L67-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,697 INFO L290 TraceCheckUtils]: 41: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [146] L67-1-->L67-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [135] L67-2-->L67-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,698 INFO L290 TraceCheckUtils]: 43: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [211] L67-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,699 INFO L290 TraceCheckUtils]: 44: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [205] thread2ENTRY-->L52: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (<= 0 v_~x~0_40) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= v_~x~0_40 (+ v_~x~0_39 1))) InVars {~x~0=v_~x~0_40} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0] {229#(and (<= (+ ~x~0 1) ~y~0) (<= ~y~0 (+ ~x~0 1)))} is VALID [2022-02-20 20:58:21,700 INFO L290 TraceCheckUtils]: 45: Hoare triple {229#(and (<= (+ ~x~0 1) ~y~0) (<= ~y~0 (+ ~x~0 1)))} [202] thread1ENTRY-->L43: Formula: (= v_~x~0_31 (+ v_~x~0_32 1)) InVars {~x~0=v_~x~0_32} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, ~x~0=v_~x~0_31} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~x~0] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,700 INFO L290 TraceCheckUtils]: 46: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [176] L67-4-->L67-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,701 INFO L290 TraceCheckUtils]: 47: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [128] L67-5-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,701 INFO L290 TraceCheckUtils]: 48: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [184] L68-->L68-1: Formula: (= |v_ULTIMATE.start_main_#t~mem9#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,702 INFO L290 TraceCheckUtils]: 49: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [203] L43-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,703 INFO L290 TraceCheckUtils]: 50: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [204] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,703 INFO L290 TraceCheckUtils]: 51: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [212] thread1EXIT-->L68-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem9#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,704 INFO L290 TraceCheckUtils]: 52: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [129] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,704 INFO L290 TraceCheckUtils]: 53: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [136] L69-->L69-1: Formula: (= (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) |v_ULTIMATE.start_main_#t~mem10#1_2|) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10#1] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,705 INFO L290 TraceCheckUtils]: 54: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [206] L52-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,706 INFO L290 TraceCheckUtils]: 55: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [207] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,706 INFO L290 TraceCheckUtils]: 56: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [213] thread2EXIT-->L69-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_5|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_5|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,707 INFO L290 TraceCheckUtils]: 57: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [153] L69-2-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10#1] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,707 INFO L290 TraceCheckUtils]: 58: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [127] L71-->L71-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} is VALID [2022-02-20 20:58:21,708 INFO L290 TraceCheckUtils]: 59: Hoare triple {228#(and (<= ~x~0 ~y~0) (<= ~y~0 ~x~0))} [143] L71-1-->L71-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (not (= v_~x~0_10 v_~y~0_4)) 1 0)) InVars {~y~0=v_~y~0_4, ~x~0=v_~x~0_10} OutVars{~y~0=v_~y~0_4, ~x~0=v_~x~0_10, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {230#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:21,718 INFO L290 TraceCheckUtils]: 60: Hoare triple {230#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [186] L71-2-->L34-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {230#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:21,719 INFO L290 TraceCheckUtils]: 61: Hoare triple {230#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [123] L34-4-->L35-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {231#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:58:21,720 INFO L290 TraceCheckUtils]: 62: Hoare triple {231#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [200] L35-6-->L34-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] {225#false} is VALID [2022-02-20 20:58:21,720 INFO L290 TraceCheckUtils]: 63: Hoare triple {225#false} [147] L34-5-->L72: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#false} is VALID [2022-02-20 20:58:21,720 INFO L290 TraceCheckUtils]: 64: Hoare triple {225#false} [197] L72-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#false} is VALID [2022-02-20 20:58:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:58:21,721 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:58:21,721 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928869432] [2022-02-20 20:58:21,721 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928869432] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:58:21,722 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:58:21,722 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:58:21,722 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381801733] [2022-02-20 20:58:21,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:58:21,723 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 20:58:21,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:58:21,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:21,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:58:21,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:58:21,774 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:58:21,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:58:21,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:58:21,776 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 82 [2022-02-20 20:58:21,777 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 152 flow. Second operand has 8 states, 8 states have (on average 55.75) internal successors, (446), 8 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:21,777 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:58:21,778 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 82 [2022-02-20 20:58:21,778 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:58:21,952 INFO L129 PetriNetUnfolder]: 0/62 cut-off events. [2022-02-20 20:58:21,953 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-02-20 20:58:21,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 62 events. 0/62 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 1/63 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2022-02-20 20:58:21,953 INFO L132 encePairwiseOnDemand]: 74/82 looper letters, 0 selfloop transitions, 0 changer transitions 62/62 dead transitions. [2022-02-20 20:58:21,953 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 62 transitions, 186 flow [2022-02-20 20:58:21,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:58:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-02-20 20:58:21,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 446 transitions. [2022-02-20 20:58:21,960 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6798780487804879 [2022-02-20 20:58:21,960 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 446 transitions. [2022-02-20 20:58:21,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 446 transitions. [2022-02-20 20:58:21,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:58:21,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 446 transitions. [2022-02-20 20:58:21,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 55.75) internal successors, (446), 8 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:21,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 82.0) internal successors, (738), 9 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:21,964 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 82.0) internal successors, (738), 9 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:21,964 INFO L186 Difference]: Start difference. First operand has 83 places, 65 transitions, 152 flow. Second operand 8 states and 446 transitions. [2022-02-20 20:58:21,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 62 transitions, 186 flow [2022-02-20 20:58:21,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 62 transitions, 174 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-02-20 20:58:21,967 INFO L242 Difference]: Finished difference. Result has 74 places, 0 transitions, 0 flow [2022-02-20 20:58:21,967 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=74, PETRI_TRANSITIONS=0} [2022-02-20 20:58:21,969 INFO L334 CegarLoopForPetriNet]: 75 programPoint places, -1 predicate places. [2022-02-20 20:58:21,969 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 0 transitions, 0 flow [2022-02-20 20:58:21,969 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:21,969 INFO L78 Accepts]: Start accepts. Automaton has has 1 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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 65 [2022-02-20 20:58:21,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:58:21,970 INFO L470 AbstractCegarLoop]: Abstraction has has 74 places, 0 transitions, 0 flow [2022-02-20 20:58:21,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 55.75) internal successors, (446), 8 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:21,973 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-02-20 20:58:21,973 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-02-20 20:58:21,973 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-02-20 20:58:21,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:58:21,977 INFO L732 BasicCegarLoop]: Path program histogram: [2] [2022-02-20 20:58:21,978 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:58:21,978 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:58:21,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:58:21 BasicIcfg [2022-02-20 20:58:21,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:58:21,982 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:58:21,982 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:58:21,983 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:58:21,983 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:58:20" (3/4) ... [2022-02-20 20:58:21,985 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 20:58:21,989 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-02-20 20:58:21,989 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-02-20 20:58:21,993 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-02-20 20:58:21,993 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 20:58:21,993 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 20:58:21,993 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 20:58:22,025 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:58:22,026 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:58:22,027 INFO L158 Benchmark]: Toolchain (without parser) took 2624.29ms. Allocated memory was 92.3MB in the beginning and 130.0MB in the end (delta: 37.7MB). Free memory was 59.7MB in the beginning and 80.0MB in the end (delta: -20.3MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2022-02-20 20:58:22,027 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory was 47.0MB in the beginning and 47.0MB in the end (delta: 45.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:58:22,027 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.29ms. Allocated memory is still 92.3MB. Free memory was 59.4MB in the beginning and 67.2MB in the end (delta: -7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 20:58:22,028 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.09ms. Allocated memory is still 92.3MB. Free memory was 66.9MB in the beginning and 65.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:58:22,028 INFO L158 Benchmark]: Boogie Preprocessor took 17.16ms. Allocated memory is still 92.3MB. Free memory was 65.3MB in the beginning and 64.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:58:22,028 INFO L158 Benchmark]: RCFGBuilder took 364.89ms. Allocated memory is still 92.3MB. Free memory was 64.0MB in the beginning and 49.5MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 20:58:22,029 INFO L158 Benchmark]: TraceAbstraction took 1950.84ms. Allocated memory was 92.3MB in the beginning and 130.0MB in the end (delta: 37.7MB). Free memory was 49.0MB in the beginning and 83.2MB in the end (delta: -34.1MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-02-20 20:58:22,029 INFO L158 Benchmark]: Witness Printer took 43.52ms. Allocated memory is still 130.0MB. Free memory was 83.2MB in the beginning and 80.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 20:58:22,031 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory was 47.0MB in the beginning and 47.0MB in the end (delta: 45.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.29ms. Allocated memory is still 92.3MB. Free memory was 59.4MB in the beginning and 67.2MB in the end (delta: -7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.09ms. Allocated memory is still 92.3MB. Free memory was 66.9MB in the beginning and 65.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.16ms. Allocated memory is still 92.3MB. Free memory was 65.3MB in the beginning and 64.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 364.89ms. Allocated memory is still 92.3MB. Free memory was 64.0MB in the beginning and 49.5MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1950.84ms. Allocated memory was 92.3MB in the beginning and 130.0MB in the end (delta: 37.7MB). Free memory was 49.0MB in the beginning and 83.2MB in the end (delta: -34.1MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Witness Printer took 43.52ms. Allocated memory is still 130.0MB. Free memory was 83.2MB in the beginning and 80.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 72]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 90 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 158 IncrementalHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 24 mSDtfsCounter, 158 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 588 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 20:58:22,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE