./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-sre-symm.wvr.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-sre-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c361ebc03d879240d418527d643e8a7b3c7ac084ceb3e66857b21a687a1c7f90 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:47:37,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:47:37,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:47:38,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:47:38,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:47:38,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:47:38,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:47:38,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:47:38,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:47:38,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:47:38,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:47:38,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:47:38,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:47:38,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:47:38,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:47:38,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:47:38,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:47:38,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:47:38,047 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:47:38,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:47:38,053 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:47:38,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:47:38,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:47:38,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:47:38,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:47:38,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:47:38,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:47:38,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:47:38,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:47:38,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:47:38,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:47:38,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:47:38,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:47:38,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:47:38,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:47:38,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:47:38,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:47:38,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:47:38,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:47:38,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:47:38,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:47:38,070 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:47:38,093 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:47:38,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:47:38,094 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:47:38,094 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:47:38,095 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:47:38,095 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:47:38,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:47:38,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:47:38,096 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:47:38,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:47:38,097 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:47:38,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:47:38,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:47:38,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:47:38,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:47:38,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:47:38,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:47:38,098 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:47:38,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:47:38,098 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:47:38,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:47:38,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:47:38,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:47:38,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:47:38,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:47:38,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:47:38,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:47:38,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:47:38,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:47:38,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:47:38,101 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:47:38,101 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:47:38,101 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:47:38,101 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 -> c361ebc03d879240d418527d643e8a7b3c7ac084ceb3e66857b21a687a1c7f90 [2022-02-20 20:47:38,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:47:38,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:47:38,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:47:38,328 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:47:38,333 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:47:38,334 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-sre-symm.wvr.c [2022-02-20 20:47:38,375 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02c9088ae/7c77116d926341c395ff98564497f909/FLAG542de6b25 [2022-02-20 20:47:38,746 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:47:38,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-sre-symm.wvr.c [2022-02-20 20:47:38,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02c9088ae/7c77116d926341c395ff98564497f909/FLAG542de6b25 [2022-02-20 20:47:39,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02c9088ae/7c77116d926341c395ff98564497f909 [2022-02-20 20:47:39,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:47:39,172 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:47:39,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:47:39,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:47:39,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:47:39,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:47:39" (1/1) ... [2022-02-20 20:47:39,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@164ece66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:47:39, skipping insertion in model container [2022-02-20 20:47:39,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:47:39" (1/1) ... [2022-02-20 20:47:39,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:47:39,201 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:47:39,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-sre-symm.wvr.c[2133,2146] [2022-02-20 20:47:39,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:47:39,341 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:47:39,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-sre-symm.wvr.c[2133,2146] [2022-02-20 20:47:39,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:47:39,371 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:47:39,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:47:39 WrapperNode [2022-02-20 20:47:39,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:47:39,373 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:47:39,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:47:39,373 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:47:39,377 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:47:39" (1/1) ... [2022-02-20 20:47:39,382 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:47:39" (1/1) ... [2022-02-20 20:47:39,395 INFO L137 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 60 [2022-02-20 20:47:39,395 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:47:39,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:47:39,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:47:39,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:47:39,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:47:39" (1/1) ... [2022-02-20 20:47:39,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:47:39" (1/1) ... [2022-02-20 20:47:39,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:47:39" (1/1) ... [2022-02-20 20:47:39,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:47:39" (1/1) ... [2022-02-20 20:47:39,408 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:47:39" (1/1) ... [2022-02-20 20:47:39,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:47:39" (1/1) ... [2022-02-20 20:47:39,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:47:39" (1/1) ... [2022-02-20 20:47:39,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:47:39,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:47:39,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:47:39,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:47:39,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:47:39" (1/1) ... [2022-02-20 20:47:39,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:47:39,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:47:39,436 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:47:39,453 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:47:39,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:47:39,477 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-02-20 20:47:39,478 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-02-20 20:47:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-02-20 20:47:39,478 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-02-20 20:47:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:47:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:47:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:47:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:47:39,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:47:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 20:47:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:47:39,480 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:47:39,531 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:47:39,533 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:47:39,752 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:47:39,758 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:47:39,763 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:47:39,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:47:39 BoogieIcfgContainer [2022-02-20 20:47:39,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:47:39,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:47:39,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:47:39,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:47:39,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:47:39" (1/3) ... [2022-02-20 20:47:39,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29eeacd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:47:39, skipping insertion in model container [2022-02-20 20:47:39,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:47:39" (2/3) ... [2022-02-20 20:47:39,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29eeacd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:47:39, skipping insertion in model container [2022-02-20 20:47:39,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:47:39" (3/3) ... [2022-02-20 20:47:39,772 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-sre-symm.wvr.c [2022-02-20 20:47:39,776 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:47:39,776 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:47:39,777 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:47:39,777 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:47:39,834 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,841 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,842 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,842 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,842 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,842 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,842 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,844 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,845 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,845 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,845 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,845 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,845 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,845 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,846 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,846 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,846 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,846 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,847 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,847 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,852 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,852 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,852 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,852 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,852 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,853 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,853 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,854 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,854 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,854 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,854 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,854 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,855 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,855 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,855 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,856 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,857 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,859 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,860 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,860 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,860 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,862 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,862 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,862 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,862 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:47:39,869 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-02-20 20:47:39,917 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:47:39,926 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:47:39,926 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 20:47:39,936 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 102 transitions, 220 flow [2022-02-20 20:47:39,972 INFO L129 PetriNetUnfolder]: 7/100 cut-off events. [2022-02-20 20:47:39,972 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-02-20 20:47:39,975 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 100 events. 7/100 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-02-20 20:47:39,975 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 102 transitions, 220 flow [2022-02-20 20:47:39,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 91 transitions, 194 flow [2022-02-20 20:47:39,993 INFO L129 PetriNetUnfolder]: 7/90 cut-off events. [2022-02-20 20:47:39,993 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-02-20 20:47:39,994 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:47:39,994 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:47:39,995 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:47:39,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:47:39,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1122200234, now seen corresponding path program 1 times [2022-02-20 20:47:40,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:47:40,005 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340392245] [2022-02-20 20:47:40,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:47:40,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:47:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:47:40,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#true} [209] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105#true} is VALID [2022-02-20 20:47:40,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} [184] 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] {105#true} is VALID [2022-02-20 20:47:40,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {105#true} [214] 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[] {105#true} is VALID [2022-02-20 20:47:40,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {105#true} [216] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {105#true} is VALID [2022-02-20 20:47:40,302 INFO L290 TraceCheckUtils]: 4: Hoare triple {105#true} [172] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {105#true} is VALID [2022-02-20 20:47:40,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {105#true} [201] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {105#true} is VALID [2022-02-20 20:47:40,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {105#true} [199] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {105#true} is VALID [2022-02-20 20:47:40,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {105#true} [154] L21-3-->L21-4: Formula: (and (= 19 (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[] {105#true} is VALID [2022-02-20 20:47:40,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {105#true} [223] L21-4-->L38: Formula: (= v_~result_2~0_2 0) InVars {} OutVars{~result_2~0=v_~result_2~0_2} AuxVars[] AssignedVars[~result_2~0] {105#true} is VALID [2022-02-20 20:47:40,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {105#true} [224] L38-->L39: Formula: (= v_~result_3~0_2 0) InVars {} OutVars{~result_3~0=v_~result_3~0_2} AuxVars[] AssignedVars[~result_3~0] {105#true} is VALID [2022-02-20 20:47:40,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {105#true} [203] L39-->L39-1: Formula: (= v_~sponsored_0~0_7 0) InVars {} OutVars{~sponsored_0~0=v_~sponsored_0~0_7} AuxVars[] AssignedVars[~sponsored_0~0] {105#true} is VALID [2022-02-20 20:47:40,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {105#true} [161] L39-1-->L-1-3: Formula: (= v_~sponsored_1~0_7 0) InVars {} OutVars{~sponsored_1~0=v_~sponsored_1~0_7} AuxVars[] AssignedVars[~sponsored_1~0] {105#true} is VALID [2022-02-20 20:47:40,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {105#true} [219] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105#true} is VALID [2022-02-20 20:47:40,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {105#true} [192] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105#true} is VALID [2022-02-20 20:47:40,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {105#true} [149] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {105#true} is VALID [2022-02-20 20:47:40,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {105#true} [190] L-1-6-->L54: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_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~mem11#1=|v_ULTIMATE.start_main_#t~mem11#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~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {105#true} is VALID [2022-02-20 20:47:40,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {105#true} [130] L54-->L54-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] {105#true} is VALID [2022-02-20 20:47:40,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {105#true} [162] L54-1-->L54-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] {105#true} is VALID [2022-02-20 20:47:40,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {105#true} [144] L54-2-->L57: Formula: (= v_~sponsored_0~0_8 |v_ULTIMATE.start_main_#t~nondet5#1_2|) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} OutVars{~sponsored_0~0=v_~sponsored_0~0_8, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[~sponsored_0~0] {105#true} is VALID [2022-02-20 20:47:40,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {105#true} [225] L57-->L58: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {105#true} is VALID [2022-02-20 20:47:40,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {105#true} [183] L58-->L58-1: Formula: (= v_~sponsored_1~0_8 |v_ULTIMATE.start_main_#t~nondet6#1_2|) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} OutVars{~sponsored_1~0=v_~sponsored_1~0_8, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[~sponsored_1~0] {105#true} is VALID [2022-02-20 20:47:40,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {105#true} [143] L58-1-->L61: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {105#true} is VALID [2022-02-20 20:47:40,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {105#true} [134] L61-->L61-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {105#true} is VALID [2022-02-20 20:47:40,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {105#true} [189] L61-1-->L61-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {105#true} is VALID [2022-02-20 20:47:40,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {105#true} [200] L61-2-->L61-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~pre7#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {105#true} is VALID [2022-02-20 20:47:40,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {105#true} [257] L61-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_10|, thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_10|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite1, thread1Thread1of1ForFork0_#t~ite2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] {105#true} is VALID [2022-02-20 20:47:40,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {105#true} [197] L61-4-->L61-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {105#true} is VALID [2022-02-20 20:47:40,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {105#true} [166] L61-5-->L62: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {105#true} is VALID [2022-02-20 20:47:40,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {105#true} [220] L62-->L62-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {105#true} is VALID [2022-02-20 20:47:40,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {105#true} [207] L62-1-->L62-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {105#true} is VALID [2022-02-20 20:47:40,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {105#true} [171] L62-2-->L62-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre9#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {105#true} is VALID [2022-02-20 20:47:40,313 INFO L290 TraceCheckUtils]: 31: Hoare triple {105#true} [259] L62-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_10|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_10|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~ite4, thread2Thread1of1ForFork1_#t~ite3, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] {105#true} is VALID [2022-02-20 20:47:40,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {105#true} [243] thread2ENTRY-->L48: Formula: (= (ite (not (= (mod v_~sponsored_0~0_4 256) 0)) 1 0) (ite (not (= (mod v_~sponsored_1~0_5 256) 0)) 1 0)) InVars {~sponsored_1~0=v_~sponsored_1~0_5, ~sponsored_0~0=v_~sponsored_0~0_4} OutVars{~sponsored_1~0=v_~sponsored_1~0_5, ~sponsored_0~0=v_~sponsored_0~0_4} AuxVars[] AssignedVars[] {105#true} is VALID [2022-02-20 20:47:40,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {105#true} [245] L48-->L48-7: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite4_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite4] {107#(= |thread2Thread1of1ForFork1_#t~ite4| 0)} is VALID [2022-02-20 20:47:40,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {107#(= |thread2Thread1of1ForFork1_#t~ite4| 0)} [248] L48-7-->L48-8: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite4_3| v_~result_3~0_1) InVars {thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_3|} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_3|, ~result_3~0=v_~result_3~0_1} AuxVars[] AssignedVars[~result_3~0] {108#(= ~result_3~0 0)} is VALID [2022-02-20 20:47:40,316 INFO L290 TraceCheckUtils]: 35: Hoare triple {108#(= ~result_3~0 0)} [251] L48-8-->L48-9: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite4] {108#(= ~result_3~0 0)} is VALID [2022-02-20 20:47:40,317 INFO L290 TraceCheckUtils]: 36: Hoare triple {108#(= ~result_3~0 0)} [253] L48-9-->L50: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite3] {108#(= ~result_3~0 0)} is VALID [2022-02-20 20:47:40,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {108#(= ~result_3~0 0)} [254] L50-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_1| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_1|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] {108#(= ~result_3~0 0)} is VALID [2022-02-20 20:47:40,318 INFO L290 TraceCheckUtils]: 38: Hoare triple {108#(= ~result_3~0 0)} [255] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108#(= ~result_3~0 0)} is VALID [2022-02-20 20:47:40,318 INFO L290 TraceCheckUtils]: 39: Hoare triple {108#(= ~result_3~0 0)} [230] thread1ENTRY-->L42: Formula: (= (ite (not (= (mod v_~sponsored_0~0_1 256) 0)) 1 0) (ite (not (= (mod v_~sponsored_1~0_1 256) 0)) 1 0)) InVars {~sponsored_0~0=v_~sponsored_0~0_1, ~sponsored_1~0=v_~sponsored_1~0_1} OutVars{~sponsored_0~0=v_~sponsored_0~0_1, ~sponsored_1~0=v_~sponsored_1~0_1} AuxVars[] AssignedVars[] {108#(= ~result_3~0 0)} is VALID [2022-02-20 20:47:40,319 INFO L290 TraceCheckUtils]: 40: Hoare triple {108#(= ~result_3~0 0)} [232] L42-->L42-7: Formula: (= |v_thread1Thread1of1ForFork0_#t~ite2_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite2] {109#(and (= ~result_3~0 0) (= |thread1Thread1of1ForFork0_#t~ite2| 0))} is VALID [2022-02-20 20:47:40,320 INFO L290 TraceCheckUtils]: 41: Hoare triple {109#(and (= ~result_3~0 0) (= |thread1Thread1of1ForFork0_#t~ite2| 0))} [235] L42-7-->L42-8: Formula: (= v_~result_2~0_1 |v_thread1Thread1of1ForFork0_#t~ite2_3|) InVars {thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_3|} OutVars{thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_3|, ~result_2~0=v_~result_2~0_1} AuxVars[] AssignedVars[~result_2~0] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,321 INFO L290 TraceCheckUtils]: 42: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [238] L42-8-->L42-9: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite2] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,321 INFO L290 TraceCheckUtils]: 43: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [240] L42-9-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite1] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,322 INFO L290 TraceCheckUtils]: 44: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [241] L44-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,322 INFO L290 TraceCheckUtils]: 45: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [242] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,323 INFO L290 TraceCheckUtils]: 46: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [142] L62-4-->L62-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,324 INFO L290 TraceCheckUtils]: 47: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [222] L62-5-->L63: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,325 INFO L290 TraceCheckUtils]: 48: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [135] L63-->L63-1: Formula: (= |v_ULTIMATE.start_main_#t~mem11#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_2|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,328 INFO L290 TraceCheckUtils]: 49: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [260] thread1EXIT-->L63-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,329 INFO L290 TraceCheckUtils]: 50: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [156] L63-2-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,330 INFO L290 TraceCheckUtils]: 51: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [158] L64-->L64-1: Formula: (= (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) |v_ULTIMATE.start_main_#t~mem12#1_2|) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,331 INFO L290 TraceCheckUtils]: 52: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [261] thread2EXIT-->L64-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem12#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,332 INFO L290 TraceCheckUtils]: 53: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [228] L64-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,332 INFO L290 TraceCheckUtils]: 54: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [177] L66-->L66-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,333 INFO L290 TraceCheckUtils]: 55: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [217] L66-1-->L66-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (and (< 0 v_~result_3~0_3) (< v_~result_2~0_3 0))) 1 0)) InVars {~result_3~0=v_~result_3~0_3, ~result_2~0=v_~result_2~0_3} OutVars{~result_3~0=v_~result_3~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|, ~result_2~0=v_~result_2~0_3} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,335 INFO L290 TraceCheckUtils]: 56: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [186] L66-2-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,336 INFO L290 TraceCheckUtils]: 57: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [170] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,337 INFO L290 TraceCheckUtils]: 58: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [205] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,338 INFO L290 TraceCheckUtils]: 59: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [193] L34-1-->L67: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,338 INFO L290 TraceCheckUtils]: 60: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [208] L67-->L67-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,339 INFO L290 TraceCheckUtils]: 61: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [167] L67-1-->L67-2: Formula: (= (ite (not (and (< v_~result_3~0_4 0) (< 0 v_~result_2~0_4))) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {~result_3~0=v_~result_3~0_4, ~result_2~0=v_~result_2~0_4} OutVars{~result_3~0=v_~result_3~0_4, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|, ~result_2~0=v_~result_2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,339 INFO L290 TraceCheckUtils]: 62: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [146] L67-2-->L34-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,340 INFO L290 TraceCheckUtils]: 63: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [185] L34-2-->L35-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,341 INFO L290 TraceCheckUtils]: 64: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [141] L35-3-->L34-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,342 INFO L290 TraceCheckUtils]: 65: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [153] L34-3-->L68: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,342 INFO L290 TraceCheckUtils]: 66: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [212] L68-->L68-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} is VALID [2022-02-20 20:47:40,343 INFO L290 TraceCheckUtils]: 67: Hoare triple {110#(and (= ~result_3~0 0) (= ~result_2~0 0))} [164] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (not (and (= v_~result_3~0_5 0) (= v_~result_2~0_5 0))) 1 0)) InVars {~result_3~0=v_~result_3~0_5, ~result_2~0=v_~result_2~0_5} OutVars{~result_3~0=v_~result_3~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|, ~result_2~0=v_~result_2~0_5} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {111#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:47:40,344 INFO L290 TraceCheckUtils]: 68: Hoare triple {111#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [138] L68-2-->L34-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {111#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:47:40,344 INFO L290 TraceCheckUtils]: 69: Hoare triple {111#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [131] L34-4-->L35-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {112#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:47:40,345 INFO L290 TraceCheckUtils]: 70: Hoare triple {112#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [227] L35-6-->L34-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] {106#false} is VALID [2022-02-20 20:47:40,345 INFO L290 TraceCheckUtils]: 71: Hoare triple {106#false} [168] L34-5-->L69: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#false} is VALID [2022-02-20 20:47:40,345 INFO L290 TraceCheckUtils]: 72: Hoare triple {106#false} [147] L69-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#false} is VALID [2022-02-20 20:47:40,348 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:47:40,348 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:47:40,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340392245] [2022-02-20 20:47:40,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340392245] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:47:40,349 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:47:40,349 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:47:40,351 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844363943] [2022-02-20 20:47:40,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:47:40,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2022-02-20 20:47:40,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:47:40,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 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:47:40,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:47:40,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:47:40,451 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:47:40,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:47:40,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:47:40,467 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 102 [2022-02-20 20:47:40,470 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 91 transitions, 194 flow. Second operand has 8 states, 8 states have (on average 72.0) internal successors, (576), 8 states have internal predecessors, (576), 0 states have call successors, (0), 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:47:40,470 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:47:40,470 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 102 [2022-02-20 20:47:40,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:47:40,801 INFO L129 PetriNetUnfolder]: 55/294 cut-off events. [2022-02-20 20:47:40,801 INFO L130 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2022-02-20 20:47:40,803 INFO L84 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 294 events. 55/294 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1134 event pairs, 11 based on Foata normal form. 9/287 useless extension candidates. Maximal degree in co-relation 265. Up to 44 conditions per place. [2022-02-20 20:47:40,807 INFO L132 encePairwiseOnDemand]: 86/102 looper letters, 52 selfloop transitions, 10 changer transitions 34/155 dead transitions. [2022-02-20 20:47:40,807 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 155 transitions, 541 flow [2022-02-20 20:47:40,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 20:47:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-02-20 20:47:40,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1141 transitions. [2022-02-20 20:47:40,833 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7457516339869281 [2022-02-20 20:47:40,834 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1141 transitions. [2022-02-20 20:47:40,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1141 transitions. [2022-02-20 20:47:40,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:47:40,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1141 transitions. [2022-02-20 20:47:40,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 76.06666666666666) internal successors, (1141), 15 states have internal predecessors, (1141), 0 states have call successors, (0), 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:47:40,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 102.0) internal successors, (1632), 16 states have internal predecessors, (1632), 0 states have call successors, (0), 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:47:40,845 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 102.0) internal successors, (1632), 16 states have internal predecessors, (1632), 0 states have call successors, (0), 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:47:40,846 INFO L186 Difference]: Start difference. First operand has 91 places, 91 transitions, 194 flow. Second operand 15 states and 1141 transitions. [2022-02-20 20:47:40,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 155 transitions, 541 flow [2022-02-20 20:47:40,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 155 transitions, 515 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-02-20 20:47:40,852 INFO L242 Difference]: Finished difference. Result has 111 places, 93 transitions, 253 flow [2022-02-20 20:47:40,853 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=253, PETRI_PLACES=111, PETRI_TRANSITIONS=93} [2022-02-20 20:47:40,856 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 20 predicate places. [2022-02-20 20:47:40,856 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 111 places, 93 transitions, 253 flow [2022-02-20 20:47:40,927 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1406 states, 1402 states have (on average 2.564194008559201) internal successors, (3595), 1405 states have internal predecessors, (3595), 0 states have call successors, (0), 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:47:40,932 INFO L78 Accepts]: Start accepts. Automaton has has 1406 states, 1402 states have (on average 2.564194008559201) internal successors, (3595), 1405 states have internal predecessors, (3595), 0 states have call successors, (0), 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 73 [2022-02-20 20:47:40,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:47:40,932 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 93 transitions, 253 flow [2022-02-20 20:47:40,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 72.0) internal successors, (576), 8 states have internal predecessors, (576), 0 states have call successors, (0), 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:47:40,933 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:47:40,933 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:47:40,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:47:40,934 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:47:40,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:47:40,935 INFO L85 PathProgramCache]: Analyzing trace with hash 697994717, now seen corresponding path program 1 times [2022-02-20 20:47:40,935 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:47:40,935 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078393172] [2022-02-20 20:47:40,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:47:40,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:47:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:47:41,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {1550#true} [209] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-02-20 20:47:41,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#true} [184] 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] {1550#true} is VALID [2022-02-20 20:47:41,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} [214] 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[] {1550#true} is VALID [2022-02-20 20:47:41,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {1550#true} [216] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-02-20 20:47:41,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {1550#true} [172] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-02-20 20:47:41,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {1550#true} [201] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-02-20 20:47:41,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {1550#true} [199] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-02-20 20:47:41,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {1550#true} [154] L21-3-->L21-4: Formula: (and (= 19 (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[] {1550#true} is VALID [2022-02-20 20:47:41,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {1550#true} [223] L21-4-->L38: Formula: (= v_~result_2~0_2 0) InVars {} OutVars{~result_2~0=v_~result_2~0_2} AuxVars[] AssignedVars[~result_2~0] {1550#true} is VALID [2022-02-20 20:47:41,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {1550#true} [224] L38-->L39: Formula: (= v_~result_3~0_2 0) InVars {} OutVars{~result_3~0=v_~result_3~0_2} AuxVars[] AssignedVars[~result_3~0] {1550#true} is VALID [2022-02-20 20:47:41,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {1550#true} [203] L39-->L39-1: Formula: (= v_~sponsored_0~0_7 0) InVars {} OutVars{~sponsored_0~0=v_~sponsored_0~0_7} AuxVars[] AssignedVars[~sponsored_0~0] {1550#true} is VALID [2022-02-20 20:47:41,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {1550#true} [161] L39-1-->L-1-3: Formula: (= v_~sponsored_1~0_7 0) InVars {} OutVars{~sponsored_1~0=v_~sponsored_1~0_7} AuxVars[] AssignedVars[~sponsored_1~0] {1550#true} is VALID [2022-02-20 20:47:41,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {1550#true} [219] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-02-20 20:47:41,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {1550#true} [192] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-02-20 20:47:41,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {1550#true} [149] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {1550#true} is VALID [2022-02-20 20:47:41,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {1550#true} [190] L-1-6-->L54: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_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~mem11#1=|v_ULTIMATE.start_main_#t~mem11#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~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {1550#true} is VALID [2022-02-20 20:47:41,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {1550#true} [130] L54-->L54-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] {1550#true} is VALID [2022-02-20 20:47:41,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {1550#true} [162] L54-1-->L54-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] {1550#true} is VALID [2022-02-20 20:47:41,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {1550#true} [144] L54-2-->L57: Formula: (= v_~sponsored_0~0_8 |v_ULTIMATE.start_main_#t~nondet5#1_2|) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} OutVars{~sponsored_0~0=v_~sponsored_0~0_8, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[~sponsored_0~0] {1550#true} is VALID [2022-02-20 20:47:41,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {1550#true} [225] L57-->L58: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {1550#true} is VALID [2022-02-20 20:47:41,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {1550#true} [183] L58-->L58-1: Formula: (= v_~sponsored_1~0_8 |v_ULTIMATE.start_main_#t~nondet6#1_2|) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} OutVars{~sponsored_1~0=v_~sponsored_1~0_8, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[~sponsored_1~0] {1550#true} is VALID [2022-02-20 20:47:41,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {1550#true} [143] L58-1-->L61: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {1550#true} is VALID [2022-02-20 20:47:41,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {1550#true} [134] L61-->L61-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {1550#true} is VALID [2022-02-20 20:47:41,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {1550#true} [189] L61-1-->L61-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {1550#true} is VALID [2022-02-20 20:47:41,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {1550#true} [200] L61-2-->L61-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~pre7#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {1550#true} is VALID [2022-02-20 20:47:41,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {1550#true} [257] L61-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_10|, thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_10|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite1, thread1Thread1of1ForFork0_#t~ite2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] {1550#true} is VALID [2022-02-20 20:47:41,036 INFO L290 TraceCheckUtils]: 26: Hoare triple {1550#true} [197] L61-4-->L61-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {1550#true} is VALID [2022-02-20 20:47:41,036 INFO L290 TraceCheckUtils]: 27: Hoare triple {1550#true} [166] L61-5-->L62: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {1550#true} is VALID [2022-02-20 20:47:41,036 INFO L290 TraceCheckUtils]: 28: Hoare triple {1550#true} [220] L62-->L62-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {1550#true} is VALID [2022-02-20 20:47:41,037 INFO L290 TraceCheckUtils]: 29: Hoare triple {1550#true} [207] L62-1-->L62-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {1550#true} is VALID [2022-02-20 20:47:41,037 INFO L290 TraceCheckUtils]: 30: Hoare triple {1550#true} [171] L62-2-->L62-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre9#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {1550#true} is VALID [2022-02-20 20:47:41,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {1550#true} [259] L62-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_10|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_10|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~ite4, thread2Thread1of1ForFork1_#t~ite3, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] {1550#true} is VALID [2022-02-20 20:47:41,039 INFO L290 TraceCheckUtils]: 32: Hoare triple {1550#true} [142] L62-4-->L62-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {1550#true} is VALID [2022-02-20 20:47:41,039 INFO L290 TraceCheckUtils]: 33: Hoare triple {1550#true} [222] L62-5-->L63: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] {1550#true} is VALID [2022-02-20 20:47:41,040 INFO L290 TraceCheckUtils]: 34: Hoare triple {1550#true} [135] L63-->L63-1: Formula: (= |v_ULTIMATE.start_main_#t~mem11#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_2|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {1550#true} is VALID [2022-02-20 20:47:41,041 INFO L290 TraceCheckUtils]: 35: Hoare triple {1550#true} [231] thread1ENTRY-->L42-2: Formula: (not (= (ite (not (= (mod v_~sponsored_0~0_2 256) 0)) 1 0) (ite (not (= (mod v_~sponsored_1~0_2 256) 0)) 1 0))) InVars {~sponsored_0~0=v_~sponsored_0~0_2, ~sponsored_1~0=v_~sponsored_1~0_2} OutVars{~sponsored_0~0=v_~sponsored_0~0_2, ~sponsored_1~0=v_~sponsored_1~0_2} AuxVars[] AssignedVars[] {1552#(and (or (not (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0)) (not (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0))) (or (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0) (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0)))} is VALID [2022-02-20 20:47:41,041 INFO L290 TraceCheckUtils]: 36: Hoare triple {1552#(and (or (not (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0)) (not (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0))) (or (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0) (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0)))} [233] L42-2-->L42-3: Formula: (not (= (mod v_~sponsored_1~0_3 256) 0)) InVars {~sponsored_1~0=v_~sponsored_1~0_3} OutVars{~sponsored_1~0=v_~sponsored_1~0_3} AuxVars[] AssignedVars[] {1552#(and (or (not (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0)) (not (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0))) (or (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0) (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0)))} is VALID [2022-02-20 20:47:41,042 INFO L290 TraceCheckUtils]: 37: Hoare triple {1552#(and (or (not (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0)) (not (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0))) (or (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0) (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0)))} [236] L42-3-->L42-6: Formula: (= (- 1) |v_thread1Thread1of1ForFork0_#t~ite1_1|) InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite1] {1552#(and (or (not (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0)) (not (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0))) (or (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0) (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0)))} is VALID [2022-02-20 20:47:41,043 INFO L290 TraceCheckUtils]: 38: Hoare triple {1552#(and (or (not (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0)) (not (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0))) (or (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0) (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0)))} [243] thread2ENTRY-->L48: Formula: (= (ite (not (= (mod v_~sponsored_0~0_4 256) 0)) 1 0) (ite (not (= (mod v_~sponsored_1~0_5 256) 0)) 1 0)) InVars {~sponsored_1~0=v_~sponsored_1~0_5, ~sponsored_0~0=v_~sponsored_0~0_4} OutVars{~sponsored_1~0=v_~sponsored_1~0_5, ~sponsored_0~0=v_~sponsored_0~0_4} AuxVars[] AssignedVars[] {1551#false} is VALID [2022-02-20 20:47:41,043 INFO L290 TraceCheckUtils]: 39: Hoare triple {1551#false} [245] L48-->L48-7: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite4_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite4] {1551#false} is VALID [2022-02-20 20:47:41,044 INFO L290 TraceCheckUtils]: 40: Hoare triple {1551#false} [248] L48-7-->L48-8: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite4_3| v_~result_3~0_1) InVars {thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_3|} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_3|, ~result_3~0=v_~result_3~0_1} AuxVars[] AssignedVars[~result_3~0] {1551#false} is VALID [2022-02-20 20:47:41,044 INFO L290 TraceCheckUtils]: 41: Hoare triple {1551#false} [251] L48-8-->L48-9: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite4] {1551#false} is VALID [2022-02-20 20:47:41,045 INFO L290 TraceCheckUtils]: 42: Hoare triple {1551#false} [239] L42-6-->L42-7: Formula: (= |v_thread1Thread1of1ForFork0_#t~ite2_7| |v_thread1Thread1of1ForFork0_#t~ite1_5|) InVars {thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_5|} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_5|, thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite2] {1551#false} is VALID [2022-02-20 20:47:41,045 INFO L290 TraceCheckUtils]: 43: Hoare triple {1551#false} [235] L42-7-->L42-8: Formula: (= v_~result_2~0_1 |v_thread1Thread1of1ForFork0_#t~ite2_3|) InVars {thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_3|} OutVars{thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_3|, ~result_2~0=v_~result_2~0_1} AuxVars[] AssignedVars[~result_2~0] {1551#false} is VALID [2022-02-20 20:47:41,046 INFO L290 TraceCheckUtils]: 44: Hoare triple {1551#false} [238] L42-8-->L42-9: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite2] {1551#false} is VALID [2022-02-20 20:47:41,046 INFO L290 TraceCheckUtils]: 45: Hoare triple {1551#false} [240] L42-9-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite1] {1551#false} is VALID [2022-02-20 20:47:41,053 INFO L290 TraceCheckUtils]: 46: Hoare triple {1551#false} [241] L44-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] {1551#false} is VALID [2022-02-20 20:47:41,054 INFO L290 TraceCheckUtils]: 47: Hoare triple {1551#false} [242] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#false} is VALID [2022-02-20 20:47:41,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {1551#false} [260] thread1EXIT-->L63-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {1551#false} is VALID [2022-02-20 20:47:41,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {1551#false} [156] L63-2-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {1551#false} is VALID [2022-02-20 20:47:41,057 INFO L290 TraceCheckUtils]: 50: Hoare triple {1551#false} [158] L64-->L64-1: Formula: (= (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) |v_ULTIMATE.start_main_#t~mem12#1_2|) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {1551#false} is VALID [2022-02-20 20:47:41,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {1551#false} [253] L48-9-->L50: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite3] {1551#false} is VALID [2022-02-20 20:47:41,057 INFO L290 TraceCheckUtils]: 52: Hoare triple {1551#false} [254] L50-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_1| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_1|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] {1551#false} is VALID [2022-02-20 20:47:41,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {1551#false} [255] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#false} is VALID [2022-02-20 20:47:41,058 INFO L290 TraceCheckUtils]: 54: Hoare triple {1551#false} [261] thread2EXIT-->L64-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem12#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {1551#false} is VALID [2022-02-20 20:47:41,058 INFO L290 TraceCheckUtils]: 55: Hoare triple {1551#false} [228] L64-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {1551#false} is VALID [2022-02-20 20:47:41,058 INFO L290 TraceCheckUtils]: 56: Hoare triple {1551#false} [177] L66-->L66-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#false} is VALID [2022-02-20 20:47:41,058 INFO L290 TraceCheckUtils]: 57: Hoare triple {1551#false} [217] L66-1-->L66-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (and (< 0 v_~result_3~0_3) (< v_~result_2~0_3 0))) 1 0)) InVars {~result_3~0=v_~result_3~0_3, ~result_2~0=v_~result_2~0_3} OutVars{~result_3~0=v_~result_3~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|, ~result_2~0=v_~result_2~0_3} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {1551#false} is VALID [2022-02-20 20:47:41,058 INFO L290 TraceCheckUtils]: 58: Hoare triple {1551#false} [186] L66-2-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {1551#false} is VALID [2022-02-20 20:47:41,058 INFO L290 TraceCheckUtils]: 59: Hoare triple {1551#false} [170] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {1551#false} is VALID [2022-02-20 20:47:41,059 INFO L290 TraceCheckUtils]: 60: Hoare triple {1551#false} [205] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {1551#false} is VALID [2022-02-20 20:47:41,059 INFO L290 TraceCheckUtils]: 61: Hoare triple {1551#false} [193] L34-1-->L67: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#false} is VALID [2022-02-20 20:47:41,059 INFO L290 TraceCheckUtils]: 62: Hoare triple {1551#false} [208] L67-->L67-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#false} is VALID [2022-02-20 20:47:41,060 INFO L290 TraceCheckUtils]: 63: Hoare triple {1551#false} [167] L67-1-->L67-2: Formula: (= (ite (not (and (< v_~result_3~0_4 0) (< 0 v_~result_2~0_4))) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {~result_3~0=v_~result_3~0_4, ~result_2~0=v_~result_2~0_4} OutVars{~result_3~0=v_~result_3~0_4, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|, ~result_2~0=v_~result_2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {1551#false} is VALID [2022-02-20 20:47:41,060 INFO L290 TraceCheckUtils]: 64: Hoare triple {1551#false} [146] L67-2-->L34-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {1551#false} is VALID [2022-02-20 20:47:41,060 INFO L290 TraceCheckUtils]: 65: Hoare triple {1551#false} [185] L34-2-->L35-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {1551#false} is VALID [2022-02-20 20:47:41,060 INFO L290 TraceCheckUtils]: 66: Hoare triple {1551#false} [141] L35-3-->L34-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] {1551#false} is VALID [2022-02-20 20:47:41,060 INFO L290 TraceCheckUtils]: 67: Hoare triple {1551#false} [153] L34-3-->L68: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#false} is VALID [2022-02-20 20:47:41,060 INFO L290 TraceCheckUtils]: 68: Hoare triple {1551#false} [212] L68-->L68-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#false} is VALID [2022-02-20 20:47:41,061 INFO L290 TraceCheckUtils]: 69: Hoare triple {1551#false} [164] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (not (and (= v_~result_3~0_5 0) (= v_~result_2~0_5 0))) 1 0)) InVars {~result_3~0=v_~result_3~0_5, ~result_2~0=v_~result_2~0_5} OutVars{~result_3~0=v_~result_3~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|, ~result_2~0=v_~result_2~0_5} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {1551#false} is VALID [2022-02-20 20:47:41,061 INFO L290 TraceCheckUtils]: 70: Hoare triple {1551#false} [138] L68-2-->L34-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {1551#false} is VALID [2022-02-20 20:47:41,061 INFO L290 TraceCheckUtils]: 71: Hoare triple {1551#false} [131] L34-4-->L35-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {1551#false} is VALID [2022-02-20 20:47:41,061 INFO L290 TraceCheckUtils]: 72: Hoare triple {1551#false} [227] L35-6-->L34-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] {1551#false} is VALID [2022-02-20 20:47:41,061 INFO L290 TraceCheckUtils]: 73: Hoare triple {1551#false} [168] L34-5-->L69: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#false} is VALID [2022-02-20 20:47:41,062 INFO L290 TraceCheckUtils]: 74: Hoare triple {1551#false} [147] L69-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#false} is VALID [2022-02-20 20:47:41,062 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:47:41,063 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:47:41,063 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078393172] [2022-02-20 20:47:41,063 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078393172] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:47:41,064 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:47:41,064 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:47:41,064 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931482512] [2022-02-20 20:47:41,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:47:41,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2022-02-20 20:47:41,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:47:41,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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:47:41,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:47:41,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:47:41,124 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:47:41,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:47:41,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:47:41,125 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 102 [2022-02-20 20:47:41,126 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 93 transitions, 253 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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:47:41,126 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:47:41,126 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 102 [2022-02-20 20:47:41,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:47:41,219 INFO L129 PetriNetUnfolder]: 41/290 cut-off events. [2022-02-20 20:47:41,219 INFO L130 PetriNetUnfolder]: For 107/112 co-relation queries the response was YES. [2022-02-20 20:47:41,228 INFO L84 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 290 events. 41/290 cut-off events. For 107/112 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1157 event pairs, 13 based on Foata normal form. 2/262 useless extension candidates. Maximal degree in co-relation 482. Up to 52 conditions per place. [2022-02-20 20:47:41,229 INFO L132 encePairwiseOnDemand]: 98/102 looper letters, 18 selfloop transitions, 2 changer transitions 1/98 dead transitions. [2022-02-20 20:47:41,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 98 transitions, 308 flow [2022-02-20 20:47:41,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:47:41,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:47:41,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2022-02-20 20:47:41,232 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8790849673202614 [2022-02-20 20:47:41,232 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 269 transitions. [2022-02-20 20:47:41,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 269 transitions. [2022-02-20 20:47:41,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:47:41,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 269 transitions. [2022-02-20 20:47:41,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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:47:41,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 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:47:41,234 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 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:47:41,234 INFO L186 Difference]: Start difference. First operand has 111 places, 93 transitions, 253 flow. Second operand 3 states and 269 transitions. [2022-02-20 20:47:41,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 98 transitions, 308 flow [2022-02-20 20:47:41,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 98 transitions, 297 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-02-20 20:47:41,341 INFO L242 Difference]: Finished difference. Result has 100 places, 95 transitions, 262 flow [2022-02-20 20:47:41,342 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=100, PETRI_TRANSITIONS=95} [2022-02-20 20:47:41,342 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 9 predicate places. [2022-02-20 20:47:41,342 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 100 places, 95 transitions, 262 flow [2022-02-20 20:47:41,374 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1406 states, 1402 states have (on average 2.5049928673323825) internal successors, (3512), 1405 states have internal predecessors, (3512), 0 states have call successors, (0), 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:47:41,377 INFO L78 Accepts]: Start accepts. Automaton has has 1406 states, 1402 states have (on average 2.5049928673323825) internal successors, (3512), 1405 states have internal predecessors, (3512), 0 states have call successors, (0), 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 75 [2022-02-20 20:47:41,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:47:41,378 INFO L470 AbstractCegarLoop]: Abstraction has has 100 places, 95 transitions, 262 flow [2022-02-20 20:47:41,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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:47:41,378 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:47:41,378 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:47:41,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:47:41,379 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:47:41,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:47:41,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1049557055, now seen corresponding path program 2 times [2022-02-20 20:47:41,379 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:47:41,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048362547] [2022-02-20 20:47:41,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:47:41,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:47:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:47:41,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {2963#true} [209] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2963#true} is VALID [2022-02-20 20:47:41,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {2963#true} [184] 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] {2963#true} is VALID [2022-02-20 20:47:41,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {2963#true} [214] 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[] {2963#true} is VALID [2022-02-20 20:47:41,433 INFO L290 TraceCheckUtils]: 3: Hoare triple {2963#true} [216] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {2963#true} is VALID [2022-02-20 20:47:41,433 INFO L290 TraceCheckUtils]: 4: Hoare triple {2963#true} [172] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {2963#true} is VALID [2022-02-20 20:47:41,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {2963#true} [201] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {2963#true} is VALID [2022-02-20 20:47:41,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {2963#true} [199] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {2963#true} is VALID [2022-02-20 20:47:41,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {2963#true} [154] L21-3-->L21-4: Formula: (and (= 19 (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[] {2963#true} is VALID [2022-02-20 20:47:41,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {2963#true} [223] L21-4-->L38: Formula: (= v_~result_2~0_2 0) InVars {} OutVars{~result_2~0=v_~result_2~0_2} AuxVars[] AssignedVars[~result_2~0] {2963#true} is VALID [2022-02-20 20:47:41,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {2963#true} [224] L38-->L39: Formula: (= v_~result_3~0_2 0) InVars {} OutVars{~result_3~0=v_~result_3~0_2} AuxVars[] AssignedVars[~result_3~0] {2963#true} is VALID [2022-02-20 20:47:41,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {2963#true} [203] L39-->L39-1: Formula: (= v_~sponsored_0~0_7 0) InVars {} OutVars{~sponsored_0~0=v_~sponsored_0~0_7} AuxVars[] AssignedVars[~sponsored_0~0] {2963#true} is VALID [2022-02-20 20:47:41,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {2963#true} [161] L39-1-->L-1-3: Formula: (= v_~sponsored_1~0_7 0) InVars {} OutVars{~sponsored_1~0=v_~sponsored_1~0_7} AuxVars[] AssignedVars[~sponsored_1~0] {2963#true} is VALID [2022-02-20 20:47:41,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {2963#true} [219] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2963#true} is VALID [2022-02-20 20:47:41,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {2963#true} [192] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2963#true} is VALID [2022-02-20 20:47:41,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {2963#true} [149] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {2963#true} is VALID [2022-02-20 20:47:41,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {2963#true} [190] L-1-6-->L54: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_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~mem11#1=|v_ULTIMATE.start_main_#t~mem11#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~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {2963#true} is VALID [2022-02-20 20:47:41,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {2963#true} [130] L54-->L54-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] {2963#true} is VALID [2022-02-20 20:47:41,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {2963#true} [162] L54-1-->L54-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] {2963#true} is VALID [2022-02-20 20:47:41,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {2963#true} [144] L54-2-->L57: Formula: (= v_~sponsored_0~0_8 |v_ULTIMATE.start_main_#t~nondet5#1_2|) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} OutVars{~sponsored_0~0=v_~sponsored_0~0_8, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[~sponsored_0~0] {2963#true} is VALID [2022-02-20 20:47:41,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {2963#true} [225] L57-->L58: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {2963#true} is VALID [2022-02-20 20:47:41,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {2963#true} [183] L58-->L58-1: Formula: (= v_~sponsored_1~0_8 |v_ULTIMATE.start_main_#t~nondet6#1_2|) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} OutVars{~sponsored_1~0=v_~sponsored_1~0_8, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[~sponsored_1~0] {2963#true} is VALID [2022-02-20 20:47:41,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {2963#true} [143] L58-1-->L61: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {2963#true} is VALID [2022-02-20 20:47:41,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {2963#true} [134] L61-->L61-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {2963#true} is VALID [2022-02-20 20:47:41,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {2963#true} [189] L61-1-->L61-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {2963#true} is VALID [2022-02-20 20:47:41,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {2963#true} [200] L61-2-->L61-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~pre7#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {2963#true} is VALID [2022-02-20 20:47:41,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {2963#true} [257] L61-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_10|, thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_10|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite1, thread1Thread1of1ForFork0_#t~ite2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] {2963#true} is VALID [2022-02-20 20:47:41,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {2963#true} [197] L61-4-->L61-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {2963#true} is VALID [2022-02-20 20:47:41,437 INFO L290 TraceCheckUtils]: 27: Hoare triple {2963#true} [166] L61-5-->L62: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {2963#true} is VALID [2022-02-20 20:47:41,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {2963#true} [220] L62-->L62-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {2963#true} is VALID [2022-02-20 20:47:41,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {2963#true} [207] L62-1-->L62-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {2963#true} is VALID [2022-02-20 20:47:41,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {2963#true} [171] L62-2-->L62-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre9#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {2963#true} is VALID [2022-02-20 20:47:41,437 INFO L290 TraceCheckUtils]: 31: Hoare triple {2963#true} [259] L62-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_10|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_10|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~ite4, thread2Thread1of1ForFork1_#t~ite3, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] {2963#true} is VALID [2022-02-20 20:47:41,438 INFO L290 TraceCheckUtils]: 32: Hoare triple {2963#true} [243] thread2ENTRY-->L48: Formula: (= (ite (not (= (mod v_~sponsored_0~0_4 256) 0)) 1 0) (ite (not (= (mod v_~sponsored_1~0_5 256) 0)) 1 0)) InVars {~sponsored_1~0=v_~sponsored_1~0_5, ~sponsored_0~0=v_~sponsored_0~0_4} OutVars{~sponsored_1~0=v_~sponsored_1~0_5, ~sponsored_0~0=v_~sponsored_0~0_4} AuxVars[] AssignedVars[] {2965#(or (and (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0) (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0)) (and (not (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0)) (not (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0))))} is VALID [2022-02-20 20:47:41,439 INFO L290 TraceCheckUtils]: 33: Hoare triple {2965#(or (and (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0) (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0)) (and (not (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0)) (not (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0))))} [231] thread1ENTRY-->L42-2: Formula: (not (= (ite (not (= (mod v_~sponsored_0~0_2 256) 0)) 1 0) (ite (not (= (mod v_~sponsored_1~0_2 256) 0)) 1 0))) InVars {~sponsored_0~0=v_~sponsored_0~0_2, ~sponsored_1~0=v_~sponsored_1~0_2} OutVars{~sponsored_0~0=v_~sponsored_0~0_2, ~sponsored_1~0=v_~sponsored_1~0_2} AuxVars[] AssignedVars[] {2964#false} is VALID [2022-02-20 20:47:41,439 INFO L290 TraceCheckUtils]: 34: Hoare triple {2964#false} [233] L42-2-->L42-3: Formula: (not (= (mod v_~sponsored_1~0_3 256) 0)) InVars {~sponsored_1~0=v_~sponsored_1~0_3} OutVars{~sponsored_1~0=v_~sponsored_1~0_3} AuxVars[] AssignedVars[] {2964#false} is VALID [2022-02-20 20:47:41,439 INFO L290 TraceCheckUtils]: 35: Hoare triple {2964#false} [236] L42-3-->L42-6: Formula: (= (- 1) |v_thread1Thread1of1ForFork0_#t~ite1_1|) InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite1] {2964#false} is VALID [2022-02-20 20:47:41,439 INFO L290 TraceCheckUtils]: 36: Hoare triple {2964#false} [239] L42-6-->L42-7: Formula: (= |v_thread1Thread1of1ForFork0_#t~ite2_7| |v_thread1Thread1of1ForFork0_#t~ite1_5|) InVars {thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_5|} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_5|, thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite2] {2964#false} is VALID [2022-02-20 20:47:41,439 INFO L290 TraceCheckUtils]: 37: Hoare triple {2964#false} [235] L42-7-->L42-8: Formula: (= v_~result_2~0_1 |v_thread1Thread1of1ForFork0_#t~ite2_3|) InVars {thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_3|} OutVars{thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_3|, ~result_2~0=v_~result_2~0_1} AuxVars[] AssignedVars[~result_2~0] {2964#false} is VALID [2022-02-20 20:47:41,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {2964#false} [238] L42-8-->L42-9: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite2] {2964#false} is VALID [2022-02-20 20:47:41,440 INFO L290 TraceCheckUtils]: 39: Hoare triple {2964#false} [240] L42-9-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite1] {2964#false} is VALID [2022-02-20 20:47:41,440 INFO L290 TraceCheckUtils]: 40: Hoare triple {2964#false} [241] L44-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] {2964#false} is VALID [2022-02-20 20:47:41,440 INFO L290 TraceCheckUtils]: 41: Hoare triple {2964#false} [242] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2964#false} is VALID [2022-02-20 20:47:41,440 INFO L290 TraceCheckUtils]: 42: Hoare triple {2964#false} [142] L62-4-->L62-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {2964#false} is VALID [2022-02-20 20:47:41,440 INFO L290 TraceCheckUtils]: 43: Hoare triple {2964#false} [222] L62-5-->L63: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] {2964#false} is VALID [2022-02-20 20:47:41,441 INFO L290 TraceCheckUtils]: 44: Hoare triple {2964#false} [135] L63-->L63-1: Formula: (= |v_ULTIMATE.start_main_#t~mem11#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_2|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {2964#false} is VALID [2022-02-20 20:47:41,441 INFO L290 TraceCheckUtils]: 45: Hoare triple {2964#false} [260] thread1EXIT-->L63-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {2964#false} is VALID [2022-02-20 20:47:41,441 INFO L290 TraceCheckUtils]: 46: Hoare triple {2964#false} [156] L63-2-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {2964#false} is VALID [2022-02-20 20:47:41,441 INFO L290 TraceCheckUtils]: 47: Hoare triple {2964#false} [158] L64-->L64-1: Formula: (= (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) |v_ULTIMATE.start_main_#t~mem12#1_2|) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {2964#false} is VALID [2022-02-20 20:47:41,441 INFO L290 TraceCheckUtils]: 48: Hoare triple {2964#false} [245] L48-->L48-7: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite4_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite4] {2964#false} is VALID [2022-02-20 20:47:41,441 INFO L290 TraceCheckUtils]: 49: Hoare triple {2964#false} [248] L48-7-->L48-8: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite4_3| v_~result_3~0_1) InVars {thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_3|} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_3|, ~result_3~0=v_~result_3~0_1} AuxVars[] AssignedVars[~result_3~0] {2964#false} is VALID [2022-02-20 20:47:41,442 INFO L290 TraceCheckUtils]: 50: Hoare triple {2964#false} [251] L48-8-->L48-9: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite4] {2964#false} is VALID [2022-02-20 20:47:41,442 INFO L290 TraceCheckUtils]: 51: Hoare triple {2964#false} [253] L48-9-->L50: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite3] {2964#false} is VALID [2022-02-20 20:47:41,442 INFO L290 TraceCheckUtils]: 52: Hoare triple {2964#false} [254] L50-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_1| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_1|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] {2964#false} is VALID [2022-02-20 20:47:41,442 INFO L290 TraceCheckUtils]: 53: Hoare triple {2964#false} [255] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2964#false} is VALID [2022-02-20 20:47:41,442 INFO L290 TraceCheckUtils]: 54: Hoare triple {2964#false} [261] thread2EXIT-->L64-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem12#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {2964#false} is VALID [2022-02-20 20:47:41,442 INFO L290 TraceCheckUtils]: 55: Hoare triple {2964#false} [228] L64-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {2964#false} is VALID [2022-02-20 20:47:41,442 INFO L290 TraceCheckUtils]: 56: Hoare triple {2964#false} [177] L66-->L66-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2964#false} is VALID [2022-02-20 20:47:41,443 INFO L290 TraceCheckUtils]: 57: Hoare triple {2964#false} [217] L66-1-->L66-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (and (< 0 v_~result_3~0_3) (< v_~result_2~0_3 0))) 1 0)) InVars {~result_3~0=v_~result_3~0_3, ~result_2~0=v_~result_2~0_3} OutVars{~result_3~0=v_~result_3~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|, ~result_2~0=v_~result_2~0_3} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {2964#false} is VALID [2022-02-20 20:47:41,443 INFO L290 TraceCheckUtils]: 58: Hoare triple {2964#false} [186] L66-2-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {2964#false} is VALID [2022-02-20 20:47:41,443 INFO L290 TraceCheckUtils]: 59: Hoare triple {2964#false} [170] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {2964#false} is VALID [2022-02-20 20:47:41,443 INFO L290 TraceCheckUtils]: 60: Hoare triple {2964#false} [205] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {2964#false} is VALID [2022-02-20 20:47:41,443 INFO L290 TraceCheckUtils]: 61: Hoare triple {2964#false} [193] L34-1-->L67: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2964#false} is VALID [2022-02-20 20:47:41,443 INFO L290 TraceCheckUtils]: 62: Hoare triple {2964#false} [208] L67-->L67-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2964#false} is VALID [2022-02-20 20:47:41,444 INFO L290 TraceCheckUtils]: 63: Hoare triple {2964#false} [167] L67-1-->L67-2: Formula: (= (ite (not (and (< v_~result_3~0_4 0) (< 0 v_~result_2~0_4))) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {~result_3~0=v_~result_3~0_4, ~result_2~0=v_~result_2~0_4} OutVars{~result_3~0=v_~result_3~0_4, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|, ~result_2~0=v_~result_2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {2964#false} is VALID [2022-02-20 20:47:41,444 INFO L290 TraceCheckUtils]: 64: Hoare triple {2964#false} [146] L67-2-->L34-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {2964#false} is VALID [2022-02-20 20:47:41,444 INFO L290 TraceCheckUtils]: 65: Hoare triple {2964#false} [185] L34-2-->L35-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {2964#false} is VALID [2022-02-20 20:47:41,444 INFO L290 TraceCheckUtils]: 66: Hoare triple {2964#false} [141] L35-3-->L34-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] {2964#false} is VALID [2022-02-20 20:47:41,444 INFO L290 TraceCheckUtils]: 67: Hoare triple {2964#false} [153] L34-3-->L68: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2964#false} is VALID [2022-02-20 20:47:41,444 INFO L290 TraceCheckUtils]: 68: Hoare triple {2964#false} [212] L68-->L68-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2964#false} is VALID [2022-02-20 20:47:41,444 INFO L290 TraceCheckUtils]: 69: Hoare triple {2964#false} [164] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (not (and (= v_~result_3~0_5 0) (= v_~result_2~0_5 0))) 1 0)) InVars {~result_3~0=v_~result_3~0_5, ~result_2~0=v_~result_2~0_5} OutVars{~result_3~0=v_~result_3~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|, ~result_2~0=v_~result_2~0_5} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {2964#false} is VALID [2022-02-20 20:47:41,445 INFO L290 TraceCheckUtils]: 70: Hoare triple {2964#false} [138] L68-2-->L34-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {2964#false} is VALID [2022-02-20 20:47:41,445 INFO L290 TraceCheckUtils]: 71: Hoare triple {2964#false} [131] L34-4-->L35-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {2964#false} is VALID [2022-02-20 20:47:41,445 INFO L290 TraceCheckUtils]: 72: Hoare triple {2964#false} [227] L35-6-->L34-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] {2964#false} is VALID [2022-02-20 20:47:41,445 INFO L290 TraceCheckUtils]: 73: Hoare triple {2964#false} [168] L34-5-->L69: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2964#false} is VALID [2022-02-20 20:47:41,445 INFO L290 TraceCheckUtils]: 74: Hoare triple {2964#false} [147] L69-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2964#false} is VALID [2022-02-20 20:47:41,446 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:47:41,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:47:41,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048362547] [2022-02-20 20:47:41,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048362547] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:47:41,446 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:47:41,446 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:47:41,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804450494] [2022-02-20 20:47:41,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:47:41,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2022-02-20 20:47:41,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:47:41,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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:47:41,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:47:41,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:47:41,488 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:47:41,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:47:41,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:47:41,490 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 102 [2022-02-20 20:47:41,490 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 95 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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:47:41,490 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:47:41,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 102 [2022-02-20 20:47:41,490 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:47:41,545 INFO L129 PetriNetUnfolder]: 28/215 cut-off events. [2022-02-20 20:47:41,545 INFO L130 PetriNetUnfolder]: For 58/59 co-relation queries the response was YES. [2022-02-20 20:47:41,546 INFO L84 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 215 events. 28/215 cut-off events. For 58/59 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 689 event pairs, 16 based on Foata normal form. 3/199 useless extension candidates. Maximal degree in co-relation 310. Up to 46 conditions per place. [2022-02-20 20:47:41,547 INFO L132 encePairwiseOnDemand]: 98/102 looper letters, 16 selfloop transitions, 0 changer transitions 13/96 dead transitions. [2022-02-20 20:47:41,547 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 96 transitions, 307 flow [2022-02-20 20:47:41,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:47:41,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:47:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2022-02-20 20:47:41,550 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8790849673202614 [2022-02-20 20:47:41,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 269 transitions. [2022-02-20 20:47:41,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 269 transitions. [2022-02-20 20:47:41,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:47:41,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 269 transitions. [2022-02-20 20:47:41,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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:47:41,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 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:47:41,552 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 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:47:41,552 INFO L186 Difference]: Start difference. First operand has 100 places, 95 transitions, 262 flow. Second operand 3 states and 269 transitions. [2022-02-20 20:47:41,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 96 transitions, 307 flow [2022-02-20 20:47:41,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 96 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-02-20 20:47:41,584 INFO L242 Difference]: Finished difference. Result has 101 places, 83 transitions, 202 flow [2022-02-20 20:47:41,584 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=101, PETRI_TRANSITIONS=83} [2022-02-20 20:47:41,585 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 10 predicate places. [2022-02-20 20:47:41,585 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 101 places, 83 transitions, 202 flow [2022-02-20 20:47:41,597 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 630 states, 629 states have (on average 2.505564387917329) internal successors, (1576), 629 states have internal predecessors, (1576), 0 states have call successors, (0), 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:47:41,599 INFO L78 Accepts]: Start accepts. Automaton has has 630 states, 629 states have (on average 2.505564387917329) internal successors, (1576), 629 states have internal predecessors, (1576), 0 states have call successors, (0), 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 75 [2022-02-20 20:47:41,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:47:41,599 INFO L470 AbstractCegarLoop]: Abstraction has has 101 places, 83 transitions, 202 flow [2022-02-20 20:47:41,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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:47:41,600 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:47:41,600 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:47:41,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:47:41,600 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:47:41,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:47:41,601 INFO L85 PathProgramCache]: Analyzing trace with hash 879252046, now seen corresponding path program 1 times [2022-02-20 20:47:41,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:47:41,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702828594] [2022-02-20 20:47:41,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:47:41,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:47:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:47:41,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {3599#true} [209] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3599#true} is VALID [2022-02-20 20:47:41,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {3599#true} [184] 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] {3599#true} is VALID [2022-02-20 20:47:41,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {3599#true} [214] 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[] {3599#true} is VALID [2022-02-20 20:47:41,745 INFO L290 TraceCheckUtils]: 3: Hoare triple {3599#true} [216] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {3599#true} is VALID [2022-02-20 20:47:41,745 INFO L290 TraceCheckUtils]: 4: Hoare triple {3599#true} [172] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {3599#true} is VALID [2022-02-20 20:47:41,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {3599#true} [201] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {3599#true} is VALID [2022-02-20 20:47:41,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {3599#true} [199] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {3599#true} is VALID [2022-02-20 20:47:41,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {3599#true} [154] L21-3-->L21-4: Formula: (and (= 19 (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[] {3599#true} is VALID [2022-02-20 20:47:41,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {3599#true} [223] L21-4-->L38: Formula: (= v_~result_2~0_2 0) InVars {} OutVars{~result_2~0=v_~result_2~0_2} AuxVars[] AssignedVars[~result_2~0] {3599#true} is VALID [2022-02-20 20:47:41,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {3599#true} [224] L38-->L39: Formula: (= v_~result_3~0_2 0) InVars {} OutVars{~result_3~0=v_~result_3~0_2} AuxVars[] AssignedVars[~result_3~0] {3599#true} is VALID [2022-02-20 20:47:41,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {3599#true} [203] L39-->L39-1: Formula: (= v_~sponsored_0~0_7 0) InVars {} OutVars{~sponsored_0~0=v_~sponsored_0~0_7} AuxVars[] AssignedVars[~sponsored_0~0] {3599#true} is VALID [2022-02-20 20:47:41,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {3599#true} [161] L39-1-->L-1-3: Formula: (= v_~sponsored_1~0_7 0) InVars {} OutVars{~sponsored_1~0=v_~sponsored_1~0_7} AuxVars[] AssignedVars[~sponsored_1~0] {3599#true} is VALID [2022-02-20 20:47:41,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {3599#true} [219] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3599#true} is VALID [2022-02-20 20:47:41,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {3599#true} [192] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3599#true} is VALID [2022-02-20 20:47:41,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {3599#true} [149] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {3599#true} is VALID [2022-02-20 20:47:41,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {3599#true} [190] L-1-6-->L54: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_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~mem11#1=|v_ULTIMATE.start_main_#t~mem11#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~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {3599#true} is VALID [2022-02-20 20:47:41,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {3599#true} [130] L54-->L54-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] {3599#true} is VALID [2022-02-20 20:47:41,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {3599#true} [162] L54-1-->L54-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] {3599#true} is VALID [2022-02-20 20:47:41,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {3599#true} [144] L54-2-->L57: Formula: (= v_~sponsored_0~0_8 |v_ULTIMATE.start_main_#t~nondet5#1_2|) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} OutVars{~sponsored_0~0=v_~sponsored_0~0_8, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[~sponsored_0~0] {3599#true} is VALID [2022-02-20 20:47:41,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {3599#true} [225] L57-->L58: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {3599#true} is VALID [2022-02-20 20:47:41,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {3599#true} [183] L58-->L58-1: Formula: (= v_~sponsored_1~0_8 |v_ULTIMATE.start_main_#t~nondet6#1_2|) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} OutVars{~sponsored_1~0=v_~sponsored_1~0_8, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[~sponsored_1~0] {3599#true} is VALID [2022-02-20 20:47:41,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {3599#true} [143] L58-1-->L61: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {3599#true} is VALID [2022-02-20 20:47:41,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {3599#true} [134] L61-->L61-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {3599#true} is VALID [2022-02-20 20:47:41,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {3599#true} [189] L61-1-->L61-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {3599#true} is VALID [2022-02-20 20:47:41,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {3599#true} [200] L61-2-->L61-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~pre7#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {3599#true} is VALID [2022-02-20 20:47:41,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {3599#true} [257] L61-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_10|, thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_10|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite1, thread1Thread1of1ForFork0_#t~ite2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] {3599#true} is VALID [2022-02-20 20:47:41,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {3599#true} [197] L61-4-->L61-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {3599#true} is VALID [2022-02-20 20:47:41,749 INFO L290 TraceCheckUtils]: 27: Hoare triple {3599#true} [166] L61-5-->L62: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {3599#true} is VALID [2022-02-20 20:47:41,749 INFO L290 TraceCheckUtils]: 28: Hoare triple {3599#true} [220] L62-->L62-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {3599#true} is VALID [2022-02-20 20:47:41,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {3599#true} [207] L62-1-->L62-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {3599#true} is VALID [2022-02-20 20:47:41,750 INFO L290 TraceCheckUtils]: 30: Hoare triple {3599#true} [171] L62-2-->L62-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre9#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {3599#true} is VALID [2022-02-20 20:47:41,750 INFO L290 TraceCheckUtils]: 31: Hoare triple {3599#true} [259] L62-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_10|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_10|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~ite4, thread2Thread1of1ForFork1_#t~ite3, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] {3599#true} is VALID [2022-02-20 20:47:41,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {3599#true} [231] thread1ENTRY-->L42-2: Formula: (not (= (ite (not (= (mod v_~sponsored_0~0_2 256) 0)) 1 0) (ite (not (= (mod v_~sponsored_1~0_2 256) 0)) 1 0))) InVars {~sponsored_0~0=v_~sponsored_0~0_2, ~sponsored_1~0=v_~sponsored_1~0_2} OutVars{~sponsored_0~0=v_~sponsored_0~0_2, ~sponsored_1~0=v_~sponsored_1~0_2} AuxVars[] AssignedVars[] {3599#true} is VALID [2022-02-20 20:47:41,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {3599#true} [233] L42-2-->L42-3: Formula: (not (= (mod v_~sponsored_1~0_3 256) 0)) InVars {~sponsored_1~0=v_~sponsored_1~0_3} OutVars{~sponsored_1~0=v_~sponsored_1~0_3} AuxVars[] AssignedVars[] {3599#true} is VALID [2022-02-20 20:47:41,751 INFO L290 TraceCheckUtils]: 34: Hoare triple {3599#true} [236] L42-3-->L42-6: Formula: (= (- 1) |v_thread1Thread1of1ForFork0_#t~ite1_1|) InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite1] {3601#(<= (+ |thread1Thread1of1ForFork0_#t~ite1| 1) 0)} is VALID [2022-02-20 20:47:41,751 INFO L290 TraceCheckUtils]: 35: Hoare triple {3601#(<= (+ |thread1Thread1of1ForFork0_#t~ite1| 1) 0)} [239] L42-6-->L42-7: Formula: (= |v_thread1Thread1of1ForFork0_#t~ite2_7| |v_thread1Thread1of1ForFork0_#t~ite1_5|) InVars {thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_5|} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_5|, thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite2] {3602#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} is VALID [2022-02-20 20:47:41,752 INFO L290 TraceCheckUtils]: 36: Hoare triple {3602#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} [235] L42-7-->L42-8: Formula: (= v_~result_2~0_1 |v_thread1Thread1of1ForFork0_#t~ite2_3|) InVars {thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_3|} OutVars{thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_3|, ~result_2~0=v_~result_2~0_1} AuxVars[] AssignedVars[~result_2~0] {3603#(<= (+ ~result_2~0 1) 0)} is VALID [2022-02-20 20:47:41,752 INFO L290 TraceCheckUtils]: 37: Hoare triple {3603#(<= (+ ~result_2~0 1) 0)} [238] L42-8-->L42-9: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite2] {3603#(<= (+ ~result_2~0 1) 0)} is VALID [2022-02-20 20:47:41,752 INFO L290 TraceCheckUtils]: 38: Hoare triple {3603#(<= (+ ~result_2~0 1) 0)} [240] L42-9-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite1] {3603#(<= (+ ~result_2~0 1) 0)} is VALID [2022-02-20 20:47:41,753 INFO L290 TraceCheckUtils]: 39: Hoare triple {3603#(<= (+ ~result_2~0 1) 0)} [241] L44-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] {3603#(<= (+ ~result_2~0 1) 0)} is VALID [2022-02-20 20:47:41,753 INFO L290 TraceCheckUtils]: 40: Hoare triple {3603#(<= (+ ~result_2~0 1) 0)} [242] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3603#(<= (+ ~result_2~0 1) 0)} is VALID [2022-02-20 20:47:41,753 INFO L290 TraceCheckUtils]: 41: Hoare triple {3603#(<= (+ ~result_2~0 1) 0)} [142] L62-4-->L62-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {3603#(<= (+ ~result_2~0 1) 0)} is VALID [2022-02-20 20:47:41,754 INFO L290 TraceCheckUtils]: 42: Hoare triple {3603#(<= (+ ~result_2~0 1) 0)} [222] L62-5-->L63: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] {3603#(<= (+ ~result_2~0 1) 0)} is VALID [2022-02-20 20:47:41,754 INFO L290 TraceCheckUtils]: 43: Hoare triple {3603#(<= (+ ~result_2~0 1) 0)} [135] L63-->L63-1: Formula: (= |v_ULTIMATE.start_main_#t~mem11#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_2|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {3603#(<= (+ ~result_2~0 1) 0)} is VALID [2022-02-20 20:47:41,755 INFO L290 TraceCheckUtils]: 44: Hoare triple {3603#(<= (+ ~result_2~0 1) 0)} [260] thread1EXIT-->L63-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {3603#(<= (+ ~result_2~0 1) 0)} is VALID [2022-02-20 20:47:41,755 INFO L290 TraceCheckUtils]: 45: Hoare triple {3603#(<= (+ ~result_2~0 1) 0)} [244] thread2ENTRY-->L48-2: Formula: (not (= (ite (not (= (mod v_~sponsored_1~0_6 256) 0)) 1 0) (ite (not (= (mod v_~sponsored_0~0_5 256) 0)) 1 0))) InVars {~sponsored_1~0=v_~sponsored_1~0_6, ~sponsored_0~0=v_~sponsored_0~0_5} OutVars{~sponsored_1~0=v_~sponsored_1~0_6, ~sponsored_0~0=v_~sponsored_0~0_5} AuxVars[] AssignedVars[] {3603#(<= (+ ~result_2~0 1) 0)} is VALID [2022-02-20 20:47:41,756 INFO L290 TraceCheckUtils]: 46: Hoare triple {3603#(<= (+ ~result_2~0 1) 0)} [247] L48-2-->L48-5: Formula: (= (mod v_~sponsored_0~0_3 256) 0) InVars {~sponsored_0~0=v_~sponsored_0~0_3} OutVars{~sponsored_0~0=v_~sponsored_0~0_3} AuxVars[] AssignedVars[] {3603#(<= (+ ~result_2~0 1) 0)} is VALID [2022-02-20 20:47:41,756 INFO L290 TraceCheckUtils]: 47: Hoare triple {3603#(<= (+ ~result_2~0 1) 0)} [156] L63-2-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {3603#(<= (+ ~result_2~0 1) 0)} is VALID [2022-02-20 20:47:41,756 INFO L290 TraceCheckUtils]: 48: Hoare triple {3603#(<= (+ ~result_2~0 1) 0)} [158] L64-->L64-1: Formula: (= (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) |v_ULTIMATE.start_main_#t~mem12#1_2|) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {3603#(<= (+ ~result_2~0 1) 0)} is VALID [2022-02-20 20:47:41,757 INFO L290 TraceCheckUtils]: 49: Hoare triple {3603#(<= (+ ~result_2~0 1) 0)} [250] L48-5-->L48-6: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite3_3| 1) InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite3] {3604#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} is VALID [2022-02-20 20:47:41,757 INFO L290 TraceCheckUtils]: 50: Hoare triple {3604#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} [252] L48-6-->L48-7: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite4_7| |v_thread2Thread1of1ForFork1_#t~ite3_5|) InVars {thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_5|} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_7|, thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite4] {3605#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite4| 1))} is VALID [2022-02-20 20:47:41,758 INFO L290 TraceCheckUtils]: 51: Hoare triple {3605#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite4| 1))} [248] L48-7-->L48-8: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite4_3| v_~result_3~0_1) InVars {thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_3|} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_3|, ~result_3~0=v_~result_3~0_1} AuxVars[] AssignedVars[~result_3~0] {3606#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} is VALID [2022-02-20 20:47:41,758 INFO L290 TraceCheckUtils]: 52: Hoare triple {3606#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} [251] L48-8-->L48-9: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite4] {3606#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} is VALID [2022-02-20 20:47:41,758 INFO L290 TraceCheckUtils]: 53: Hoare triple {3606#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} [253] L48-9-->L50: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite3] {3606#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} is VALID [2022-02-20 20:47:41,759 INFO L290 TraceCheckUtils]: 54: Hoare triple {3606#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} [254] L50-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_1| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_1|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] {3606#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} is VALID [2022-02-20 20:47:41,759 INFO L290 TraceCheckUtils]: 55: Hoare triple {3606#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} [255] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3606#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} is VALID [2022-02-20 20:47:41,760 INFO L290 TraceCheckUtils]: 56: Hoare triple {3606#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} [261] thread2EXIT-->L64-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem12#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {3606#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} is VALID [2022-02-20 20:47:41,760 INFO L290 TraceCheckUtils]: 57: Hoare triple {3606#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} [228] L64-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {3606#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} is VALID [2022-02-20 20:47:41,761 INFO L290 TraceCheckUtils]: 58: Hoare triple {3606#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} [177] L66-->L66-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3606#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} is VALID [2022-02-20 20:47:41,761 INFO L290 TraceCheckUtils]: 59: Hoare triple {3606#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} [217] L66-1-->L66-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (and (< 0 v_~result_3~0_3) (< v_~result_2~0_3 0))) 1 0)) InVars {~result_3~0=v_~result_3~0_3, ~result_2~0=v_~result_2~0_3} OutVars{~result_3~0=v_~result_3~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|, ~result_2~0=v_~result_2~0_3} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {3607#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:47:41,762 INFO L290 TraceCheckUtils]: 60: Hoare triple {3607#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [186] L66-2-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {3607#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:47:41,762 INFO L290 TraceCheckUtils]: 61: Hoare triple {3607#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [170] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {3608#(and (not (<= ~result_3~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:47:41,762 INFO L290 TraceCheckUtils]: 62: Hoare triple {3608#(and (not (<= ~result_3~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (not (<= 0 ~result_2~0)))} [205] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {3600#false} is VALID [2022-02-20 20:47:41,763 INFO L290 TraceCheckUtils]: 63: Hoare triple {3600#false} [193] L34-1-->L67: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3600#false} is VALID [2022-02-20 20:47:41,763 INFO L290 TraceCheckUtils]: 64: Hoare triple {3600#false} [208] L67-->L67-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3600#false} is VALID [2022-02-20 20:47:41,763 INFO L290 TraceCheckUtils]: 65: Hoare triple {3600#false} [167] L67-1-->L67-2: Formula: (= (ite (not (and (< v_~result_3~0_4 0) (< 0 v_~result_2~0_4))) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {~result_3~0=v_~result_3~0_4, ~result_2~0=v_~result_2~0_4} OutVars{~result_3~0=v_~result_3~0_4, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|, ~result_2~0=v_~result_2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {3600#false} is VALID [2022-02-20 20:47:41,763 INFO L290 TraceCheckUtils]: 66: Hoare triple {3600#false} [146] L67-2-->L34-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {3600#false} is VALID [2022-02-20 20:47:41,763 INFO L290 TraceCheckUtils]: 67: Hoare triple {3600#false} [185] L34-2-->L35-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {3600#false} is VALID [2022-02-20 20:47:41,763 INFO L290 TraceCheckUtils]: 68: Hoare triple {3600#false} [141] L35-3-->L34-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] {3600#false} is VALID [2022-02-20 20:47:41,763 INFO L290 TraceCheckUtils]: 69: Hoare triple {3600#false} [153] L34-3-->L68: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3600#false} is VALID [2022-02-20 20:47:41,764 INFO L290 TraceCheckUtils]: 70: Hoare triple {3600#false} [212] L68-->L68-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3600#false} is VALID [2022-02-20 20:47:41,764 INFO L290 TraceCheckUtils]: 71: Hoare triple {3600#false} [164] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (not (and (= v_~result_3~0_5 0) (= v_~result_2~0_5 0))) 1 0)) InVars {~result_3~0=v_~result_3~0_5, ~result_2~0=v_~result_2~0_5} OutVars{~result_3~0=v_~result_3~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|, ~result_2~0=v_~result_2~0_5} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {3600#false} is VALID [2022-02-20 20:47:41,764 INFO L290 TraceCheckUtils]: 72: Hoare triple {3600#false} [138] L68-2-->L34-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {3600#false} is VALID [2022-02-20 20:47:41,764 INFO L290 TraceCheckUtils]: 73: Hoare triple {3600#false} [131] L34-4-->L35-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {3600#false} is VALID [2022-02-20 20:47:41,764 INFO L290 TraceCheckUtils]: 74: Hoare triple {3600#false} [227] L35-6-->L34-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] {3600#false} is VALID [2022-02-20 20:47:41,764 INFO L290 TraceCheckUtils]: 75: Hoare triple {3600#false} [168] L34-5-->L69: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3600#false} is VALID [2022-02-20 20:47:41,765 INFO L290 TraceCheckUtils]: 76: Hoare triple {3600#false} [147] L69-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3600#false} is VALID [2022-02-20 20:47:41,765 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:47:41,765 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:47:41,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702828594] [2022-02-20 20:47:41,765 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702828594] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:47:41,766 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:47:41,766 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:47:41,766 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933029331] [2022-02-20 20:47:41,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:47:41,767 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 20:47:41,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:47:41,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 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:47:41,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:47:41,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:47:41,810 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:47:41,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:47:41,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:47:41,811 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 102 [2022-02-20 20:47:41,812 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 83 transitions, 202 flow. Second operand has 10 states, 10 states have (on average 65.8) internal successors, (658), 10 states have internal predecessors, (658), 0 states have call successors, (0), 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:47:41,812 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:47:41,812 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 102 [2022-02-20 20:47:41,813 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:47:42,367 INFO L129 PetriNetUnfolder]: 96/376 cut-off events. [2022-02-20 20:47:42,367 INFO L130 PetriNetUnfolder]: For 151/152 co-relation queries the response was YES. [2022-02-20 20:47:42,368 INFO L84 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 376 events. 96/376 cut-off events. For 151/152 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1672 event pairs, 35 based on Foata normal form. 1/367 useless extension candidates. Maximal degree in co-relation 762. Up to 112 conditions per place. [2022-02-20 20:47:42,369 INFO L132 encePairwiseOnDemand]: 89/102 looper letters, 75 selfloop transitions, 5 changer transitions 34/167 dead transitions. [2022-02-20 20:47:42,369 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 167 transitions, 697 flow [2022-02-20 20:47:42,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 20:47:42,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-02-20 20:47:42,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1627 transitions. [2022-02-20 20:47:42,384 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6646241830065359 [2022-02-20 20:47:42,384 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 1627 transitions. [2022-02-20 20:47:42,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 1627 transitions. [2022-02-20 20:47:42,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:47:42,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1627 transitions. [2022-02-20 20:47:42,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 67.79166666666667) internal successors, (1627), 24 states have internal predecessors, (1627), 0 states have call successors, (0), 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:47:42,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 102.0) internal successors, (2550), 25 states have internal predecessors, (2550), 0 states have call successors, (0), 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:47:42,393 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 102.0) internal successors, (2550), 25 states have internal predecessors, (2550), 0 states have call successors, (0), 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:47:42,393 INFO L186 Difference]: Start difference. First operand has 101 places, 83 transitions, 202 flow. Second operand 24 states and 1627 transitions. [2022-02-20 20:47:42,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 167 transitions, 697 flow [2022-02-20 20:47:49,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 167 transitions, 643 flow, removed 22 selfloop flow, removed 6 redundant places. [2022-02-20 20:47:49,099 INFO L242 Difference]: Finished difference. Result has 133 places, 87 transitions, 283 flow [2022-02-20 20:47:49,100 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=283, PETRI_PLACES=133, PETRI_TRANSITIONS=87} [2022-02-20 20:47:49,100 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 42 predicate places. [2022-02-20 20:47:49,100 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 133 places, 87 transitions, 283 flow [2022-02-20 20:47:49,133 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1034 states, 1031 states have (on average 2.4451988360814743) internal successors, (2521), 1033 states have internal predecessors, (2521), 0 states have call successors, (0), 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:47:49,135 INFO L78 Accepts]: Start accepts. Automaton has has 1034 states, 1031 states have (on average 2.4451988360814743) internal successors, (2521), 1033 states have internal predecessors, (2521), 0 states have call successors, (0), 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 77 [2022-02-20 20:47:49,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:47:49,135 INFO L470 AbstractCegarLoop]: Abstraction has has 133 places, 87 transitions, 283 flow [2022-02-20 20:47:49,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 65.8) internal successors, (658), 10 states have internal predecessors, (658), 0 states have call successors, (0), 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:47:49,136 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:47:49,136 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:47:49,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:47:49,136 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:47:49,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:47:49,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1572308048, now seen corresponding path program 2 times [2022-02-20 20:47:49,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:47:49,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101911740] [2022-02-20 20:47:49,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:47:49,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:47:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:47:49,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {4706#true} [209] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4706#true} is VALID [2022-02-20 20:47:49,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {4706#true} [184] 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] {4706#true} is VALID [2022-02-20 20:47:49,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {4706#true} [214] 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[] {4706#true} is VALID [2022-02-20 20:47:49,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {4706#true} [216] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {4706#true} is VALID [2022-02-20 20:47:49,270 INFO L290 TraceCheckUtils]: 4: Hoare triple {4706#true} [172] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {4706#true} is VALID [2022-02-20 20:47:49,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {4706#true} [201] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {4706#true} is VALID [2022-02-20 20:47:49,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {4706#true} [199] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {4706#true} is VALID [2022-02-20 20:47:49,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {4706#true} [154] L21-3-->L21-4: Formula: (and (= 19 (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[] {4706#true} is VALID [2022-02-20 20:47:49,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {4706#true} [223] L21-4-->L38: Formula: (= v_~result_2~0_2 0) InVars {} OutVars{~result_2~0=v_~result_2~0_2} AuxVars[] AssignedVars[~result_2~0] {4706#true} is VALID [2022-02-20 20:47:49,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {4706#true} [224] L38-->L39: Formula: (= v_~result_3~0_2 0) InVars {} OutVars{~result_3~0=v_~result_3~0_2} AuxVars[] AssignedVars[~result_3~0] {4706#true} is VALID [2022-02-20 20:47:49,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {4706#true} [203] L39-->L39-1: Formula: (= v_~sponsored_0~0_7 0) InVars {} OutVars{~sponsored_0~0=v_~sponsored_0~0_7} AuxVars[] AssignedVars[~sponsored_0~0] {4706#true} is VALID [2022-02-20 20:47:49,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {4706#true} [161] L39-1-->L-1-3: Formula: (= v_~sponsored_1~0_7 0) InVars {} OutVars{~sponsored_1~0=v_~sponsored_1~0_7} AuxVars[] AssignedVars[~sponsored_1~0] {4706#true} is VALID [2022-02-20 20:47:49,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {4706#true} [219] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4706#true} is VALID [2022-02-20 20:47:49,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {4706#true} [192] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4706#true} is VALID [2022-02-20 20:47:49,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {4706#true} [149] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {4706#true} is VALID [2022-02-20 20:47:49,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {4706#true} [190] L-1-6-->L54: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_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~mem11#1=|v_ULTIMATE.start_main_#t~mem11#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~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {4706#true} is VALID [2022-02-20 20:47:49,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {4706#true} [130] L54-->L54-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] {4706#true} is VALID [2022-02-20 20:47:49,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {4706#true} [162] L54-1-->L54-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] {4706#true} is VALID [2022-02-20 20:47:49,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {4706#true} [144] L54-2-->L57: Formula: (= v_~sponsored_0~0_8 |v_ULTIMATE.start_main_#t~nondet5#1_2|) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} OutVars{~sponsored_0~0=v_~sponsored_0~0_8, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[~sponsored_0~0] {4706#true} is VALID [2022-02-20 20:47:49,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {4706#true} [225] L57-->L58: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {4706#true} is VALID [2022-02-20 20:47:49,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {4706#true} [183] L58-->L58-1: Formula: (= v_~sponsored_1~0_8 |v_ULTIMATE.start_main_#t~nondet6#1_2|) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} OutVars{~sponsored_1~0=v_~sponsored_1~0_8, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[~sponsored_1~0] {4706#true} is VALID [2022-02-20 20:47:49,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {4706#true} [143] L58-1-->L61: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {4706#true} is VALID [2022-02-20 20:47:49,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {4706#true} [134] L61-->L61-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {4706#true} is VALID [2022-02-20 20:47:49,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {4706#true} [189] L61-1-->L61-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {4706#true} is VALID [2022-02-20 20:47:49,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {4706#true} [200] L61-2-->L61-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~pre7#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {4706#true} is VALID [2022-02-20 20:47:49,274 INFO L290 TraceCheckUtils]: 25: Hoare triple {4706#true} [257] L61-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_10|, thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_10|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite1, thread1Thread1of1ForFork0_#t~ite2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] {4706#true} is VALID [2022-02-20 20:47:49,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {4706#true} [231] thread1ENTRY-->L42-2: Formula: (not (= (ite (not (= (mod v_~sponsored_0~0_2 256) 0)) 1 0) (ite (not (= (mod v_~sponsored_1~0_2 256) 0)) 1 0))) InVars {~sponsored_0~0=v_~sponsored_0~0_2, ~sponsored_1~0=v_~sponsored_1~0_2} OutVars{~sponsored_0~0=v_~sponsored_0~0_2, ~sponsored_1~0=v_~sponsored_1~0_2} AuxVars[] AssignedVars[] {4706#true} is VALID [2022-02-20 20:47:49,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {4706#true} [233] L42-2-->L42-3: Formula: (not (= (mod v_~sponsored_1~0_3 256) 0)) InVars {~sponsored_1~0=v_~sponsored_1~0_3} OutVars{~sponsored_1~0=v_~sponsored_1~0_3} AuxVars[] AssignedVars[] {4706#true} is VALID [2022-02-20 20:47:49,274 INFO L290 TraceCheckUtils]: 28: Hoare triple {4706#true} [236] L42-3-->L42-6: Formula: (= (- 1) |v_thread1Thread1of1ForFork0_#t~ite1_1|) InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite1] {4708#(<= (+ |thread1Thread1of1ForFork0_#t~ite1| 1) 0)} is VALID [2022-02-20 20:47:49,275 INFO L290 TraceCheckUtils]: 29: Hoare triple {4708#(<= (+ |thread1Thread1of1ForFork0_#t~ite1| 1) 0)} [239] L42-6-->L42-7: Formula: (= |v_thread1Thread1of1ForFork0_#t~ite2_7| |v_thread1Thread1of1ForFork0_#t~ite1_5|) InVars {thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_5|} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_5|, thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite2] {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} is VALID [2022-02-20 20:47:49,275 INFO L290 TraceCheckUtils]: 30: Hoare triple {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} [197] L61-4-->L61-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} is VALID [2022-02-20 20:47:49,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} [166] L61-5-->L62: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} is VALID [2022-02-20 20:47:49,276 INFO L290 TraceCheckUtils]: 32: Hoare triple {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} [220] L62-->L62-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} is VALID [2022-02-20 20:47:49,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} [207] L62-1-->L62-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} is VALID [2022-02-20 20:47:49,276 INFO L290 TraceCheckUtils]: 34: Hoare triple {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} [171] L62-2-->L62-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre9#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} is VALID [2022-02-20 20:47:49,277 INFO L290 TraceCheckUtils]: 35: Hoare triple {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} [259] L62-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_10|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_10|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~ite4, thread2Thread1of1ForFork1_#t~ite3, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} is VALID [2022-02-20 20:47:49,277 INFO L290 TraceCheckUtils]: 36: Hoare triple {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} [142] L62-4-->L62-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} is VALID [2022-02-20 20:47:49,277 INFO L290 TraceCheckUtils]: 37: Hoare triple {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} [222] L62-5-->L63: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} is VALID [2022-02-20 20:47:49,278 INFO L290 TraceCheckUtils]: 38: Hoare triple {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} [135] L63-->L63-1: Formula: (= |v_ULTIMATE.start_main_#t~mem11#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_2|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} is VALID [2022-02-20 20:47:49,278 INFO L290 TraceCheckUtils]: 39: Hoare triple {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} [244] thread2ENTRY-->L48-2: Formula: (not (= (ite (not (= (mod v_~sponsored_1~0_6 256) 0)) 1 0) (ite (not (= (mod v_~sponsored_0~0_5 256) 0)) 1 0))) InVars {~sponsored_1~0=v_~sponsored_1~0_6, ~sponsored_0~0=v_~sponsored_0~0_5} OutVars{~sponsored_1~0=v_~sponsored_1~0_6, ~sponsored_0~0=v_~sponsored_0~0_5} AuxVars[] AssignedVars[] {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} is VALID [2022-02-20 20:47:49,278 INFO L290 TraceCheckUtils]: 40: Hoare triple {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} [247] L48-2-->L48-5: Formula: (= (mod v_~sponsored_0~0_3 256) 0) InVars {~sponsored_0~0=v_~sponsored_0~0_3} OutVars{~sponsored_0~0=v_~sponsored_0~0_3} AuxVars[] AssignedVars[] {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} is VALID [2022-02-20 20:47:49,281 INFO L290 TraceCheckUtils]: 41: Hoare triple {4709#(<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0)} [250] L48-5-->L48-6: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite3_3| 1) InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite3] {4710#(and (<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} is VALID [2022-02-20 20:47:49,281 INFO L290 TraceCheckUtils]: 42: Hoare triple {4710#(and (<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} [252] L48-6-->L48-7: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite4_7| |v_thread2Thread1of1ForFork1_#t~ite3_5|) InVars {thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_5|} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_7|, thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite4] {4711#(and (<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite4| 1))} is VALID [2022-02-20 20:47:49,281 INFO L290 TraceCheckUtils]: 43: Hoare triple {4711#(and (<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite4| 1))} [248] L48-7-->L48-8: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite4_3| v_~result_3~0_1) InVars {thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_3|} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_3|, ~result_3~0=v_~result_3~0_1} AuxVars[] AssignedVars[~result_3~0] {4712#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0))} is VALID [2022-02-20 20:47:49,282 INFO L290 TraceCheckUtils]: 44: Hoare triple {4712#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0))} [251] L48-8-->L48-9: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite4] {4712#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0))} is VALID [2022-02-20 20:47:49,282 INFO L290 TraceCheckUtils]: 45: Hoare triple {4712#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0))} [253] L48-9-->L50: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite3] {4712#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0))} is VALID [2022-02-20 20:47:49,283 INFO L290 TraceCheckUtils]: 46: Hoare triple {4712#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0))} [235] L42-7-->L42-8: Formula: (= v_~result_2~0_1 |v_thread1Thread1of1ForFork0_#t~ite2_3|) InVars {thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_3|} OutVars{thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_3|, ~result_2~0=v_~result_2~0_1} AuxVars[] AssignedVars[~result_2~0] {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} is VALID [2022-02-20 20:47:49,283 INFO L290 TraceCheckUtils]: 47: Hoare triple {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} [238] L42-8-->L42-9: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite2] {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} is VALID [2022-02-20 20:47:49,283 INFO L290 TraceCheckUtils]: 48: Hoare triple {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} [240] L42-9-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite1] {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} is VALID [2022-02-20 20:47:49,284 INFO L290 TraceCheckUtils]: 49: Hoare triple {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} [241] L44-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} is VALID [2022-02-20 20:47:49,284 INFO L290 TraceCheckUtils]: 50: Hoare triple {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} [242] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} is VALID [2022-02-20 20:47:49,285 INFO L290 TraceCheckUtils]: 51: Hoare triple {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} [260] thread1EXIT-->L63-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} is VALID [2022-02-20 20:47:49,285 INFO L290 TraceCheckUtils]: 52: Hoare triple {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} [156] L63-2-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} is VALID [2022-02-20 20:47:49,285 INFO L290 TraceCheckUtils]: 53: Hoare triple {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} [158] L64-->L64-1: Formula: (= (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) |v_ULTIMATE.start_main_#t~mem12#1_2|) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} is VALID [2022-02-20 20:47:49,286 INFO L290 TraceCheckUtils]: 54: Hoare triple {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} [254] L50-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_1| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_1|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} is VALID [2022-02-20 20:47:49,286 INFO L290 TraceCheckUtils]: 55: Hoare triple {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} [255] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} is VALID [2022-02-20 20:47:49,287 INFO L290 TraceCheckUtils]: 56: Hoare triple {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} [261] thread2EXIT-->L64-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem12#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} is VALID [2022-02-20 20:47:49,287 INFO L290 TraceCheckUtils]: 57: Hoare triple {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} [228] L64-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} is VALID [2022-02-20 20:47:49,287 INFO L290 TraceCheckUtils]: 58: Hoare triple {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} [177] L66-->L66-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} is VALID [2022-02-20 20:47:49,288 INFO L290 TraceCheckUtils]: 59: Hoare triple {4713#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ ~result_2~0 1) 0))} [217] L66-1-->L66-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (and (< 0 v_~result_3~0_3) (< v_~result_2~0_3 0))) 1 0)) InVars {~result_3~0=v_~result_3~0_3, ~result_2~0=v_~result_2~0_3} OutVars{~result_3~0=v_~result_3~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|, ~result_2~0=v_~result_2~0_3} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {4714#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:47:49,288 INFO L290 TraceCheckUtils]: 60: Hoare triple {4714#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [186] L66-2-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {4714#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:47:49,289 INFO L290 TraceCheckUtils]: 61: Hoare triple {4714#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [170] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {4715#(and (not (<= ~result_3~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:47:49,289 INFO L290 TraceCheckUtils]: 62: Hoare triple {4715#(and (not (<= ~result_3~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (not (<= 0 ~result_2~0)))} [205] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {4707#false} is VALID [2022-02-20 20:47:49,289 INFO L290 TraceCheckUtils]: 63: Hoare triple {4707#false} [193] L34-1-->L67: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4707#false} is VALID [2022-02-20 20:47:49,289 INFO L290 TraceCheckUtils]: 64: Hoare triple {4707#false} [208] L67-->L67-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4707#false} is VALID [2022-02-20 20:47:49,289 INFO L290 TraceCheckUtils]: 65: Hoare triple {4707#false} [167] L67-1-->L67-2: Formula: (= (ite (not (and (< v_~result_3~0_4 0) (< 0 v_~result_2~0_4))) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {~result_3~0=v_~result_3~0_4, ~result_2~0=v_~result_2~0_4} OutVars{~result_3~0=v_~result_3~0_4, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|, ~result_2~0=v_~result_2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {4707#false} is VALID [2022-02-20 20:47:49,290 INFO L290 TraceCheckUtils]: 66: Hoare triple {4707#false} [146] L67-2-->L34-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {4707#false} is VALID [2022-02-20 20:47:49,290 INFO L290 TraceCheckUtils]: 67: Hoare triple {4707#false} [185] L34-2-->L35-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {4707#false} is VALID [2022-02-20 20:47:49,290 INFO L290 TraceCheckUtils]: 68: Hoare triple {4707#false} [141] L35-3-->L34-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] {4707#false} is VALID [2022-02-20 20:47:49,290 INFO L290 TraceCheckUtils]: 69: Hoare triple {4707#false} [153] L34-3-->L68: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4707#false} is VALID [2022-02-20 20:47:49,290 INFO L290 TraceCheckUtils]: 70: Hoare triple {4707#false} [212] L68-->L68-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4707#false} is VALID [2022-02-20 20:47:49,290 INFO L290 TraceCheckUtils]: 71: Hoare triple {4707#false} [164] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (not (and (= v_~result_3~0_5 0) (= v_~result_2~0_5 0))) 1 0)) InVars {~result_3~0=v_~result_3~0_5, ~result_2~0=v_~result_2~0_5} OutVars{~result_3~0=v_~result_3~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|, ~result_2~0=v_~result_2~0_5} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {4707#false} is VALID [2022-02-20 20:47:49,290 INFO L290 TraceCheckUtils]: 72: Hoare triple {4707#false} [138] L68-2-->L34-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {4707#false} is VALID [2022-02-20 20:47:49,291 INFO L290 TraceCheckUtils]: 73: Hoare triple {4707#false} [131] L34-4-->L35-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {4707#false} is VALID [2022-02-20 20:47:49,291 INFO L290 TraceCheckUtils]: 74: Hoare triple {4707#false} [227] L35-6-->L34-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] {4707#false} is VALID [2022-02-20 20:47:49,291 INFO L290 TraceCheckUtils]: 75: Hoare triple {4707#false} [168] L34-5-->L69: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4707#false} is VALID [2022-02-20 20:47:49,291 INFO L290 TraceCheckUtils]: 76: Hoare triple {4707#false} [147] L69-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4707#false} is VALID [2022-02-20 20:47:49,291 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:47:49,292 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:47:49,292 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101911740] [2022-02-20 20:47:49,292 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101911740] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:47:49,292 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:47:49,292 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:47:49,292 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084289505] [2022-02-20 20:47:49,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:47:49,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 20:47:49,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:47:49,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 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:47:49,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:47:49,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:47:49,333 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:47:49,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:47:49,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:47:49,334 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 102 [2022-02-20 20:47:49,335 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 87 transitions, 283 flow. Second operand has 10 states, 10 states have (on average 65.8) internal successors, (658), 10 states have internal predecessors, (658), 0 states have call successors, (0), 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:47:49,335 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:47:49,335 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 102 [2022-02-20 20:47:49,335 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:47:49,804 INFO L129 PetriNetUnfolder]: 94/356 cut-off events. [2022-02-20 20:47:49,804 INFO L130 PetriNetUnfolder]: For 867/867 co-relation queries the response was YES. [2022-02-20 20:47:49,805 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 356 events. 94/356 cut-off events. For 867/867 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1500 event pairs, 44 based on Foata normal form. 1/348 useless extension candidates. Maximal degree in co-relation 1143. Up to 149 conditions per place. [2022-02-20 20:47:49,807 INFO L132 encePairwiseOnDemand]: 89/102 looper letters, 45 selfloop transitions, 14 changer transitions 18/130 dead transitions. [2022-02-20 20:47:49,807 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 130 transitions, 757 flow [2022-02-20 20:47:49,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 20:47:49,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-02-20 20:47:49,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1086 transitions. [2022-02-20 20:47:49,816 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6654411764705882 [2022-02-20 20:47:49,816 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1086 transitions. [2022-02-20 20:47:49,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1086 transitions. [2022-02-20 20:47:49,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:47:49,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1086 transitions. [2022-02-20 20:47:49,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 67.875) internal successors, (1086), 16 states have internal predecessors, (1086), 0 states have call successors, (0), 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:47:49,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 102.0) internal successors, (1734), 17 states have internal predecessors, (1734), 0 states have call successors, (0), 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:47:49,821 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 102.0) internal successors, (1734), 17 states have internal predecessors, (1734), 0 states have call successors, (0), 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:47:49,821 INFO L186 Difference]: Start difference. First operand has 133 places, 87 transitions, 283 flow. Second operand 16 states and 1086 transitions. [2022-02-20 20:47:49,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 130 transitions, 757 flow [2022-02-20 20:47:53,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 130 transitions, 682 flow, removed 37 selfloop flow, removed 11 redundant places. [2022-02-20 20:47:53,928 INFO L242 Difference]: Finished difference. Result has 131 places, 97 transitions, 405 flow [2022-02-20 20:47:53,928 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=405, PETRI_PLACES=131, PETRI_TRANSITIONS=97} [2022-02-20 20:47:53,929 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 40 predicate places. [2022-02-20 20:47:53,929 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 131 places, 97 transitions, 405 flow [2022-02-20 20:47:53,971 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1090 states, 1086 states have (on average 2.4373848987108655) internal successors, (2647), 1089 states have internal predecessors, (2647), 0 states have call successors, (0), 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:47:53,973 INFO L78 Accepts]: Start accepts. Automaton has has 1090 states, 1086 states have (on average 2.4373848987108655) internal successors, (2647), 1089 states have internal predecessors, (2647), 0 states have call successors, (0), 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 77 [2022-02-20 20:47:53,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:47:53,974 INFO L470 AbstractCegarLoop]: Abstraction has has 131 places, 97 transitions, 405 flow [2022-02-20 20:47:53,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 65.8) internal successors, (658), 10 states have internal predecessors, (658), 0 states have call successors, (0), 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:47:53,974 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:47:53,974 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:47:53,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:47:53,975 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:47:53,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:47:53,975 INFO L85 PathProgramCache]: Analyzing trace with hash -970272412, now seen corresponding path program 3 times [2022-02-20 20:47:53,975 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:47:53,976 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416583270] [2022-02-20 20:47:53,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:47:53,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:47:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:47:54,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {5843#true} [209] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5843#true} is VALID [2022-02-20 20:47:54,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {5843#true} [184] 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] {5843#true} is VALID [2022-02-20 20:47:54,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {5843#true} [214] 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[] {5843#true} is VALID [2022-02-20 20:47:54,129 INFO L290 TraceCheckUtils]: 3: Hoare triple {5843#true} [216] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {5843#true} is VALID [2022-02-20 20:47:54,130 INFO L290 TraceCheckUtils]: 4: Hoare triple {5843#true} [172] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {5843#true} is VALID [2022-02-20 20:47:54,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {5843#true} [201] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {5843#true} is VALID [2022-02-20 20:47:54,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {5843#true} [199] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {5843#true} is VALID [2022-02-20 20:47:54,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {5843#true} [154] L21-3-->L21-4: Formula: (and (= 19 (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[] {5843#true} is VALID [2022-02-20 20:47:54,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {5843#true} [223] L21-4-->L38: Formula: (= v_~result_2~0_2 0) InVars {} OutVars{~result_2~0=v_~result_2~0_2} AuxVars[] AssignedVars[~result_2~0] {5843#true} is VALID [2022-02-20 20:47:54,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {5843#true} [224] L38-->L39: Formula: (= v_~result_3~0_2 0) InVars {} OutVars{~result_3~0=v_~result_3~0_2} AuxVars[] AssignedVars[~result_3~0] {5843#true} is VALID [2022-02-20 20:47:54,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {5843#true} [203] L39-->L39-1: Formula: (= v_~sponsored_0~0_7 0) InVars {} OutVars{~sponsored_0~0=v_~sponsored_0~0_7} AuxVars[] AssignedVars[~sponsored_0~0] {5843#true} is VALID [2022-02-20 20:47:54,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {5843#true} [161] L39-1-->L-1-3: Formula: (= v_~sponsored_1~0_7 0) InVars {} OutVars{~sponsored_1~0=v_~sponsored_1~0_7} AuxVars[] AssignedVars[~sponsored_1~0] {5843#true} is VALID [2022-02-20 20:47:54,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {5843#true} [219] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5843#true} is VALID [2022-02-20 20:47:54,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {5843#true} [192] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5843#true} is VALID [2022-02-20 20:47:54,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {5843#true} [149] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {5843#true} is VALID [2022-02-20 20:47:54,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {5843#true} [190] L-1-6-->L54: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_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~mem11#1=|v_ULTIMATE.start_main_#t~mem11#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~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {5843#true} is VALID [2022-02-20 20:47:54,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {5843#true} [130] L54-->L54-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] {5843#true} is VALID [2022-02-20 20:47:54,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {5843#true} [162] L54-1-->L54-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] {5843#true} is VALID [2022-02-20 20:47:54,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {5843#true} [144] L54-2-->L57: Formula: (= v_~sponsored_0~0_8 |v_ULTIMATE.start_main_#t~nondet5#1_2|) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} OutVars{~sponsored_0~0=v_~sponsored_0~0_8, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[~sponsored_0~0] {5843#true} is VALID [2022-02-20 20:47:54,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {5843#true} [225] L57-->L58: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {5843#true} is VALID [2022-02-20 20:47:54,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {5843#true} [183] L58-->L58-1: Formula: (= v_~sponsored_1~0_8 |v_ULTIMATE.start_main_#t~nondet6#1_2|) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} OutVars{~sponsored_1~0=v_~sponsored_1~0_8, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[~sponsored_1~0] {5843#true} is VALID [2022-02-20 20:47:54,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {5843#true} [143] L58-1-->L61: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {5843#true} is VALID [2022-02-20 20:47:54,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {5843#true} [134] L61-->L61-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {5843#true} is VALID [2022-02-20 20:47:54,133 INFO L290 TraceCheckUtils]: 23: Hoare triple {5843#true} [189] L61-1-->L61-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {5843#true} is VALID [2022-02-20 20:47:54,133 INFO L290 TraceCheckUtils]: 24: Hoare triple {5843#true} [200] L61-2-->L61-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~pre7#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {5843#true} is VALID [2022-02-20 20:47:54,133 INFO L290 TraceCheckUtils]: 25: Hoare triple {5843#true} [257] L61-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_10|, thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_10|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite1, thread1Thread1of1ForFork0_#t~ite2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] {5843#true} is VALID [2022-02-20 20:47:54,133 INFO L290 TraceCheckUtils]: 26: Hoare triple {5843#true} [231] thread1ENTRY-->L42-2: Formula: (not (= (ite (not (= (mod v_~sponsored_0~0_2 256) 0)) 1 0) (ite (not (= (mod v_~sponsored_1~0_2 256) 0)) 1 0))) InVars {~sponsored_0~0=v_~sponsored_0~0_2, ~sponsored_1~0=v_~sponsored_1~0_2} OutVars{~sponsored_0~0=v_~sponsored_0~0_2, ~sponsored_1~0=v_~sponsored_1~0_2} AuxVars[] AssignedVars[] {5843#true} is VALID [2022-02-20 20:47:54,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {5843#true} [197] L61-4-->L61-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {5843#true} is VALID [2022-02-20 20:47:54,134 INFO L290 TraceCheckUtils]: 28: Hoare triple {5843#true} [166] L61-5-->L62: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {5843#true} is VALID [2022-02-20 20:47:54,134 INFO L290 TraceCheckUtils]: 29: Hoare triple {5843#true} [220] L62-->L62-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {5843#true} is VALID [2022-02-20 20:47:54,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {5843#true} [207] L62-1-->L62-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {5843#true} is VALID [2022-02-20 20:47:54,134 INFO L290 TraceCheckUtils]: 31: Hoare triple {5843#true} [171] L62-2-->L62-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre9#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {5843#true} is VALID [2022-02-20 20:47:54,134 INFO L290 TraceCheckUtils]: 32: Hoare triple {5843#true} [259] L62-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_10|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_10|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~ite4, thread2Thread1of1ForFork1_#t~ite3, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] {5843#true} is VALID [2022-02-20 20:47:54,134 INFO L290 TraceCheckUtils]: 33: Hoare triple {5843#true} [244] thread2ENTRY-->L48-2: Formula: (not (= (ite (not (= (mod v_~sponsored_1~0_6 256) 0)) 1 0) (ite (not (= (mod v_~sponsored_0~0_5 256) 0)) 1 0))) InVars {~sponsored_1~0=v_~sponsored_1~0_6, ~sponsored_0~0=v_~sponsored_0~0_5} OutVars{~sponsored_1~0=v_~sponsored_1~0_6, ~sponsored_0~0=v_~sponsored_0~0_5} AuxVars[] AssignedVars[] {5843#true} is VALID [2022-02-20 20:47:54,134 INFO L290 TraceCheckUtils]: 34: Hoare triple {5843#true} [247] L48-2-->L48-5: Formula: (= (mod v_~sponsored_0~0_3 256) 0) InVars {~sponsored_0~0=v_~sponsored_0~0_3} OutVars{~sponsored_0~0=v_~sponsored_0~0_3} AuxVars[] AssignedVars[] {5843#true} is VALID [2022-02-20 20:47:54,135 INFO L290 TraceCheckUtils]: 35: Hoare triple {5843#true} [250] L48-5-->L48-6: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite3_3| 1) InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite3] {5845#(= |thread2Thread1of1ForFork1_#t~ite3| 1)} is VALID [2022-02-20 20:47:54,135 INFO L290 TraceCheckUtils]: 36: Hoare triple {5845#(= |thread2Thread1of1ForFork1_#t~ite3| 1)} [233] L42-2-->L42-3: Formula: (not (= (mod v_~sponsored_1~0_3 256) 0)) InVars {~sponsored_1~0=v_~sponsored_1~0_3} OutVars{~sponsored_1~0=v_~sponsored_1~0_3} AuxVars[] AssignedVars[] {5845#(= |thread2Thread1of1ForFork1_#t~ite3| 1)} is VALID [2022-02-20 20:47:54,136 INFO L290 TraceCheckUtils]: 37: Hoare triple {5845#(= |thread2Thread1of1ForFork1_#t~ite3| 1)} [236] L42-3-->L42-6: Formula: (= (- 1) |v_thread1Thread1of1ForFork0_#t~ite1_1|) InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite1] {5846#(and (<= (+ |thread1Thread1of1ForFork0_#t~ite1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} is VALID [2022-02-20 20:47:54,136 INFO L290 TraceCheckUtils]: 38: Hoare triple {5846#(and (<= (+ |thread1Thread1of1ForFork0_#t~ite1| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} [239] L42-6-->L42-7: Formula: (= |v_thread1Thread1of1ForFork0_#t~ite2_7| |v_thread1Thread1of1ForFork0_#t~ite1_5|) InVars {thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_5|} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_5|, thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite2] {5847#(and (<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} is VALID [2022-02-20 20:47:54,137 INFO L290 TraceCheckUtils]: 39: Hoare triple {5847#(and (<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} [235] L42-7-->L42-8: Formula: (= v_~result_2~0_1 |v_thread1Thread1of1ForFork0_#t~ite2_3|) InVars {thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_3|} OutVars{thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_3|, ~result_2~0=v_~result_2~0_1} AuxVars[] AssignedVars[~result_2~0] {5848#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} is VALID [2022-02-20 20:47:54,137 INFO L290 TraceCheckUtils]: 40: Hoare triple {5848#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} [238] L42-8-->L42-9: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite2] {5848#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} is VALID [2022-02-20 20:47:54,137 INFO L290 TraceCheckUtils]: 41: Hoare triple {5848#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} [240] L42-9-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite1] {5848#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} is VALID [2022-02-20 20:47:54,138 INFO L290 TraceCheckUtils]: 42: Hoare triple {5848#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} [241] L44-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] {5848#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} is VALID [2022-02-20 20:47:54,138 INFO L290 TraceCheckUtils]: 43: Hoare triple {5848#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} [242] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5848#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} is VALID [2022-02-20 20:47:54,138 INFO L290 TraceCheckUtils]: 44: Hoare triple {5848#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} [142] L62-4-->L62-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {5848#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} is VALID [2022-02-20 20:47:54,139 INFO L290 TraceCheckUtils]: 45: Hoare triple {5848#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} [222] L62-5-->L63: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] {5848#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} is VALID [2022-02-20 20:47:54,139 INFO L290 TraceCheckUtils]: 46: Hoare triple {5848#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} [135] L63-->L63-1: Formula: (= |v_ULTIMATE.start_main_#t~mem11#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_2|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {5848#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} is VALID [2022-02-20 20:47:54,140 INFO L290 TraceCheckUtils]: 47: Hoare triple {5848#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} [260] thread1EXIT-->L63-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {5848#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} is VALID [2022-02-20 20:47:54,140 INFO L290 TraceCheckUtils]: 48: Hoare triple {5848#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} [156] L63-2-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {5848#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} is VALID [2022-02-20 20:47:54,140 INFO L290 TraceCheckUtils]: 49: Hoare triple {5848#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} [158] L64-->L64-1: Formula: (= (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) |v_ULTIMATE.start_main_#t~mem12#1_2|) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {5848#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} is VALID [2022-02-20 20:47:54,141 INFO L290 TraceCheckUtils]: 50: Hoare triple {5848#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite3| 1))} [252] L48-6-->L48-7: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite4_7| |v_thread2Thread1of1ForFork1_#t~ite3_5|) InVars {thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_5|} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_7|, thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite4] {5849#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite4| 1))} is VALID [2022-02-20 20:47:54,141 INFO L290 TraceCheckUtils]: 51: Hoare triple {5849#(and (<= (+ ~result_2~0 1) 0) (= |thread2Thread1of1ForFork1_#t~ite4| 1))} [248] L48-7-->L48-8: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite4_3| v_~result_3~0_1) InVars {thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_3|} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_3|, ~result_3~0=v_~result_3~0_1} AuxVars[] AssignedVars[~result_3~0] {5850#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:47:54,142 INFO L290 TraceCheckUtils]: 52: Hoare triple {5850#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [251] L48-8-->L48-9: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite4] {5850#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:47:54,142 INFO L290 TraceCheckUtils]: 53: Hoare triple {5850#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [253] L48-9-->L50: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite3] {5850#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:47:54,142 INFO L290 TraceCheckUtils]: 54: Hoare triple {5850#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [254] L50-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_1| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_1|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] {5850#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:47:54,143 INFO L290 TraceCheckUtils]: 55: Hoare triple {5850#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [255] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5850#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:47:54,143 INFO L290 TraceCheckUtils]: 56: Hoare triple {5850#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [261] thread2EXIT-->L64-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem12#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {5850#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:47:54,144 INFO L290 TraceCheckUtils]: 57: Hoare triple {5850#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [228] L64-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {5850#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:47:54,144 INFO L290 TraceCheckUtils]: 58: Hoare triple {5850#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [177] L66-->L66-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5850#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:47:54,145 INFO L290 TraceCheckUtils]: 59: Hoare triple {5850#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [217] L66-1-->L66-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (and (< 0 v_~result_3~0_3) (< v_~result_2~0_3 0))) 1 0)) InVars {~result_3~0=v_~result_3~0_3, ~result_2~0=v_~result_2~0_3} OutVars{~result_3~0=v_~result_3~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|, ~result_2~0=v_~result_2~0_3} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {5851#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:47:54,145 INFO L290 TraceCheckUtils]: 60: Hoare triple {5851#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [186] L66-2-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {5851#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:47:54,146 INFO L290 TraceCheckUtils]: 61: Hoare triple {5851#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [170] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {5852#(and (not (<= ~result_3~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:47:54,146 INFO L290 TraceCheckUtils]: 62: Hoare triple {5852#(and (not (<= ~result_3~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (not (<= 0 ~result_2~0)))} [205] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {5844#false} is VALID [2022-02-20 20:47:54,146 INFO L290 TraceCheckUtils]: 63: Hoare triple {5844#false} [193] L34-1-->L67: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5844#false} is VALID [2022-02-20 20:47:54,146 INFO L290 TraceCheckUtils]: 64: Hoare triple {5844#false} [208] L67-->L67-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5844#false} is VALID [2022-02-20 20:47:54,146 INFO L290 TraceCheckUtils]: 65: Hoare triple {5844#false} [167] L67-1-->L67-2: Formula: (= (ite (not (and (< v_~result_3~0_4 0) (< 0 v_~result_2~0_4))) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {~result_3~0=v_~result_3~0_4, ~result_2~0=v_~result_2~0_4} OutVars{~result_3~0=v_~result_3~0_4, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|, ~result_2~0=v_~result_2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {5844#false} is VALID [2022-02-20 20:47:54,146 INFO L290 TraceCheckUtils]: 66: Hoare triple {5844#false} [146] L67-2-->L34-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {5844#false} is VALID [2022-02-20 20:47:54,147 INFO L290 TraceCheckUtils]: 67: Hoare triple {5844#false} [185] L34-2-->L35-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {5844#false} is VALID [2022-02-20 20:47:54,147 INFO L290 TraceCheckUtils]: 68: Hoare triple {5844#false} [141] L35-3-->L34-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] {5844#false} is VALID [2022-02-20 20:47:54,147 INFO L290 TraceCheckUtils]: 69: Hoare triple {5844#false} [153] L34-3-->L68: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5844#false} is VALID [2022-02-20 20:47:54,147 INFO L290 TraceCheckUtils]: 70: Hoare triple {5844#false} [212] L68-->L68-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5844#false} is VALID [2022-02-20 20:47:54,147 INFO L290 TraceCheckUtils]: 71: Hoare triple {5844#false} [164] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (not (and (= v_~result_3~0_5 0) (= v_~result_2~0_5 0))) 1 0)) InVars {~result_3~0=v_~result_3~0_5, ~result_2~0=v_~result_2~0_5} OutVars{~result_3~0=v_~result_3~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|, ~result_2~0=v_~result_2~0_5} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {5844#false} is VALID [2022-02-20 20:47:54,147 INFO L290 TraceCheckUtils]: 72: Hoare triple {5844#false} [138] L68-2-->L34-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {5844#false} is VALID [2022-02-20 20:47:54,147 INFO L290 TraceCheckUtils]: 73: Hoare triple {5844#false} [131] L34-4-->L35-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {5844#false} is VALID [2022-02-20 20:47:54,148 INFO L290 TraceCheckUtils]: 74: Hoare triple {5844#false} [227] L35-6-->L34-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] {5844#false} is VALID [2022-02-20 20:47:54,148 INFO L290 TraceCheckUtils]: 75: Hoare triple {5844#false} [168] L34-5-->L69: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5844#false} is VALID [2022-02-20 20:47:54,148 INFO L290 TraceCheckUtils]: 76: Hoare triple {5844#false} [147] L69-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5844#false} is VALID [2022-02-20 20:47:54,148 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:47:54,148 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:47:54,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416583270] [2022-02-20 20:47:54,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416583270] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:47:54,149 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:47:54,149 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:47:54,149 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843452119] [2022-02-20 20:47:54,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:47:54,150 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 20:47:54,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:47:54,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 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:47:54,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:47:54,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:47:54,190 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:47:54,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:47:54,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:47:54,192 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 102 [2022-02-20 20:47:54,193 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 97 transitions, 405 flow. Second operand has 10 states, 10 states have (on average 65.8) internal successors, (658), 10 states have internal predecessors, (658), 0 states have call successors, (0), 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:47:54,193 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:47:54,193 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 102 [2022-02-20 20:47:54,193 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:47:54,772 INFO L129 PetriNetUnfolder]: 162/538 cut-off events. [2022-02-20 20:47:54,773 INFO L130 PetriNetUnfolder]: For 1901/1901 co-relation queries the response was YES. [2022-02-20 20:47:54,775 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2109 conditions, 538 events. 162/538 cut-off events. For 1901/1901 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2739 event pairs, 78 based on Foata normal form. 1/526 useless extension candidates. Maximal degree in co-relation 2079. Up to 216 conditions per place. [2022-02-20 20:47:54,777 INFO L132 encePairwiseOnDemand]: 89/102 looper letters, 67 selfloop transitions, 14 changer transitions 28/162 dead transitions. [2022-02-20 20:47:54,777 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 162 transitions, 1174 flow [2022-02-20 20:47:54,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 20:47:54,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-02-20 20:47:54,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1352 transitions. [2022-02-20 20:47:54,786 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6627450980392157 [2022-02-20 20:47:54,786 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1352 transitions. [2022-02-20 20:47:54,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1352 transitions. [2022-02-20 20:47:54,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:47:54,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1352 transitions. [2022-02-20 20:47:54,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 67.6) internal successors, (1352), 20 states have internal predecessors, (1352), 0 states have call successors, (0), 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:47:54,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 102.0) internal successors, (2142), 21 states have internal predecessors, (2142), 0 states have call successors, (0), 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:47:54,793 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 102.0) internal successors, (2142), 21 states have internal predecessors, (2142), 0 states have call successors, (0), 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:47:54,793 INFO L186 Difference]: Start difference. First operand has 131 places, 97 transitions, 405 flow. Second operand 20 states and 1352 transitions. [2022-02-20 20:47:54,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 162 transitions, 1174 flow [2022-02-20 20:48:02,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 162 transitions, 1059 flow, removed 41 selfloop flow, removed 7 redundant places. [2022-02-20 20:48:02,463 INFO L242 Difference]: Finished difference. Result has 153 places, 108 transitions, 537 flow [2022-02-20 20:48:02,463 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=537, PETRI_PLACES=153, PETRI_TRANSITIONS=108} [2022-02-20 20:48:02,464 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 62 predicate places. [2022-02-20 20:48:02,464 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 153 places, 108 transitions, 537 flow [2022-02-20 20:48:02,528 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1526 states, 1521 states have (on average 2.4746877054569363) internal successors, (3764), 1525 states have internal predecessors, (3764), 0 states have call successors, (0), 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:48:02,530 INFO L78 Accepts]: Start accepts. Automaton has has 1526 states, 1521 states have (on average 2.4746877054569363) internal successors, (3764), 1525 states have internal predecessors, (3764), 0 states have call successors, (0), 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 77 [2022-02-20 20:48:02,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:48:02,530 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 108 transitions, 537 flow [2022-02-20 20:48:02,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 65.8) internal successors, (658), 10 states have internal predecessors, (658), 0 states have call successors, (0), 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:48:02,531 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:48:02,531 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:48:02,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:48:02,531 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:48:02,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:48:02,532 INFO L85 PathProgramCache]: Analyzing trace with hash 2091241380, now seen corresponding path program 4 times [2022-02-20 20:48:02,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:48:02,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976091863] [2022-02-20 20:48:02,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:48:02,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:48:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:48:02,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {7424#true} [209] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7424#true} is VALID [2022-02-20 20:48:02,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {7424#true} [184] 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] {7424#true} is VALID [2022-02-20 20:48:02,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {7424#true} [214] 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[] {7424#true} is VALID [2022-02-20 20:48:02,641 INFO L290 TraceCheckUtils]: 3: Hoare triple {7424#true} [216] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {7424#true} is VALID [2022-02-20 20:48:02,641 INFO L290 TraceCheckUtils]: 4: Hoare triple {7424#true} [172] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {7424#true} is VALID [2022-02-20 20:48:02,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {7424#true} [201] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {7424#true} is VALID [2022-02-20 20:48:02,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {7424#true} [199] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {7424#true} is VALID [2022-02-20 20:48:02,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {7424#true} [154] L21-3-->L21-4: Formula: (and (= 19 (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[] {7424#true} is VALID [2022-02-20 20:48:02,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {7424#true} [223] L21-4-->L38: Formula: (= v_~result_2~0_2 0) InVars {} OutVars{~result_2~0=v_~result_2~0_2} AuxVars[] AssignedVars[~result_2~0] {7424#true} is VALID [2022-02-20 20:48:02,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {7424#true} [224] L38-->L39: Formula: (= v_~result_3~0_2 0) InVars {} OutVars{~result_3~0=v_~result_3~0_2} AuxVars[] AssignedVars[~result_3~0] {7424#true} is VALID [2022-02-20 20:48:02,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {7424#true} [203] L39-->L39-1: Formula: (= v_~sponsored_0~0_7 0) InVars {} OutVars{~sponsored_0~0=v_~sponsored_0~0_7} AuxVars[] AssignedVars[~sponsored_0~0] {7424#true} is VALID [2022-02-20 20:48:02,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {7424#true} [161] L39-1-->L-1-3: Formula: (= v_~sponsored_1~0_7 0) InVars {} OutVars{~sponsored_1~0=v_~sponsored_1~0_7} AuxVars[] AssignedVars[~sponsored_1~0] {7424#true} is VALID [2022-02-20 20:48:02,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {7424#true} [219] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7424#true} is VALID [2022-02-20 20:48:02,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {7424#true} [192] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7424#true} is VALID [2022-02-20 20:48:02,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {7424#true} [149] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {7424#true} is VALID [2022-02-20 20:48:02,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {7424#true} [190] L-1-6-->L54: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_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~mem11#1=|v_ULTIMATE.start_main_#t~mem11#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~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {7424#true} is VALID [2022-02-20 20:48:02,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {7424#true} [130] L54-->L54-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] {7424#true} is VALID [2022-02-20 20:48:02,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {7424#true} [162] L54-1-->L54-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] {7424#true} is VALID [2022-02-20 20:48:02,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {7424#true} [144] L54-2-->L57: Formula: (= v_~sponsored_0~0_8 |v_ULTIMATE.start_main_#t~nondet5#1_2|) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} OutVars{~sponsored_0~0=v_~sponsored_0~0_8, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[~sponsored_0~0] {7424#true} is VALID [2022-02-20 20:48:02,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {7424#true} [225] L57-->L58: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {7424#true} is VALID [2022-02-20 20:48:02,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {7424#true} [183] L58-->L58-1: Formula: (= v_~sponsored_1~0_8 |v_ULTIMATE.start_main_#t~nondet6#1_2|) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} OutVars{~sponsored_1~0=v_~sponsored_1~0_8, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[~sponsored_1~0] {7424#true} is VALID [2022-02-20 20:48:02,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {7424#true} [143] L58-1-->L61: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {7424#true} is VALID [2022-02-20 20:48:02,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {7424#true} [134] L61-->L61-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {7424#true} is VALID [2022-02-20 20:48:02,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {7424#true} [189] L61-1-->L61-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {7424#true} is VALID [2022-02-20 20:48:02,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {7424#true} [200] L61-2-->L61-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~pre7#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {7424#true} is VALID [2022-02-20 20:48:02,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {7424#true} [257] L61-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_10|, thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_10|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite1, thread1Thread1of1ForFork0_#t~ite2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] {7424#true} is VALID [2022-02-20 20:48:02,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {7424#true} [231] thread1ENTRY-->L42-2: Formula: (not (= (ite (not (= (mod v_~sponsored_0~0_2 256) 0)) 1 0) (ite (not (= (mod v_~sponsored_1~0_2 256) 0)) 1 0))) InVars {~sponsored_0~0=v_~sponsored_0~0_2, ~sponsored_1~0=v_~sponsored_1~0_2} OutVars{~sponsored_0~0=v_~sponsored_0~0_2, ~sponsored_1~0=v_~sponsored_1~0_2} AuxVars[] AssignedVars[] {7424#true} is VALID [2022-02-20 20:48:02,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {7424#true} [233] L42-2-->L42-3: Formula: (not (= (mod v_~sponsored_1~0_3 256) 0)) InVars {~sponsored_1~0=v_~sponsored_1~0_3} OutVars{~sponsored_1~0=v_~sponsored_1~0_3} AuxVars[] AssignedVars[] {7424#true} is VALID [2022-02-20 20:48:02,645 INFO L290 TraceCheckUtils]: 28: Hoare triple {7424#true} [197] L61-4-->L61-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {7424#true} is VALID [2022-02-20 20:48:02,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {7424#true} [166] L61-5-->L62: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {7424#true} is VALID [2022-02-20 20:48:02,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {7424#true} [220] L62-->L62-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {7424#true} is VALID [2022-02-20 20:48:02,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {7424#true} [207] L62-1-->L62-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {7424#true} is VALID [2022-02-20 20:48:02,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {7424#true} [171] L62-2-->L62-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre9#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {7424#true} is VALID [2022-02-20 20:48:02,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {7424#true} [259] L62-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_10|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_10|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~ite4, thread2Thread1of1ForFork1_#t~ite3, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] {7424#true} is VALID [2022-02-20 20:48:02,646 INFO L290 TraceCheckUtils]: 34: Hoare triple {7424#true} [244] thread2ENTRY-->L48-2: Formula: (not (= (ite (not (= (mod v_~sponsored_1~0_6 256) 0)) 1 0) (ite (not (= (mod v_~sponsored_0~0_5 256) 0)) 1 0))) InVars {~sponsored_1~0=v_~sponsored_1~0_6, ~sponsored_0~0=v_~sponsored_0~0_5} OutVars{~sponsored_1~0=v_~sponsored_1~0_6, ~sponsored_0~0=v_~sponsored_0~0_5} AuxVars[] AssignedVars[] {7424#true} is VALID [2022-02-20 20:48:02,646 INFO L290 TraceCheckUtils]: 35: Hoare triple {7424#true} [247] L48-2-->L48-5: Formula: (= (mod v_~sponsored_0~0_3 256) 0) InVars {~sponsored_0~0=v_~sponsored_0~0_3} OutVars{~sponsored_0~0=v_~sponsored_0~0_3} AuxVars[] AssignedVars[] {7424#true} is VALID [2022-02-20 20:48:02,646 INFO L290 TraceCheckUtils]: 36: Hoare triple {7424#true} [250] L48-5-->L48-6: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite3_3| 1) InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite3] {7426#(= |thread2Thread1of1ForFork1_#t~ite3| 1)} is VALID [2022-02-20 20:48:02,647 INFO L290 TraceCheckUtils]: 37: Hoare triple {7426#(= |thread2Thread1of1ForFork1_#t~ite3| 1)} [252] L48-6-->L48-7: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite4_7| |v_thread2Thread1of1ForFork1_#t~ite3_5|) InVars {thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_5|} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_7|, thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite4] {7427#(= |thread2Thread1of1ForFork1_#t~ite4| 1)} is VALID [2022-02-20 20:48:02,647 INFO L290 TraceCheckUtils]: 38: Hoare triple {7427#(= |thread2Thread1of1ForFork1_#t~ite4| 1)} [248] L48-7-->L48-8: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite4_3| v_~result_3~0_1) InVars {thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_3|} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_3|, ~result_3~0=v_~result_3~0_1} AuxVars[] AssignedVars[~result_3~0] {7428#(= (+ (- 1) ~result_3~0) 0)} is VALID [2022-02-20 20:48:02,647 INFO L290 TraceCheckUtils]: 39: Hoare triple {7428#(= (+ (- 1) ~result_3~0) 0)} [251] L48-8-->L48-9: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite4] {7428#(= (+ (- 1) ~result_3~0) 0)} is VALID [2022-02-20 20:48:02,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {7428#(= (+ (- 1) ~result_3~0) 0)} [253] L48-9-->L50: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite3] {7428#(= (+ (- 1) ~result_3~0) 0)} is VALID [2022-02-20 20:48:02,648 INFO L290 TraceCheckUtils]: 41: Hoare triple {7428#(= (+ (- 1) ~result_3~0) 0)} [236] L42-3-->L42-6: Formula: (= (- 1) |v_thread1Thread1of1ForFork0_#t~ite1_1|) InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite1] {7429#(and (<= (+ |thread1Thread1of1ForFork0_#t~ite1| 1) 0) (= (+ (- 1) ~result_3~0) 0))} is VALID [2022-02-20 20:48:02,648 INFO L290 TraceCheckUtils]: 42: Hoare triple {7429#(and (<= (+ |thread1Thread1of1ForFork0_#t~ite1| 1) 0) (= (+ (- 1) ~result_3~0) 0))} [239] L42-6-->L42-7: Formula: (= |v_thread1Thread1of1ForFork0_#t~ite2_7| |v_thread1Thread1of1ForFork0_#t~ite1_5|) InVars {thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_5|} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_5|, thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite2] {7430#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0))} is VALID [2022-02-20 20:48:02,649 INFO L290 TraceCheckUtils]: 43: Hoare triple {7430#(and (= (+ (- 1) ~result_3~0) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite2| 1) 0))} [235] L42-7-->L42-8: Formula: (= v_~result_2~0_1 |v_thread1Thread1of1ForFork0_#t~ite2_3|) InVars {thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_3|} OutVars{thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_3|, ~result_2~0=v_~result_2~0_1} AuxVars[] AssignedVars[~result_2~0] {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:48:02,649 INFO L290 TraceCheckUtils]: 44: Hoare triple {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [238] L42-8-->L42-9: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite2] {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:48:02,650 INFO L290 TraceCheckUtils]: 45: Hoare triple {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [240] L42-9-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite1] {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:48:02,650 INFO L290 TraceCheckUtils]: 46: Hoare triple {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [241] L44-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:48:02,650 INFO L290 TraceCheckUtils]: 47: Hoare triple {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [242] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:48:02,651 INFO L290 TraceCheckUtils]: 48: Hoare triple {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [142] L62-4-->L62-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:48:02,652 INFO L290 TraceCheckUtils]: 49: Hoare triple {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [222] L62-5-->L63: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:48:02,653 INFO L290 TraceCheckUtils]: 50: Hoare triple {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [135] L63-->L63-1: Formula: (= |v_ULTIMATE.start_main_#t~mem11#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_2|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:48:02,654 INFO L290 TraceCheckUtils]: 51: Hoare triple {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [260] thread1EXIT-->L63-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:48:02,655 INFO L290 TraceCheckUtils]: 52: Hoare triple {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [156] L63-2-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:48:02,655 INFO L290 TraceCheckUtils]: 53: Hoare triple {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [158] L64-->L64-1: Formula: (= (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) |v_ULTIMATE.start_main_#t~mem12#1_2|) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:48:02,656 INFO L290 TraceCheckUtils]: 54: Hoare triple {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [254] L50-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_1| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_1|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:48:02,656 INFO L290 TraceCheckUtils]: 55: Hoare triple {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [255] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:48:02,656 INFO L290 TraceCheckUtils]: 56: Hoare triple {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [261] thread2EXIT-->L64-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem12#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:48:02,657 INFO L290 TraceCheckUtils]: 57: Hoare triple {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [228] L64-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:48:02,657 INFO L290 TraceCheckUtils]: 58: Hoare triple {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [177] L66-->L66-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:48:02,657 INFO L290 TraceCheckUtils]: 59: Hoare triple {7431#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)))} [217] L66-1-->L66-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (and (< 0 v_~result_3~0_3) (< v_~result_2~0_3 0))) 1 0)) InVars {~result_3~0=v_~result_3~0_3, ~result_2~0=v_~result_2~0_3} OutVars{~result_3~0=v_~result_3~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|, ~result_2~0=v_~result_2~0_3} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {7432#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:48:02,658 INFO L290 TraceCheckUtils]: 60: Hoare triple {7432#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [186] L66-2-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {7432#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:48:02,658 INFO L290 TraceCheckUtils]: 61: Hoare triple {7432#(and (not (<= ~result_3~0 0)) (not (<= 0 ~result_2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [170] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {7433#(and (not (<= ~result_3~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (not (<= 0 ~result_2~0)))} is VALID [2022-02-20 20:48:02,658 INFO L290 TraceCheckUtils]: 62: Hoare triple {7433#(and (not (<= ~result_3~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (not (<= 0 ~result_2~0)))} [205] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {7425#false} is VALID [2022-02-20 20:48:02,659 INFO L290 TraceCheckUtils]: 63: Hoare triple {7425#false} [193] L34-1-->L67: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7425#false} is VALID [2022-02-20 20:48:02,659 INFO L290 TraceCheckUtils]: 64: Hoare triple {7425#false} [208] L67-->L67-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7425#false} is VALID [2022-02-20 20:48:02,659 INFO L290 TraceCheckUtils]: 65: Hoare triple {7425#false} [167] L67-1-->L67-2: Formula: (= (ite (not (and (< v_~result_3~0_4 0) (< 0 v_~result_2~0_4))) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {~result_3~0=v_~result_3~0_4, ~result_2~0=v_~result_2~0_4} OutVars{~result_3~0=v_~result_3~0_4, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|, ~result_2~0=v_~result_2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {7425#false} is VALID [2022-02-20 20:48:02,659 INFO L290 TraceCheckUtils]: 66: Hoare triple {7425#false} [146] L67-2-->L34-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {7425#false} is VALID [2022-02-20 20:48:02,659 INFO L290 TraceCheckUtils]: 67: Hoare triple {7425#false} [185] L34-2-->L35-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {7425#false} is VALID [2022-02-20 20:48:02,659 INFO L290 TraceCheckUtils]: 68: Hoare triple {7425#false} [141] L35-3-->L34-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] {7425#false} is VALID [2022-02-20 20:48:02,659 INFO L290 TraceCheckUtils]: 69: Hoare triple {7425#false} [153] L34-3-->L68: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7425#false} is VALID [2022-02-20 20:48:02,660 INFO L290 TraceCheckUtils]: 70: Hoare triple {7425#false} [212] L68-->L68-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7425#false} is VALID [2022-02-20 20:48:02,660 INFO L290 TraceCheckUtils]: 71: Hoare triple {7425#false} [164] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (not (and (= v_~result_3~0_5 0) (= v_~result_2~0_5 0))) 1 0)) InVars {~result_3~0=v_~result_3~0_5, ~result_2~0=v_~result_2~0_5} OutVars{~result_3~0=v_~result_3~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|, ~result_2~0=v_~result_2~0_5} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {7425#false} is VALID [2022-02-20 20:48:02,660 INFO L290 TraceCheckUtils]: 72: Hoare triple {7425#false} [138] L68-2-->L34-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {7425#false} is VALID [2022-02-20 20:48:02,660 INFO L290 TraceCheckUtils]: 73: Hoare triple {7425#false} [131] L34-4-->L35-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {7425#false} is VALID [2022-02-20 20:48:02,660 INFO L290 TraceCheckUtils]: 74: Hoare triple {7425#false} [227] L35-6-->L34-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] {7425#false} is VALID [2022-02-20 20:48:02,660 INFO L290 TraceCheckUtils]: 75: Hoare triple {7425#false} [168] L34-5-->L69: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7425#false} is VALID [2022-02-20 20:48:02,660 INFO L290 TraceCheckUtils]: 76: Hoare triple {7425#false} [147] L69-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7425#false} is VALID [2022-02-20 20:48:02,661 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:48:02,661 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:48:02,661 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976091863] [2022-02-20 20:48:02,661 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976091863] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:48:02,662 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:48:02,662 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:48:02,662 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917968509] [2022-02-20 20:48:02,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:48:02,663 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 20:48:02,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:48:02,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 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:48:02,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:48:02,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:48:02,702 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:48:02,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:48:02,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:48:02,705 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 102 [2022-02-20 20:48:02,706 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 108 transitions, 537 flow. Second operand has 10 states, 10 states have (on average 65.8) internal successors, (658), 10 states have internal predecessors, (658), 0 states have call successors, (0), 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:48:02,706 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:48:02,706 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 102 [2022-02-20 20:48:02,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:48:03,514 INFO L129 PetriNetUnfolder]: 157/609 cut-off events. [2022-02-20 20:48:03,514 INFO L130 PetriNetUnfolder]: For 3914/3917 co-relation queries the response was YES. [2022-02-20 20:48:03,517 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2708 conditions, 609 events. 157/609 cut-off events. For 3914/3917 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3468 event pairs, 70 based on Foata normal form. 1/597 useless extension candidates. Maximal degree in co-relation 2666. Up to 193 conditions per place. [2022-02-20 20:48:03,519 INFO L132 encePairwiseOnDemand]: 89/102 looper letters, 116 selfloop transitions, 15 changer transitions 35/219 dead transitions. [2022-02-20 20:48:03,519 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 219 transitions, 1946 flow [2022-02-20 20:48:03,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 20:48:03,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-02-20 20:48:03,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1624 transitions. [2022-02-20 20:48:03,535 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6633986928104575 [2022-02-20 20:48:03,536 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 1624 transitions. [2022-02-20 20:48:03,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 1624 transitions. [2022-02-20 20:48:03,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:48:03,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1624 transitions. [2022-02-20 20:48:03,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 67.66666666666667) internal successors, (1624), 24 states have internal predecessors, (1624), 0 states have call successors, (0), 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:48:03,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 102.0) internal successors, (2550), 25 states have internal predecessors, (2550), 0 states have call successors, (0), 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:48:03,543 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 102.0) internal successors, (2550), 25 states have internal predecessors, (2550), 0 states have call successors, (0), 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:48:03,543 INFO L186 Difference]: Start difference. First operand has 153 places, 108 transitions, 537 flow. Second operand 24 states and 1624 transitions. [2022-02-20 20:48:03,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 219 transitions, 1946 flow [2022-02-20 20:48:32,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 219 transitions, 1772 flow, removed 87 selfloop flow, removed 8 redundant places. [2022-02-20 20:48:32,898 INFO L242 Difference]: Finished difference. Result has 177 places, 111 transitions, 633 flow [2022-02-20 20:48:32,907 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=633, PETRI_PLACES=177, PETRI_TRANSITIONS=111} [2022-02-20 20:48:32,908 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 86 predicate places. [2022-02-20 20:48:32,909 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 177 places, 111 transitions, 633 flow [2022-02-20 20:48:33,036 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1802 states, 1794 states have (on average 2.411371237458194) internal successors, (4326), 1801 states have internal predecessors, (4326), 0 states have call successors, (0), 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:48:33,038 INFO L78 Accepts]: Start accepts. Automaton has has 1802 states, 1794 states have (on average 2.411371237458194) internal successors, (4326), 1801 states have internal predecessors, (4326), 0 states have call successors, (0), 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 77 [2022-02-20 20:48:33,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:48:33,039 INFO L470 AbstractCegarLoop]: Abstraction has has 177 places, 111 transitions, 633 flow [2022-02-20 20:48:33,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 65.8) internal successors, (658), 10 states have internal predecessors, (658), 0 states have call successors, (0), 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:48:33,039 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:48:33,040 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:48:33,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:48:33,040 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:48:33,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:48:33,041 INFO L85 PathProgramCache]: Analyzing trace with hash -801740280, now seen corresponding path program 1 times [2022-02-20 20:48:33,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:48:33,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592493368] [2022-02-20 20:48:33,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:48:33,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:48:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:48:33,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {9297#true} [209] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9297#true} is VALID [2022-02-20 20:48:33,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {9297#true} [184] 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] {9297#true} is VALID [2022-02-20 20:48:33,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {9297#true} [214] 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[] {9297#true} is VALID [2022-02-20 20:48:33,093 INFO L290 TraceCheckUtils]: 3: Hoare triple {9297#true} [216] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {9297#true} is VALID [2022-02-20 20:48:33,093 INFO L290 TraceCheckUtils]: 4: Hoare triple {9297#true} [172] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {9297#true} is VALID [2022-02-20 20:48:33,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {9297#true} [201] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {9297#true} is VALID [2022-02-20 20:48:33,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {9297#true} [199] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {9297#true} is VALID [2022-02-20 20:48:33,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {9297#true} [154] L21-3-->L21-4: Formula: (and (= 19 (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[] {9297#true} is VALID [2022-02-20 20:48:33,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {9297#true} [223] L21-4-->L38: Formula: (= v_~result_2~0_2 0) InVars {} OutVars{~result_2~0=v_~result_2~0_2} AuxVars[] AssignedVars[~result_2~0] {9297#true} is VALID [2022-02-20 20:48:33,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {9297#true} [224] L38-->L39: Formula: (= v_~result_3~0_2 0) InVars {} OutVars{~result_3~0=v_~result_3~0_2} AuxVars[] AssignedVars[~result_3~0] {9297#true} is VALID [2022-02-20 20:48:33,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {9297#true} [203] L39-->L39-1: Formula: (= v_~sponsored_0~0_7 0) InVars {} OutVars{~sponsored_0~0=v_~sponsored_0~0_7} AuxVars[] AssignedVars[~sponsored_0~0] {9297#true} is VALID [2022-02-20 20:48:33,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {9297#true} [161] L39-1-->L-1-3: Formula: (= v_~sponsored_1~0_7 0) InVars {} OutVars{~sponsored_1~0=v_~sponsored_1~0_7} AuxVars[] AssignedVars[~sponsored_1~0] {9297#true} is VALID [2022-02-20 20:48:33,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {9297#true} [219] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9297#true} is VALID [2022-02-20 20:48:33,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {9297#true} [192] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9297#true} is VALID [2022-02-20 20:48:33,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {9297#true} [149] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {9297#true} is VALID [2022-02-20 20:48:33,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {9297#true} [190] L-1-6-->L54: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_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~mem11#1=|v_ULTIMATE.start_main_#t~mem11#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~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {9297#true} is VALID [2022-02-20 20:48:33,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {9297#true} [130] L54-->L54-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] {9297#true} is VALID [2022-02-20 20:48:33,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {9297#true} [162] L54-1-->L54-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] {9297#true} is VALID [2022-02-20 20:48:33,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {9297#true} [144] L54-2-->L57: Formula: (= v_~sponsored_0~0_8 |v_ULTIMATE.start_main_#t~nondet5#1_2|) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} OutVars{~sponsored_0~0=v_~sponsored_0~0_8, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[~sponsored_0~0] {9297#true} is VALID [2022-02-20 20:48:33,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {9297#true} [225] L57-->L58: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {9297#true} is VALID [2022-02-20 20:48:33,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {9297#true} [183] L58-->L58-1: Formula: (= v_~sponsored_1~0_8 |v_ULTIMATE.start_main_#t~nondet6#1_2|) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} OutVars{~sponsored_1~0=v_~sponsored_1~0_8, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[~sponsored_1~0] {9297#true} is VALID [2022-02-20 20:48:33,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {9297#true} [143] L58-1-->L61: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {9297#true} is VALID [2022-02-20 20:48:33,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {9297#true} [134] L61-->L61-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {9297#true} is VALID [2022-02-20 20:48:33,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {9297#true} [189] L61-1-->L61-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {9297#true} is VALID [2022-02-20 20:48:33,096 INFO L290 TraceCheckUtils]: 24: Hoare triple {9297#true} [200] L61-2-->L61-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~pre7#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {9297#true} is VALID [2022-02-20 20:48:33,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {9297#true} [257] L61-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_10|, thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_10|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite1, thread1Thread1of1ForFork0_#t~ite2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] {9297#true} is VALID [2022-02-20 20:48:33,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {9297#true} [231] thread1ENTRY-->L42-2: Formula: (not (= (ite (not (= (mod v_~sponsored_0~0_2 256) 0)) 1 0) (ite (not (= (mod v_~sponsored_1~0_2 256) 0)) 1 0))) InVars {~sponsored_0~0=v_~sponsored_0~0_2, ~sponsored_1~0=v_~sponsored_1~0_2} OutVars{~sponsored_0~0=v_~sponsored_0~0_2, ~sponsored_1~0=v_~sponsored_1~0_2} AuxVars[] AssignedVars[] {9299#(or (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0) (= (* (div ~sponsored_0~0 256) 256) ~sponsored_0~0))} is VALID [2022-02-20 20:48:33,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {9299#(or (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0) (= (* (div ~sponsored_0~0 256) 256) ~sponsored_0~0))} [233] L42-2-->L42-3: Formula: (not (= (mod v_~sponsored_1~0_3 256) 0)) InVars {~sponsored_1~0=v_~sponsored_1~0_3} OutVars{~sponsored_1~0=v_~sponsored_1~0_3} AuxVars[] AssignedVars[] {9300#(and (not (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0)) (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0))} is VALID [2022-02-20 20:48:33,099 INFO L290 TraceCheckUtils]: 28: Hoare triple {9300#(and (not (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0)) (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0))} [197] L61-4-->L61-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {9300#(and (not (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0)) (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0))} is VALID [2022-02-20 20:48:33,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {9300#(and (not (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0)) (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0))} [166] L61-5-->L62: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {9300#(and (not (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0)) (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0))} is VALID [2022-02-20 20:48:33,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {9300#(and (not (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0)) (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0))} [220] L62-->L62-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {9300#(and (not (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0)) (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0))} is VALID [2022-02-20 20:48:33,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {9300#(and (not (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0)) (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0))} [207] L62-1-->L62-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {9300#(and (not (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0)) (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0))} is VALID [2022-02-20 20:48:33,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {9300#(and (not (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0)) (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0))} [171] L62-2-->L62-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre9#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {9300#(and (not (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0)) (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0))} is VALID [2022-02-20 20:48:33,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {9300#(and (not (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0)) (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0))} [259] L62-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_10|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_10|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~ite4, thread2Thread1of1ForFork1_#t~ite3, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] {9300#(and (not (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0)) (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0))} is VALID [2022-02-20 20:48:33,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {9300#(and (not (= (+ (* (- 256) (div ~sponsored_1~0 256)) ~sponsored_1~0) 0)) (= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0))} [244] thread2ENTRY-->L48-2: Formula: (not (= (ite (not (= (mod v_~sponsored_1~0_6 256) 0)) 1 0) (ite (not (= (mod v_~sponsored_0~0_5 256) 0)) 1 0))) InVars {~sponsored_1~0=v_~sponsored_1~0_6, ~sponsored_0~0=v_~sponsored_0~0_5} OutVars{~sponsored_1~0=v_~sponsored_1~0_6, ~sponsored_0~0=v_~sponsored_0~0_5} AuxVars[] AssignedVars[] {9301#(= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0)} is VALID [2022-02-20 20:48:33,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {9301#(= (+ (* (div ~sponsored_0~0 256) (- 256)) ~sponsored_0~0) 0)} [246] L48-2-->L48-3: Formula: (not (= (mod v_~sponsored_0~0_6 256) 0)) InVars {~sponsored_0~0=v_~sponsored_0~0_6} OutVars{~sponsored_0~0=v_~sponsored_0~0_6} AuxVars[] AssignedVars[] {9298#false} is VALID [2022-02-20 20:48:33,102 INFO L290 TraceCheckUtils]: 36: Hoare triple {9298#false} [249] L48-3-->L48-6: Formula: (= (- 1) |v_thread2Thread1of1ForFork1_#t~ite3_1|) InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite3] {9298#false} is VALID [2022-02-20 20:48:33,103 INFO L290 TraceCheckUtils]: 37: Hoare triple {9298#false} [236] L42-3-->L42-6: Formula: (= (- 1) |v_thread1Thread1of1ForFork0_#t~ite1_1|) InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite1] {9298#false} is VALID [2022-02-20 20:48:33,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {9298#false} [239] L42-6-->L42-7: Formula: (= |v_thread1Thread1of1ForFork0_#t~ite2_7| |v_thread1Thread1of1ForFork0_#t~ite1_5|) InVars {thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_5|} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_5|, thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite2] {9298#false} is VALID [2022-02-20 20:48:33,103 INFO L290 TraceCheckUtils]: 39: Hoare triple {9298#false} [235] L42-7-->L42-8: Formula: (= v_~result_2~0_1 |v_thread1Thread1of1ForFork0_#t~ite2_3|) InVars {thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_3|} OutVars{thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_3|, ~result_2~0=v_~result_2~0_1} AuxVars[] AssignedVars[~result_2~0] {9298#false} is VALID [2022-02-20 20:48:33,103 INFO L290 TraceCheckUtils]: 40: Hoare triple {9298#false} [238] L42-8-->L42-9: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite2=|v_thread1Thread1of1ForFork0_#t~ite2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite2] {9298#false} is VALID [2022-02-20 20:48:33,103 INFO L290 TraceCheckUtils]: 41: Hoare triple {9298#false} [240] L42-9-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ite1=|v_thread1Thread1of1ForFork0_#t~ite1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ite1] {9298#false} is VALID [2022-02-20 20:48:33,103 INFO L290 TraceCheckUtils]: 42: Hoare triple {9298#false} [241] L44-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] {9298#false} is VALID [2022-02-20 20:48:33,103 INFO L290 TraceCheckUtils]: 43: Hoare triple {9298#false} [242] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9298#false} is VALID [2022-02-20 20:48:33,104 INFO L290 TraceCheckUtils]: 44: Hoare triple {9298#false} [142] L62-4-->L62-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {9298#false} is VALID [2022-02-20 20:48:33,104 INFO L290 TraceCheckUtils]: 45: Hoare triple {9298#false} [222] L62-5-->L63: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] {9298#false} is VALID [2022-02-20 20:48:33,104 INFO L290 TraceCheckUtils]: 46: Hoare triple {9298#false} [135] L63-->L63-1: Formula: (= |v_ULTIMATE.start_main_#t~mem11#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_2|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {9298#false} is VALID [2022-02-20 20:48:33,104 INFO L290 TraceCheckUtils]: 47: Hoare triple {9298#false} [260] thread1EXIT-->L63-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {9298#false} is VALID [2022-02-20 20:48:33,104 INFO L290 TraceCheckUtils]: 48: Hoare triple {9298#false} [156] L63-2-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {9298#false} is VALID [2022-02-20 20:48:33,104 INFO L290 TraceCheckUtils]: 49: Hoare triple {9298#false} [158] L64-->L64-1: Formula: (= (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) |v_ULTIMATE.start_main_#t~mem12#1_2|) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {9298#false} is VALID [2022-02-20 20:48:33,104 INFO L290 TraceCheckUtils]: 50: Hoare triple {9298#false} [252] L48-6-->L48-7: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite4_7| |v_thread2Thread1of1ForFork1_#t~ite3_5|) InVars {thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_5|} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_7|, thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite4] {9298#false} is VALID [2022-02-20 20:48:33,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {9298#false} [248] L48-7-->L48-8: Formula: (= |v_thread2Thread1of1ForFork1_#t~ite4_3| v_~result_3~0_1) InVars {thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_3|} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_3|, ~result_3~0=v_~result_3~0_1} AuxVars[] AssignedVars[~result_3~0] {9298#false} is VALID [2022-02-20 20:48:33,105 INFO L290 TraceCheckUtils]: 52: Hoare triple {9298#false} [251] L48-8-->L48-9: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite4=|v_thread2Thread1of1ForFork1_#t~ite4_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite4] {9298#false} is VALID [2022-02-20 20:48:33,105 INFO L290 TraceCheckUtils]: 53: Hoare triple {9298#false} [253] L48-9-->L50: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~ite3=|v_thread2Thread1of1ForFork1_#t~ite3_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite3] {9298#false} is VALID [2022-02-20 20:48:33,105 INFO L290 TraceCheckUtils]: 54: Hoare triple {9298#false} [254] L50-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_1| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_1|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] {9298#false} is VALID [2022-02-20 20:48:33,105 INFO L290 TraceCheckUtils]: 55: Hoare triple {9298#false} [255] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9298#false} is VALID [2022-02-20 20:48:33,105 INFO L290 TraceCheckUtils]: 56: Hoare triple {9298#false} [261] thread2EXIT-->L64-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem12#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {9298#false} is VALID [2022-02-20 20:48:33,105 INFO L290 TraceCheckUtils]: 57: Hoare triple {9298#false} [228] L64-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {9298#false} is VALID [2022-02-20 20:48:33,106 INFO L290 TraceCheckUtils]: 58: Hoare triple {9298#false} [177] L66-->L66-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9298#false} is VALID [2022-02-20 20:48:33,106 INFO L290 TraceCheckUtils]: 59: Hoare triple {9298#false} [217] L66-1-->L66-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (and (< 0 v_~result_3~0_3) (< v_~result_2~0_3 0))) 1 0)) InVars {~result_3~0=v_~result_3~0_3, ~result_2~0=v_~result_2~0_3} OutVars{~result_3~0=v_~result_3~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|, ~result_2~0=v_~result_2~0_3} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {9298#false} is VALID [2022-02-20 20:48:33,106 INFO L290 TraceCheckUtils]: 60: Hoare triple {9298#false} [186] L66-2-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {9298#false} is VALID [2022-02-20 20:48:33,106 INFO L290 TraceCheckUtils]: 61: Hoare triple {9298#false} [170] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {9298#false} is VALID [2022-02-20 20:48:33,106 INFO L290 TraceCheckUtils]: 62: Hoare triple {9298#false} [205] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {9298#false} is VALID [2022-02-20 20:48:33,106 INFO L290 TraceCheckUtils]: 63: Hoare triple {9298#false} [193] L34-1-->L67: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9298#false} is VALID [2022-02-20 20:48:33,106 INFO L290 TraceCheckUtils]: 64: Hoare triple {9298#false} [208] L67-->L67-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9298#false} is VALID [2022-02-20 20:48:33,107 INFO L290 TraceCheckUtils]: 65: Hoare triple {9298#false} [167] L67-1-->L67-2: Formula: (= (ite (not (and (< v_~result_3~0_4 0) (< 0 v_~result_2~0_4))) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {~result_3~0=v_~result_3~0_4, ~result_2~0=v_~result_2~0_4} OutVars{~result_3~0=v_~result_3~0_4, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|, ~result_2~0=v_~result_2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {9298#false} is VALID [2022-02-20 20:48:33,107 INFO L290 TraceCheckUtils]: 66: Hoare triple {9298#false} [146] L67-2-->L34-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {9298#false} is VALID [2022-02-20 20:48:33,107 INFO L290 TraceCheckUtils]: 67: Hoare triple {9298#false} [185] L34-2-->L35-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {9298#false} is VALID [2022-02-20 20:48:33,107 INFO L290 TraceCheckUtils]: 68: Hoare triple {9298#false} [141] L35-3-->L34-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] {9298#false} is VALID [2022-02-20 20:48:33,107 INFO L290 TraceCheckUtils]: 69: Hoare triple {9298#false} [153] L34-3-->L68: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9298#false} is VALID [2022-02-20 20:48:33,107 INFO L290 TraceCheckUtils]: 70: Hoare triple {9298#false} [212] L68-->L68-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9298#false} is VALID [2022-02-20 20:48:33,108 INFO L290 TraceCheckUtils]: 71: Hoare triple {9298#false} [164] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (not (and (= v_~result_3~0_5 0) (= v_~result_2~0_5 0))) 1 0)) InVars {~result_3~0=v_~result_3~0_5, ~result_2~0=v_~result_2~0_5} OutVars{~result_3~0=v_~result_3~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|, ~result_2~0=v_~result_2~0_5} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {9298#false} is VALID [2022-02-20 20:48:33,108 INFO L290 TraceCheckUtils]: 72: Hoare triple {9298#false} [138] L68-2-->L34-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {9298#false} is VALID [2022-02-20 20:48:33,108 INFO L290 TraceCheckUtils]: 73: Hoare triple {9298#false} [131] L34-4-->L35-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {9298#false} is VALID [2022-02-20 20:48:33,108 INFO L290 TraceCheckUtils]: 74: Hoare triple {9298#false} [227] L35-6-->L34-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] {9298#false} is VALID [2022-02-20 20:48:33,108 INFO L290 TraceCheckUtils]: 75: Hoare triple {9298#false} [168] L34-5-->L69: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9298#false} is VALID [2022-02-20 20:48:33,108 INFO L290 TraceCheckUtils]: 76: Hoare triple {9298#false} [147] L69-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9298#false} is VALID [2022-02-20 20:48:33,109 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:48:33,109 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:48:33,109 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592493368] [2022-02-20 20:48:33,109 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592493368] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:48:33,110 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:48:33,110 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:48:33,110 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861110573] [2022-02-20 20:48:33,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:48:33,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 20:48:33,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:48:33,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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:48:33,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:48:33,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:48:33,152 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:48:33,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:48:33,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:48:33,153 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 102 [2022-02-20 20:48:33,154 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 111 transitions, 633 flow. Second operand has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 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:48:33,154 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:48:33,154 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 102 [2022-02-20 20:48:33,154 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:48:33,631 INFO L129 PetriNetUnfolder]: 65/441 cut-off events. [2022-02-20 20:48:33,631 INFO L130 PetriNetUnfolder]: For 2914/2925 co-relation queries the response was YES. [2022-02-20 20:48:33,634 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1726 conditions, 441 events. 65/441 cut-off events. For 2914/2925 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2327 event pairs, 44 based on Foata normal form. 8/425 useless extension candidates. Maximal degree in co-relation 1670. Up to 50 conditions per place. [2022-02-20 20:48:33,635 INFO L132 encePairwiseOnDemand]: 94/102 looper letters, 20 selfloop transitions, 8 changer transitions 0/123 dead transitions. [2022-02-20 20:48:33,636 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 123 transitions, 723 flow [2022-02-20 20:48:33,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 20:48:33,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-02-20 20:48:33,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-02-20 20:48:33,648 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8627450980392157 [2022-02-20 20:48:33,649 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 440 transitions. [2022-02-20 20:48:33,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 440 transitions. [2022-02-20 20:48:33,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:48:33,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 440 transitions. [2022-02-20 20:48:33,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 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:48:33,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 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:48:33,651 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 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:48:33,651 INFO L186 Difference]: Start difference. First operand has 177 places, 111 transitions, 633 flow. Second operand 5 states and 440 transitions. [2022-02-20 20:48:33,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 123 transitions, 723 flow