./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-lit/fkp2013_variant-2.i --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/pthread-lit/fkp2013_variant-2.i -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 37f99419c791b8329e91533415d896c367c9197a331e0ac4d97f5b27dc6c2be9 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:35:57,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:35:57,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:35:57,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:35:57,059 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:35:57,062 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:35:57,063 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:35:57,065 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:35:57,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:35:57,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:35:57,070 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:35:57,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:35:57,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:35:57,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:35:57,074 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:35:57,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:35:57,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:35:57,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:35:57,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:35:57,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:35:57,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:35:57,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:35:57,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:35:57,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:35:57,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:35:57,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:35:57,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:35:57,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:35:57,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:35:57,094 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:35:57,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:35:57,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:35:57,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:35:57,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:35:57,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:35:57,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:35:57,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:35:57,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:35:57,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:35:57,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:35:57,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:35:57,101 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:35:57,127 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:35:57,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:35:57,128 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:35:57,128 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:35:57,129 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:35:57,129 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:35:57,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:35:57,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:35:57,130 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:35:57,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:35:57,130 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:35:57,131 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:35:57,131 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:35:57,131 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:35:57,131 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:35:57,131 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:35:57,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:35:57,131 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:35:57,132 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:35:57,132 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:35:57,132 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:35:57,132 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:35:57,132 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:35:57,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:35:57,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:35:57,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:35:57,133 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:35:57,134 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:35:57,134 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:35:57,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:35:57,134 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:35:57,134 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:35:57,135 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:35:57,135 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 -> 37f99419c791b8329e91533415d896c367c9197a331e0ac4d97f5b27dc6c2be9 [2022-02-20 20:35:57,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:35:57,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:35:57,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:35:57,326 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:35:57,326 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:35:57,327 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/fkp2013_variant-2.i [2022-02-20 20:35:57,378 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c54ac06be/243e9a45f4d24c1486f7f22d57804f7f/FLAGa5ec79b13 [2022-02-20 20:35:57,790 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:35:57,793 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/fkp2013_variant-2.i [2022-02-20 20:35:57,808 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c54ac06be/243e9a45f4d24c1486f7f22d57804f7f/FLAGa5ec79b13 [2022-02-20 20:35:58,159 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c54ac06be/243e9a45f4d24c1486f7f22d57804f7f [2022-02-20 20:35:58,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:35:58,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:35:58,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:35:58,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:35:58,173 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:35:58,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:35:58" (1/1) ... [2022-02-20 20:35:58,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35268bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:35:58, skipping insertion in model container [2022-02-20 20:35:58,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:35:58" (1/1) ... [2022-02-20 20:35:58,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:35:58,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:35:58,486 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/pthread-lit/fkp2013_variant-2.i[30003,30016] [2022-02-20 20:35:58,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:35:58,506 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:35:58,553 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/pthread-lit/fkp2013_variant-2.i[30003,30016] [2022-02-20 20:35:58,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:35:58,588 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:35:58,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:35:58 WrapperNode [2022-02-20 20:35:58,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:35:58,589 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:35:58,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:35:58,589 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:35:58,594 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:35:58" (1/1) ... [2022-02-20 20:35:58,617 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:35:58" (1/1) ... [2022-02-20 20:35:58,632 INFO L137 Inliner]: procedures = 172, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2022-02-20 20:35:58,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:35:58,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:35:58,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:35:58,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:35:58,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:35:58" (1/1) ... [2022-02-20 20:35:58,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:35:58" (1/1) ... [2022-02-20 20:35:58,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:35:58" (1/1) ... [2022-02-20 20:35:58,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:35:58" (1/1) ... [2022-02-20 20:35:58,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:35:58" (1/1) ... [2022-02-20 20:35:58,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:35:58" (1/1) ... [2022-02-20 20:35:58,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:35:58" (1/1) ... [2022-02-20 20:35:58,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:35:58,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:35:58,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:35:58,661 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:35:58,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:35:58" (1/1) ... [2022-02-20 20:35:58,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:35:58,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:35:58,688 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:35:58,706 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:35:58,716 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-02-20 20:35:58,717 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-02-20 20:35:58,717 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-02-20 20:35:58,717 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-02-20 20:35:58,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:35:58,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:35:58,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:35:58,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:35:58,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:35:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:35:58,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:35:58,719 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:35:58,803 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:35:58,805 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:35:58,959 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:35:58,964 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:35:58,969 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 20:35:58,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:35:58 BoogieIcfgContainer [2022-02-20 20:35:58,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:35:58,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:35:58,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:35:58,974 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:35:58,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:35:58" (1/3) ... [2022-02-20 20:35:58,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cae0ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:35:58, skipping insertion in model container [2022-02-20 20:35:58,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:35:58" (2/3) ... [2022-02-20 20:35:58,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cae0ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:35:58, skipping insertion in model container [2022-02-20 20:35:58,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:35:58" (3/3) ... [2022-02-20 20:35:58,976 INFO L111 eAbstractionObserver]: Analyzing ICFG fkp2013_variant-2.i [2022-02-20 20:35:58,980 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:35:58,980 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:35:58,980 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:35:58,980 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:35:59,028 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,028 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,029 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,029 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,029 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,029 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,029 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,029 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,029 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,030 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,030 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,030 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,040 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,040 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,041 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,042 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,042 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,043 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,043 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,043 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,043 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,044 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,044 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,045 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,045 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,045 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,047 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,047 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,048 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,049 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,049 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,049 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,050 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,050 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,050 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,051 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,051 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,051 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,052 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,053 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,053 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,054 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,056 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,063 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,063 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,063 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,063 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,077 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,077 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,077 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,077 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,077 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,077 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:59,078 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:35:59,116 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:35:59,122 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:35:59,122 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-20 20:35:59,133 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 80 transitions, 170 flow [2022-02-20 20:35:59,179 INFO L129 PetriNetUnfolder]: 4/93 cut-off events. [2022-02-20 20:35:59,180 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:35:59,183 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 93 events. 4/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 106 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 68. Up to 4 conditions per place. [2022-02-20 20:35:59,183 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 80 transitions, 170 flow [2022-02-20 20:35:59,186 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 79 transitions, 166 flow [2022-02-20 20:35:59,205 INFO L129 PetriNetUnfolder]: 2/53 cut-off events. [2022-02-20 20:35:59,206 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:35:59,206 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:35:59,206 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] [2022-02-20 20:35:59,207 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:35:59,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:35:59,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1926868283, now seen corresponding path program 1 times [2022-02-20 20:35:59,227 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:35:59,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026629256] [2022-02-20 20:35:59,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:35:59,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:35:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:35:59,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {86#true} [157] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:35:59,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {86#true} [146] 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] {86#true} is VALID [2022-02-20 20:35:59,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {86#true} [164] 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[] {86#true} is VALID [2022-02-20 20:35:59,635 INFO L290 TraceCheckUtils]: 3: Hoare triple {86#true} [168] L-1-2-->L683: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:35:59,636 INFO L290 TraceCheckUtils]: 4: Hoare triple {86#true} [111] L683-->L683-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[] {86#true} is VALID [2022-02-20 20:35:59,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {86#true} [156] L683-1-->L683-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[] {86#true} is VALID [2022-02-20 20:35:59,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {86#true} [145] L683-2-->L683-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[] {86#true} is VALID [2022-02-20 20:35:59,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {86#true} [162] L683-3-->L683-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:35:59,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {86#true} [103] L683-4-->L698: Formula: (= v_~x~0_4 0) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] {86#true} is VALID [2022-02-20 20:35:59,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {86#true} [134] L698-->L-1-3: Formula: (= v_~n~0_2 0) InVars {} OutVars{~n~0=v_~n~0_2} AuxVars[] AssignedVars[~n~0] {86#true} is VALID [2022-02-20 20:35:59,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {86#true} [170] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:35:59,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {86#true} [149] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:35:59,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {86#true} [121] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {86#true} is VALID [2022-02-20 20:35:59,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {86#true} [148] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {86#true} is VALID [2022-02-20 20:35:59,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {86#true} [113] L-1-7-->L709: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post6#1=|v_ULTIMATE.start_main_#t~post6#1_1|, ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#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~post6#1, ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t2~0#1.base] {86#true} is VALID [2022-02-20 20:35:59,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {86#true} [152] L709-->L709-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {86#true} is VALID [2022-02-20 20:35:59,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {86#true} [159] L709-1-->L710: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {86#true} is VALID [2022-02-20 20:35:59,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {86#true} [101] L710-->L710-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] {86#true} is VALID [2022-02-20 20:35:59,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {86#true} [173] L710-1-->L710-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] {86#true} is VALID [2022-02-20 20:35:59,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {86#true} [147] L710-2-->L712: Formula: true InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {86#true} is VALID [2022-02-20 20:35:59,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {86#true} [172] L712-->L713: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] {88#(= ~x~0 0)} is VALID [2022-02-20 20:35:59,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {88#(= ~x~0 0)} [140] L713-->L713-1: 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[] {88#(= ~x~0 0)} is VALID [2022-02-20 20:35:59,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {88#(= ~x~0 0)} [119] L713-1-->L713-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_3| v_~n~0_3) 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|, ~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] {89#(or (= ~x~0 0) (<= ~n~0 0))} is VALID [2022-02-20 20:35:59,650 INFO L290 TraceCheckUtils]: 23: Hoare triple {89#(or (= ~x~0 0) (<= ~n~0 0))} [114] L713-2-->L714: 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#(or (= ~x~0 0) (<= ~n~0 0))} is VALID [2022-02-20 20:35:59,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {89#(or (= ~x~0 0) (<= ~n~0 0))} [108] L714-->L714-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89#(or (= ~x~0 0) (<= ~n~0 0))} is VALID [2022-02-20 20:35:59,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {89#(or (= ~x~0 0) (<= ~n~0 0))} [132] L714-1-->L714-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~n~0_4) 1 0)) InVars {~n~0=v_~n~0_4} OutVars{~n~0=v_~n~0_4, 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] {90#(and (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= ~x~0 0) (<= ~n~0 0)))} is VALID [2022-02-20 20:35:59,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {90#(and (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= ~x~0 0) (<= ~n~0 0)))} [122] L714-2-->L685: 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] {90#(and (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= ~x~0 0) (<= ~n~0 0)))} is VALID [2022-02-20 20:35:59,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {90#(and (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= ~x~0 0) (<= ~n~0 0)))} [123] L685-->L686: 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] {91#(and (or (= ~x~0 0) (<= ~n~0 0)) (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} is VALID [2022-02-20 20:35:59,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {91#(and (or (= ~x~0 0) (<= ~n~0 0)) (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} [175] L686-->L685-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[] {92#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:59,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {92#(and (= ~x~0 0) (<= 1 ~n~0))} [153] L685-1-->L715: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {92#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:59,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {92#(and (= ~x~0 0) (<= 1 ~n~0))} [115] L715-->L715-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {92#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:59,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {92#(and (= ~x~0 0) (<= 1 ~n~0))} [125] L715-1-->L715-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {92#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:59,659 INFO L290 TraceCheckUtils]: 32: Hoare triple {92#(and (= ~x~0 0) (<= 1 ~n~0))} [105] L715-2-->L715-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~pre4#1_3|)) |v_#memory_int_3|) InVars {#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_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#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_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {92#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:59,660 INFO L290 TraceCheckUtils]: 33: Hoare triple {92#(and (= ~x~0 0) (<= 1 ~n~0))} [199] L715-3-->thr1ENTRY: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~arg#1.offset_4| 0) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~arg#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork1_#res#1.offset=|v_thr1Thread1of1ForFork1_#res#1.offset_4|, thr1Thread1of1ForFork1_#in~arg#1.base=|v_thr1Thread1of1ForFork1_#in~arg#1.base_4|, thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1=|v_thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_6|, thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1_10|, thr1Thread1of1ForFork1_~arg#1.base=|v_thr1Thread1of1ForFork1_~arg#1.base_4|, thr1Thread1of1ForFork1_~arg#1.offset=|v_thr1Thread1of1ForFork1_~arg#1.offset_4|, thr1Thread1of1ForFork1_#in~arg#1.offset=|v_thr1Thread1of1ForFork1_#in~arg#1.offset_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_#res#1.base=|v_thr1Thread1of1ForFork1_#res#1.base_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#res#1.offset, thr1Thread1of1ForFork1_#in~arg#1.base, thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1, thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1, thr1Thread1of1ForFork1_~arg#1.base, thr1Thread1of1ForFork1_~arg#1.offset, thr1Thread1of1ForFork1_#in~arg#1.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_#res#1.base] {92#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:59,660 INFO L290 TraceCheckUtils]: 34: Hoare triple {92#(and (= ~x~0 0) (<= 1 ~n~0))} [183] thr1ENTRY-->L700: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~arg#1.offset_1| |v_thr1Thread1of1ForFork1_~arg#1.offset_1|) (= |v_thr1Thread1of1ForFork1_~arg#1.base_1| |v_thr1Thread1of1ForFork1_#in~arg#1.base_1|)) InVars {thr1Thread1of1ForFork1_#in~arg#1.base=|v_thr1Thread1of1ForFork1_#in~arg#1.base_1|, thr1Thread1of1ForFork1_#in~arg#1.offset=|v_thr1Thread1of1ForFork1_#in~arg#1.offset_1|} OutVars{thr1Thread1of1ForFork1_#in~arg#1.base=|v_thr1Thread1of1ForFork1_#in~arg#1.base_1|, thr1Thread1of1ForFork1_#in~arg#1.offset=|v_thr1Thread1of1ForFork1_#in~arg#1.offset_1|, thr1Thread1of1ForFork1_~arg#1.base=|v_thr1Thread1of1ForFork1_~arg#1.base_1|, thr1Thread1of1ForFork1_~arg#1.offset=|v_thr1Thread1of1ForFork1_~arg#1.offset_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~arg#1.base, thr1Thread1of1ForFork1_~arg#1.offset] {92#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:59,660 INFO L290 TraceCheckUtils]: 35: Hoare triple {92#(and (= ~x~0 0) (<= 1 ~n~0))} [184] L700-->L700-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {92#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:59,661 INFO L290 TraceCheckUtils]: 36: Hoare triple {92#(and (= ~x~0 0) (<= 1 ~n~0))} [185] L700-1-->L700-2: Formula: (= |v_thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_1| (ite (< v_~x~0_3 v_~n~0_1) 1 0)) InVars {~n~0=v_~n~0_1, ~x~0=v_~x~0_3} OutVars{thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1=|v_thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_1|, ~n~0=v_~n~0_1, ~x~0=v_~x~0_3} AuxVars[] AssignedVars[thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1] {93#(not (= |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:35:59,661 INFO L290 TraceCheckUtils]: 37: Hoare triple {93#(not (= |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| 0))} [186] L700-2-->L688: Formula: true InVars {} OutVars{thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1] {93#(not (= |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:35:59,662 INFO L290 TraceCheckUtils]: 38: Hoare triple {93#(not (= |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| 0))} [187] L688-->L689: Formula: (= |v_thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1_3| |v_thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_3|) InVars {thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1=|v_thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_3|} OutVars{thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1_3|, thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1=|v_thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_3|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1] {94#(not (= |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:35:59,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {94#(not (= |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| 0))} [188] L689-->L690: Formula: (= |v_thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1_5| 0) InVars {thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1_5|} OutVars{thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1_5|} AuxVars[] AssignedVars[] {87#false} is VALID [2022-02-20 20:35:59,663 INFO L290 TraceCheckUtils]: 40: Hoare triple {87#false} [190] L690-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87#false} is VALID [2022-02-20 20:35:59,664 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:35:59,665 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:35:59,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026629256] [2022-02-20 20:35:59,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026629256] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:35:59,666 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:35:59,666 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:35:59,667 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087333979] [2022-02-20 20:35:59,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:35:59,677 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 20:35:59,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:35:59,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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:35:59,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:35:59,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:35:59,714 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:35:59,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:35:59,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:35:59,738 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 80 [2022-02-20 20:35:59,750 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 79 transitions, 166 flow. Second operand has 9 states, 9 states have (on average 57.44444444444444) internal successors, (517), 9 states have internal predecessors, (517), 0 states have call successors, (0), 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:35:59,751 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:35:59,752 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 80 [2022-02-20 20:35:59,752 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:36:00,097 INFO L129 PetriNetUnfolder]: 71/288 cut-off events. [2022-02-20 20:36:00,098 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-02-20 20:36:00,099 INFO L84 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 288 events. 71/288 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1479 event pairs, 5 based on Foata normal form. 4/255 useless extension candidates. Maximal degree in co-relation 409. Up to 38 conditions per place. [2022-02-20 20:36:00,101 INFO L132 encePairwiseOnDemand]: 68/80 looper letters, 28 selfloop transitions, 11 changer transitions 6/100 dead transitions. [2022-02-20 20:36:00,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 100 transitions, 304 flow [2022-02-20 20:36:00,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 20:36:00,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-02-20 20:36:00,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 672 transitions. [2022-02-20 20:36:00,127 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7636363636363637 [2022-02-20 20:36:00,127 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 672 transitions. [2022-02-20 20:36:00,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 672 transitions. [2022-02-20 20:36:00,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:36:00,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 672 transitions. [2022-02-20 20:36:00,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 61.09090909090909) internal successors, (672), 11 states have internal predecessors, (672), 0 states have call successors, (0), 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:36:00,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 80.0) internal successors, (960), 12 states have internal predecessors, (960), 0 states have call successors, (0), 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:36:00,144 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 80.0) internal successors, (960), 12 states have internal predecessors, (960), 0 states have call successors, (0), 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:36:00,145 INFO L186 Difference]: Start difference. First operand has 82 places, 79 transitions, 166 flow. Second operand 11 states and 672 transitions. [2022-02-20 20:36:00,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 100 transitions, 304 flow [2022-02-20 20:36:00,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 100 transitions, 303 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:36:00,151 INFO L242 Difference]: Finished difference. Result has 94 places, 80 transitions, 209 flow [2022-02-20 20:36:00,153 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=209, PETRI_PLACES=94, PETRI_TRANSITIONS=80} [2022-02-20 20:36:00,155 INFO L334 CegarLoopForPetriNet]: 82 programPoint places, 12 predicate places. [2022-02-20 20:36:00,156 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 80 transitions, 209 flow [2022-02-20 20:36:00,230 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2144 states, 2137 states have (on average 2.573701450631727) internal successors, (5500), 2143 states have internal predecessors, (5500), 0 states have call successors, (0), 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:36:00,235 INFO L78 Accepts]: Start accepts. Automaton has has 2144 states, 2137 states have (on average 2.573701450631727) internal successors, (5500), 2143 states have internal predecessors, (5500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 20:36:00,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:36:00,236 INFO L470 AbstractCegarLoop]: Abstraction has has 94 places, 80 transitions, 209 flow [2022-02-20 20:36:00,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.44444444444444) internal successors, (517), 9 states have internal predecessors, (517), 0 states have call successors, (0), 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:36:00,236 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:36:00,237 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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:36:00,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:36:00,237 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:36:00,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:36:00,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2080092778, now seen corresponding path program 1 times [2022-02-20 20:36:00,238 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:36:00,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937118318] [2022-02-20 20:36:00,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:36:00,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:36:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:36:00,282 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:36:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:36:00,329 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 20:36:00,329 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:36:00,330 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 4 remaining) [2022-02-20 20:36:00,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-02-20 20:36:00,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 4 remaining) [2022-02-20 20:36:00,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-02-20 20:36:00,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:36:00,335 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 20:36:00,336 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-02-20 20:36:00,336 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-02-20 20:36:00,369 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,370 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,370 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,370 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,370 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,370 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,370 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,370 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,371 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,371 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,371 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,371 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,371 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,372 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,372 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,372 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,372 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,372 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,373 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,373 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,373 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,373 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,373 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,373 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,373 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,373 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,374 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,374 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,374 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,374 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,374 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,374 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,375 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,375 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,375 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,375 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,375 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,376 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,376 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,376 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,376 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,376 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,376 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,376 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,377 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,377 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,378 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,378 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,378 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,378 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,378 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,378 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,378 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,379 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,379 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,379 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,380 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,380 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,381 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,381 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,381 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,382 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,382 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,382 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,382 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,382 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,382 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,382 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,383 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,384 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,384 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,384 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,384 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,384 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,385 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,385 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,385 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,385 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,385 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,385 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,386 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,386 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,386 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,386 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,386 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,387 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,387 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,387 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,387 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,387 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,388 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,388 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,388 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,388 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,389 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,390 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,390 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,390 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,390 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,390 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,391 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,391 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,391 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,391 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,391 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,391 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:00,392 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:36:00,394 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:36:00,395 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:36:00,395 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-02-20 20:36:00,397 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 101 transitions, 226 flow [2022-02-20 20:36:00,431 INFO L129 PetriNetUnfolder]: 5/119 cut-off events. [2022-02-20 20:36:00,431 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-02-20 20:36:00,433 INFO L84 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 119 events. 5/119 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 147 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 128. Up to 6 conditions per place. [2022-02-20 20:36:00,433 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 101 transitions, 226 flow [2022-02-20 20:36:00,434 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 86 transitions, 187 flow [2022-02-20 20:36:00,440 INFO L129 PetriNetUnfolder]: 3/58 cut-off events. [2022-02-20 20:36:00,440 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:36:00,440 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:36:00,440 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] [2022-02-20 20:36:00,441 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 20:36:00,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:36:00,442 INFO L85 PathProgramCache]: Analyzing trace with hash 51703260, now seen corresponding path program 1 times [2022-02-20 20:36:00,442 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:36:00,442 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926143696] [2022-02-20 20:36:00,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:36:00,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:36:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:36:00,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {110#true} [258] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-02-20 20:36:00,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#true} [247] 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] {110#true} is VALID [2022-02-20 20:36:00,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {110#true} [265] 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[] {110#true} is VALID [2022-02-20 20:36:00,604 INFO L290 TraceCheckUtils]: 3: Hoare triple {110#true} [269] L-1-2-->L683: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {110#true} is VALID [2022-02-20 20:36:00,604 INFO L290 TraceCheckUtils]: 4: Hoare triple {110#true} [212] L683-->L683-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[] {110#true} is VALID [2022-02-20 20:36:00,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {110#true} [257] L683-1-->L683-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[] {110#true} is VALID [2022-02-20 20:36:00,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {110#true} [246] L683-2-->L683-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[] {110#true} is VALID [2022-02-20 20:36:00,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {110#true} [263] L683-3-->L683-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {110#true} is VALID [2022-02-20 20:36:00,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {110#true} [204] L683-4-->L698: Formula: (= v_~x~0_4 0) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] {110#true} is VALID [2022-02-20 20:36:00,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {110#true} [235] L698-->L-1-3: Formula: (= v_~n~0_2 0) InVars {} OutVars{~n~0=v_~n~0_2} AuxVars[] AssignedVars[~n~0] {110#true} is VALID [2022-02-20 20:36:00,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {110#true} [271] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-02-20 20:36:00,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {110#true} [250] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-02-20 20:36:00,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {110#true} [222] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {110#true} is VALID [2022-02-20 20:36:00,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {110#true} [249] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {110#true} is VALID [2022-02-20 20:36:00,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {110#true} [214] L-1-7-->L709: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post6#1=|v_ULTIMATE.start_main_#t~post6#1_1|, ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#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~post6#1, ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t2~0#1.base] {110#true} is VALID [2022-02-20 20:36:00,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {110#true} [253] L709-->L709-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {110#true} is VALID [2022-02-20 20:36:00,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {110#true} [260] L709-1-->L710: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {110#true} is VALID [2022-02-20 20:36:00,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {110#true} [202] L710-->L710-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] {110#true} is VALID [2022-02-20 20:36:00,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {110#true} [274] L710-1-->L710-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] {110#true} is VALID [2022-02-20 20:36:00,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {110#true} [248] L710-2-->L712: Formula: true InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {110#true} is VALID [2022-02-20 20:36:00,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {110#true} [273] L712-->L713: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] {112#(= ~x~0 0)} is VALID [2022-02-20 20:36:00,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {112#(= ~x~0 0)} [241] L713-->L713-1: 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[] {112#(= ~x~0 0)} is VALID [2022-02-20 20:36:00,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {112#(= ~x~0 0)} [220] L713-1-->L713-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_3| v_~n~0_3) 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|, ~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] {113#(or (= ~x~0 0) (<= ~n~0 0))} is VALID [2022-02-20 20:36:00,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {113#(or (= ~x~0 0) (<= ~n~0 0))} [215] L713-2-->L714: 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] {113#(or (= ~x~0 0) (<= ~n~0 0))} is VALID [2022-02-20 20:36:00,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {113#(or (= ~x~0 0) (<= ~n~0 0))} [209] L714-->L714-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113#(or (= ~x~0 0) (<= ~n~0 0))} is VALID [2022-02-20 20:36:00,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {113#(or (= ~x~0 0) (<= ~n~0 0))} [233] L714-1-->L714-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~n~0_4) 1 0)) InVars {~n~0=v_~n~0_4} OutVars{~n~0=v_~n~0_4, 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] {114#(and (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= ~x~0 0) (<= ~n~0 0)))} is VALID [2022-02-20 20:36:00,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {114#(and (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= ~x~0 0) (<= ~n~0 0)))} [223] L714-2-->L685: 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] {114#(and (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= ~x~0 0) (<= ~n~0 0)))} is VALID [2022-02-20 20:36:00,617 INFO L290 TraceCheckUtils]: 27: Hoare triple {114#(and (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= ~x~0 0) (<= ~n~0 0)))} [224] L685-->L686: 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] {115#(and (or (= ~x~0 0) (<= ~n~0 0)) (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} is VALID [2022-02-20 20:36:00,618 INFO L290 TraceCheckUtils]: 28: Hoare triple {115#(and (or (= ~x~0 0) (<= ~n~0 0)) (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} [276] L686-->L685-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[] {116#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:36:00,618 INFO L290 TraceCheckUtils]: 29: Hoare triple {116#(and (= ~x~0 0) (<= 1 ~n~0))} [254] L685-1-->L715: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {116#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:36:00,619 INFO L290 TraceCheckUtils]: 30: Hoare triple {116#(and (= ~x~0 0) (<= 1 ~n~0))} [216] L715-->L715-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {116#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:36:00,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {116#(and (= ~x~0 0) (<= 1 ~n~0))} [226] L715-1-->L715-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {116#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:36:00,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {116#(and (= ~x~0 0) (<= 1 ~n~0))} [206] L715-2-->L715-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~pre4#1_3|)) |v_#memory_int_3|) InVars {#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_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#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_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {116#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:36:00,621 INFO L290 TraceCheckUtils]: 33: Hoare triple {116#(and (= ~x~0 0) (<= 1 ~n~0))} [320] L715-3-->thr1ENTRY: Formula: (and (= |v_thr1Thread1of2ForFork1_#in~arg#1.base_4| 0) (= |v_thr1Thread1of2ForFork1_#in~arg#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_8| v_thr1Thread1of2ForFork1_thidvar0_2) (= v_thr1Thread1of2ForFork1_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_8|} OutVars{thr1Thread1of2ForFork1_#res#1.base=|v_thr1Thread1of2ForFork1_#res#1.base_4|, thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1_10|, thr1Thread1of2ForFork1_#in~arg#1.base=|v_thr1Thread1of2ForFork1_#in~arg#1.base_4|, thr1Thread1of2ForFork1_thidvar1=v_thr1Thread1of2ForFork1_thidvar1_2, thr1Thread1of2ForFork1_thidvar0=v_thr1Thread1of2ForFork1_thidvar0_2, thr1Thread1of2ForFork1_~arg#1.offset=|v_thr1Thread1of2ForFork1_~arg#1.offset_4|, thr1Thread1of2ForFork1_#in~arg#1.offset=|v_thr1Thread1of2ForFork1_#in~arg#1.offset_4|, thr1Thread1of2ForFork1_~arg#1.base=|v_thr1Thread1of2ForFork1_~arg#1.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_8|, thr1Thread1of2ForFork1_#res#1.offset=|v_thr1Thread1of2ForFork1_#res#1.offset_4|, thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1_6|} AuxVars[] AssignedVars[thr1Thread1of2ForFork1_#res#1.base, thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1, thr1Thread1of2ForFork1_#in~arg#1.base, thr1Thread1of2ForFork1_thidvar1, thr1Thread1of2ForFork1_thidvar0, thr1Thread1of2ForFork1_~arg#1.offset, thr1Thread1of2ForFork1_#in~arg#1.offset, thr1Thread1of2ForFork1_~arg#1.base, thr1Thread1of2ForFork1_#res#1.offset, thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1] {116#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:36:00,630 INFO L290 TraceCheckUtils]: 34: Hoare triple {116#(and (= ~x~0 0) (<= 1 ~n~0))} [290] thr1ENTRY-->L700: Formula: (and (= |v_thr1Thread1of2ForFork1_~arg#1.offset_1| |v_thr1Thread1of2ForFork1_#in~arg#1.offset_1|) (= |v_thr1Thread1of2ForFork1_#in~arg#1.base_1| |v_thr1Thread1of2ForFork1_~arg#1.base_1|)) InVars {thr1Thread1of2ForFork1_#in~arg#1.offset=|v_thr1Thread1of2ForFork1_#in~arg#1.offset_1|, thr1Thread1of2ForFork1_#in~arg#1.base=|v_thr1Thread1of2ForFork1_#in~arg#1.base_1|} OutVars{thr1Thread1of2ForFork1_~arg#1.offset=|v_thr1Thread1of2ForFork1_~arg#1.offset_1|, thr1Thread1of2ForFork1_#in~arg#1.base=|v_thr1Thread1of2ForFork1_#in~arg#1.base_1|, thr1Thread1of2ForFork1_#in~arg#1.offset=|v_thr1Thread1of2ForFork1_#in~arg#1.offset_1|, thr1Thread1of2ForFork1_~arg#1.base=|v_thr1Thread1of2ForFork1_~arg#1.base_1|} AuxVars[] AssignedVars[thr1Thread1of2ForFork1_~arg#1.offset, thr1Thread1of2ForFork1_~arg#1.base] {116#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:36:00,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {116#(and (= ~x~0 0) (<= 1 ~n~0))} [291] L700-->L700-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {116#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:36:00,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {116#(and (= ~x~0 0) (<= 1 ~n~0))} [292] L700-1-->L700-2: Formula: (= |v_thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1_1| (ite (< v_~x~0_3 v_~n~0_1) 1 0)) InVars {~n~0=v_~n~0_1, ~x~0=v_~x~0_3} OutVars{~n~0=v_~n~0_1, ~x~0=v_~x~0_3, thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1_1|} AuxVars[] AssignedVars[thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1] {117#(not (= |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:36:00,632 INFO L290 TraceCheckUtils]: 37: Hoare triple {117#(not (= |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| 0))} [293] L700-2-->L688: Formula: true InVars {} OutVars{thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1] {117#(not (= |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:36:00,632 INFO L290 TraceCheckUtils]: 38: Hoare triple {117#(not (= |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| 0))} [294] L688-->L689: Formula: (= |v_thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1_3| |v_thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1_3|) InVars {thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1_3|} OutVars{thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1_3|, thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1_3|} AuxVars[] AssignedVars[thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1] {118#(not (= |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:36:00,632 INFO L290 TraceCheckUtils]: 39: Hoare triple {118#(not (= |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| 0))} [295] L689-->L690: Formula: (= |v_thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1_5| 0) InVars {thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1_5|} OutVars{thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1_5|} AuxVars[] AssignedVars[] {111#false} is VALID [2022-02-20 20:36:00,633 INFO L290 TraceCheckUtils]: 40: Hoare triple {111#false} [297] L690-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#false} is VALID [2022-02-20 20:36:00,633 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:36:00,633 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:36:00,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926143696] [2022-02-20 20:36:00,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926143696] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:36:00,634 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:36:00,634 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:36:00,634 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965601239] [2022-02-20 20:36:00,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:36:00,634 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 20:36:00,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:36:00,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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:36:00,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:36:00,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:36:00,657 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:36:00,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:36:00,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:36:00,659 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 101 [2022-02-20 20:36:00,659 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 86 transitions, 187 flow. Second operand has 9 states, 9 states have (on average 71.44444444444444) internal successors, (643), 9 states have internal predecessors, (643), 0 states have call successors, (0), 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:36:00,659 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:36:00,660 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 101 [2022-02-20 20:36:00,660 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:36:01,001 INFO L129 PetriNetUnfolder]: 429/1137 cut-off events. [2022-02-20 20:36:01,002 INFO L130 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2022-02-20 20:36:01,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1939 conditions, 1137 events. 429/1137 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8608 event pairs, 24 based on Foata normal form. 19/1036 useless extension candidates. Maximal degree in co-relation 1887. Up to 213 conditions per place. [2022-02-20 20:36:01,008 INFO L132 encePairwiseOnDemand]: 88/101 looper letters, 54 selfloop transitions, 14 changer transitions 6/133 dead transitions. [2022-02-20 20:36:01,008 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 133 transitions, 465 flow [2022-02-20 20:36:01,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 20:36:01,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-02-20 20:36:01,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 855 transitions. [2022-02-20 20:36:01,015 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7695769576957696 [2022-02-20 20:36:01,015 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 855 transitions. [2022-02-20 20:36:01,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 855 transitions. [2022-02-20 20:36:01,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:36:01,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 855 transitions. [2022-02-20 20:36:01,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 77.72727272727273) internal successors, (855), 11 states have internal predecessors, (855), 0 states have call successors, (0), 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:36:01,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 101.0) internal successors, (1212), 12 states have internal predecessors, (1212), 0 states have call successors, (0), 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:36:01,019 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 101.0) internal successors, (1212), 12 states have internal predecessors, (1212), 0 states have call successors, (0), 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:36:01,020 INFO L186 Difference]: Start difference. First operand has 91 places, 86 transitions, 187 flow. Second operand 11 states and 855 transitions. [2022-02-20 20:36:01,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 133 transitions, 465 flow [2022-02-20 20:36:01,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 133 transitions, 462 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-02-20 20:36:01,029 INFO L242 Difference]: Finished difference. Result has 104 places, 91 transitions, 262 flow [2022-02-20 20:36:01,029 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=262, PETRI_PLACES=104, PETRI_TRANSITIONS=91} [2022-02-20 20:36:01,030 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 13 predicate places. [2022-02-20 20:36:01,030 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 91 transitions, 262 flow [2022-02-20 20:36:01,537 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 17787 states, 17777 states have (on average 3.4059740113629973) internal successors, (60548), 17786 states have internal predecessors, (60548), 0 states have call successors, (0), 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:36:01,577 INFO L78 Accepts]: Start accepts. Automaton has has 17787 states, 17777 states have (on average 3.4059740113629973) internal successors, (60548), 17786 states have internal predecessors, (60548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 20:36:01,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:36:01,578 INFO L470 AbstractCegarLoop]: Abstraction has has 104 places, 91 transitions, 262 flow [2022-02-20 20:36:01,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 71.44444444444444) internal successors, (643), 9 states have internal predecessors, (643), 0 states have call successors, (0), 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:36:01,579 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:36:01,580 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] [2022-02-20 20:36:01,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:36:01,580 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 20:36:01,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:36:01,580 INFO L85 PathProgramCache]: Analyzing trace with hash -492590774, now seen corresponding path program 1 times [2022-02-20 20:36:01,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:36:01,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117104974] [2022-02-20 20:36:01,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:36:01,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:36:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:36:01,622 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:36:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:36:01,648 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 20:36:01,650 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:36:01,650 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-02-20 20:36:01,651 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-02-20 20:36:01,651 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2022-02-20 20:36:01,651 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining) [2022-02-20 20:36:01,651 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-02-20 20:36:01,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:36:01,652 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 20:36:01,655 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2022-02-20 20:36:01,656 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:36:01,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:36:01 BasicIcfg [2022-02-20 20:36:01,721 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:36:01,722 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:36:01,722 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:36:01,722 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:36:01,722 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:35:58" (3/4) ... [2022-02-20 20:36:01,723 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 20:36:01,807 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:36:01,807 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:36:01,811 INFO L158 Benchmark]: Toolchain (without parser) took 3647.06ms. Allocated memory was 111.1MB in the beginning and 178.3MB in the end (delta: 67.1MB). Free memory was 81.8MB in the beginning and 97.7MB in the end (delta: -15.9MB). Peak memory consumption was 115.1MB. Max. memory is 16.1GB. [2022-02-20 20:36:01,811 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 111.1MB. Free memory is still 67.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:36:01,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.09ms. Allocated memory is still 111.1MB. Free memory was 81.5MB in the beginning and 75.7MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 20:36:01,812 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.83ms. Allocated memory is still 111.1MB. Free memory was 75.7MB in the beginning and 73.7MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 20:36:01,812 INFO L158 Benchmark]: Boogie Preprocessor took 27.20ms. Allocated memory is still 111.1MB. Free memory was 73.7MB in the beginning and 72.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:36:01,814 INFO L158 Benchmark]: RCFGBuilder took 310.15ms. Allocated memory is still 111.1MB. Free memory was 72.0MB in the beginning and 59.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 20:36:01,814 INFO L158 Benchmark]: TraceAbstraction took 2749.17ms. Allocated memory was 111.1MB in the beginning and 178.3MB in the end (delta: 67.1MB). Free memory was 59.0MB in the beginning and 59.0MB in the end (delta: -38.1kB). Peak memory consumption was 68.5MB. Max. memory is 16.1GB. [2022-02-20 20:36:01,814 INFO L158 Benchmark]: Witness Printer took 86.79ms. Allocated memory is still 178.3MB. Free memory was 59.0MB in the beginning and 97.7MB in the end (delta: -38.7MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2022-02-20 20:36:01,815 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.20ms. Allocated memory is still 111.1MB. Free memory is still 67.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.09ms. Allocated memory is still 111.1MB. Free memory was 81.5MB in the beginning and 75.7MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.83ms. Allocated memory is still 111.1MB. Free memory was 75.7MB in the beginning and 73.7MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.20ms. Allocated memory is still 111.1MB. Free memory was 73.7MB in the beginning and 72.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 310.15ms. Allocated memory is still 111.1MB. Free memory was 72.0MB in the beginning and 59.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2749.17ms. Allocated memory was 111.1MB in the beginning and 178.3MB in the end (delta: 67.1MB). Free memory was 59.0MB in the beginning and 59.0MB in the end (delta: -38.1kB). Peak memory consumption was 68.5MB. Max. memory is 16.1GB. * Witness Printer took 86.79ms. Allocated memory is still 178.3MB. Free memory was 59.0MB in the beginning and 97.7MB in the end (delta: -38.7MB). Peak memory consumption was 24.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 - 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 - CounterExampleResult [Line: 690]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L697] 0 volatile int x; VAL [x=0] [L698] 0 volatile int n; VAL [n=0, x=0] [L710] 0 pthread_t t1, t2; VAL [\old(argc)=49, argc=49, argv={51:50}, argv={51:50}, n=0, t1={5:0}, t2={3:0}, x=0] [L711] 0 int i; VAL [\old(argc)=49, argc=49, argv={51:50}, argv={51:50}, n=0, t1={5:0}, t2={3:0}, x=0] [L712] 0 x = 0 VAL [\old(argc)=49, argc=49, argv={51:50}, argv={51:50}, n=0, t1={5:0}, t2={3:0}, x=0] [L713] 0 n = __VERIFIER_nondet_int() VAL [\old(argc)=49, __VERIFIER_nondet_int()=1, argc=49, argv={51:50}, argv={51:50}, n=1, t1={5:0}, t2={3:0}, x=0] [L714] CALL 0 assume_abort_if_not(n > 0) [L686] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, n=1, x=0] [L714] RET 0 assume_abort_if_not(n > 0) [L715] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\old(argc)=49, argc=49, argv={51:50}, argv={51:50}, n=1, pthread_create(&t1, 0, thr1, 0)=-1, t1={5:0}, t2={3:0}, x=0] [L700] CALL 1 __VERIFIER_assert(x < n) [L716] 0 i = 0 VAL [\old(argc)=49, argc=49, argv={51:50}, argv={51:50}, i=0, n=1, t1={5:0}, t2={3:0}, x=0] [L716] COND TRUE 0 i < n VAL [\old(argc)=49, argc=49, argv={51:50}, argv={51:50}, i=0, n=1, t1={5:0}, t2={3:0}, x=0] [L717] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\old(argc)=49, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, i=0, n=1, pthread_create(&t2, 0, thr2, 0)=0, t1={5:0}, t2={3:0}, x=0] [L704] 2 int t; VAL [arg={0:0}, arg={0:0}, n=1, x=0] [L705] 2 t = x VAL [arg={0:0}, arg={0:0}, n=1, t=0, x=0] [L706] 2 x = t + 1 VAL [arg={0:0}, arg={0:0}, n=1, t=0, x=1] [L689] COND TRUE 1 !(cond) VAL [\old(cond)=0, arg={0:0}, arg={0:0}, cond=0, n=1, t=0, x=1] [L690] 1 reach_error() VAL [\old(cond)=0, arg={0:0}, arg={0:0}, cond=0, n=1, t=0, x=1] - UnprovableResult [Line: 717]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 99 locations, 4 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.2s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 96 IncrementalHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 11 mSDtfsCounter, 96 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=1, InterpolantAutomatonStates: 11, 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.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 40 ConstructedInterpolants, 0 QuantifiedInterpolants, 164 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 119 locations, 5 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.3s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 95 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 94 IncrementalHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 14 mSDtfsCounter, 94 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=1, InterpolantAutomatonStates: 11, 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 40 ConstructedInterpolants, 0 QuantifiedInterpolants, 164 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 RESULT: Ultimate proved your program to be incorrect! [2022-02-20 20:36:01,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE