./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/security.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/security.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 417dec4be084b2867b601c43d125afd61f7d3912bd17641ca10c0f094ab6abe0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:57:43,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:57:43,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:57:43,930 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:57:43,930 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:57:43,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:57:43,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:57:43,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:57:43,937 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:57:43,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:57:43,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:57:43,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:57:43,942 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:57:43,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:57:43,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:57:43,947 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:57:43,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:57:43,948 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:57:43,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:57:43,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:57:43,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:57:43,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:57:43,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:57:43,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:57:43,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:57:43,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:57:43,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:57:43,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:57:43,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:57:43,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:57:43,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:57:43,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:57:43,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:57:43,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:57:43,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:57:43,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:57:43,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:57:43,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:57:43,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:57:43,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:57:43,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:57:43,970 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:57:43,992 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:57:43,992 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:57:43,993 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:57:43,993 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:57:43,993 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:57:43,994 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:57:43,994 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:57:43,994 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:57:43,994 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:57:43,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:57:43,995 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:57:43,995 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:57:43,995 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:57:43,996 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:57:43,996 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:57:43,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:57:43,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:57:43,996 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:57:43,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:57:43,996 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:57:43,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:57:43,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:57:43,997 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:57:43,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:57:43,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:57:43,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:57:43,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:57:43,998 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:57:43,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:57:43,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:57:43,998 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:57:43,998 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:57:43,999 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:57:43,999 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 -> 417dec4be084b2867b601c43d125afd61f7d3912bd17641ca10c0f094ab6abe0 [2022-02-20 20:57:44,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:57:44,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:57:44,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:57:44,214 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:57:44,215 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:57:44,216 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/security.wvr.c [2022-02-20 20:57:44,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a626e1f20/3d21836a88244072a0affa94309a77f9/FLAGc1cf9c918 [2022-02-20 20:57:44,606 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:57:44,606 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/security.wvr.c [2022-02-20 20:57:44,621 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a626e1f20/3d21836a88244072a0affa94309a77f9/FLAGc1cf9c918 [2022-02-20 20:57:44,632 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a626e1f20/3d21836a88244072a0affa94309a77f9 [2022-02-20 20:57:44,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:57:44,637 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:57:44,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:57:44,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:57:44,642 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:57:44,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:57:44" (1/1) ... [2022-02-20 20:57:44,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4001789d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:57:44, skipping insertion in model container [2022-02-20 20:57:44,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:57:44" (1/1) ... [2022-02-20 20:57:44,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:57:44,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:57:44,827 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/security.wvr.c[1931,1944] [2022-02-20 20:57:44,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:57:44,835 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:57:44,853 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/security.wvr.c[1931,1944] [2022-02-20 20:57:44,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:57:44,866 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:57:44,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:57:44 WrapperNode [2022-02-20 20:57:44,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:57:44,868 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:57:44,868 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:57:44,868 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:57:44,872 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:57:44" (1/1) ... [2022-02-20 20:57:44,878 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:57:44" (1/1) ... [2022-02-20 20:57:44,897 INFO L137 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2022-02-20 20:57:44,897 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:57:44,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:57:44,898 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:57:44,898 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:57:44,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:57:44" (1/1) ... [2022-02-20 20:57:44,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:57:44" (1/1) ... [2022-02-20 20:57:44,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:57:44" (1/1) ... [2022-02-20 20:57:44,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:57:44" (1/1) ... [2022-02-20 20:57:44,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:57:44" (1/1) ... [2022-02-20 20:57:44,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:57:44" (1/1) ... [2022-02-20 20:57:44,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:57:44" (1/1) ... [2022-02-20 20:57:44,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:57:44,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:57:44,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:57:44,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:57:44,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:57:44" (1/1) ... [2022-02-20 20:57:44,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:57:44,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:57:44,949 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:57:44,976 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:57:44,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:57:44,991 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-02-20 20:57:44,991 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-02-20 20:57:44,991 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-02-20 20:57:44,991 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-02-20 20:57:44,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:57:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:57:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:57:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:57:44,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:57:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 20:57:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:57:44,993 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:57:45,082 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:57:45,083 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:57:45,214 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:57:45,218 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:57:45,218 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:57:45,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:57:45 BoogieIcfgContainer [2022-02-20 20:57:45,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:57:45,221 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:57:45,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:57:45,222 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:57:45,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:57:44" (1/3) ... [2022-02-20 20:57:45,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb4f7d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:57:45, skipping insertion in model container [2022-02-20 20:57:45,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:57:44" (2/3) ... [2022-02-20 20:57:45,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb4f7d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:57:45, skipping insertion in model container [2022-02-20 20:57:45,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:57:45" (3/3) ... [2022-02-20 20:57:45,224 INFO L111 eAbstractionObserver]: Analyzing ICFG security.wvr.c [2022-02-20 20:57:45,227 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:57:45,228 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:57:45,228 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:57:45,228 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:57:45,269 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,269 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,270 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,270 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,270 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,271 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,271 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,271 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,272 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,272 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,272 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,274 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,275 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,280 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,280 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,281 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,282 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,282 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,282 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,283 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,283 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,283 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,284 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,284 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,288 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,289 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,289 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,291 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,291 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,291 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:57:45,299 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-02-20 20:57:45,326 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:57:45,330 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:57:45,330 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 20:57:45,337 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 81 transitions, 178 flow [2022-02-20 20:57:45,362 INFO L129 PetriNetUnfolder]: 3/79 cut-off events. [2022-02-20 20:57:45,363 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-02-20 20:57:45,364 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 79 events. 3/79 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2022-02-20 20:57:45,365 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 81 transitions, 178 flow [2022-02-20 20:57:45,367 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 70 transitions, 152 flow [2022-02-20 20:57:45,380 INFO L129 PetriNetUnfolder]: 3/69 cut-off events. [2022-02-20 20:57:45,380 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-02-20 20:57:45,381 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:57:45,381 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] [2022-02-20 20:57:45,382 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:57:45,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:57:45,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1803071327, now seen corresponding path program 1 times [2022-02-20 20:57:45,391 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:57:45,391 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261700718] [2022-02-20 20:57:45,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:57:45,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:57:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:57:45,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {88#true} [149] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-02-20 20:57:45,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {88#true} [129] 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] {88#true} is VALID [2022-02-20 20:57:45,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {88#true} [154] 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[] {88#true} is VALID [2022-02-20 20:57:45,872 INFO L290 TraceCheckUtils]: 3: Hoare triple {88#true} [156] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {88#true} is VALID [2022-02-20 20:57:45,872 INFO L290 TraceCheckUtils]: 4: Hoare triple {88#true} [120] 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[] {88#true} is VALID [2022-02-20 20:57:45,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {88#true} [144] 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[] {88#true} is VALID [2022-02-20 20:57:45,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {88#true} [142] 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[] {88#true} is VALID [2022-02-20 20:57:45,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {88#true} [106] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 15 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {88#true} is VALID [2022-02-20 20:57:45,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {88#true} [164] L21-4-->L38: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] {88#true} is VALID [2022-02-20 20:57:45,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {88#true} [165] L38-->L38-1: Formula: (= v_~x1~0_4 0) InVars {} OutVars{~x1~0=v_~x1~0_4} AuxVars[] AssignedVars[~x1~0] {88#true} is VALID [2022-02-20 20:57:45,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {88#true} [107] L38-1-->L38-2: Formula: (= v_~z1~0_3 0) InVars {} OutVars{~z1~0=v_~z1~0_3} AuxVars[] AssignedVars[~z1~0] {88#true} is VALID [2022-02-20 20:57:45,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {88#true} [151] L38-2-->L38-3: Formula: (= v_~l1~0_2 0) InVars {} OutVars{~l1~0=v_~l1~0_2} AuxVars[] AssignedVars[~l1~0] {88#true} is VALID [2022-02-20 20:57:45,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {88#true} [127] L38-3-->L38-4: Formula: (= v_~x2~0_4 0) InVars {} OutVars{~x2~0=v_~x2~0_4} AuxVars[] AssignedVars[~x2~0] {88#true} is VALID [2022-02-20 20:57:45,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {88#true} [98] L38-4-->L38-5: Formula: (= v_~z2~0_3 0) InVars {} OutVars{~z2~0=v_~z2~0_3} AuxVars[] AssignedVars[~z2~0] {88#true} is VALID [2022-02-20 20:57:45,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {88#true} [97] L38-5-->L-1-3: Formula: (= v_~l2~0_2 0) InVars {} OutVars{~l2~0=v_~l2~0_2} AuxVars[] AssignedVars[~l2~0] {88#true} is VALID [2022-02-20 20:57:45,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {88#true} [161] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-02-20 20:57:45,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {88#true} [139] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-02-20 20:57:45,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {88#true} [104] 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] {88#true} is VALID [2022-02-20 20:57:45,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {88#true} [137] L-1-6-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {88#true} is VALID [2022-02-20 20:57:45,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {88#true} [126] L66-->L66-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] {88#true} is VALID [2022-02-20 20:57:45,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {88#true} [157] L66-1-->L66-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] {88#true} is VALID [2022-02-20 20:57:45,875 INFO L290 TraceCheckUtils]: 21: Hoare triple {88#true} [132] L66-2-->L68: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_2| v_~y~0_4) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~y~0=v_~y~0_4} AuxVars[] AssignedVars[~y~0] {88#true} is VALID [2022-02-20 20:57:45,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {88#true} [152] L68-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {88#true} is VALID [2022-02-20 20:57:45,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {88#true} [168] L70-->L70-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {88#true} is VALID [2022-02-20 20:57:45,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {88#true} [117] L70-1-->L70-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {88#true} is VALID [2022-02-20 20:57:45,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {88#true} [116] L70-2-->L70-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {88#true} is VALID [2022-02-20 20:57:45,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {88#true} [193] L70-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{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, thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_10|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~nondet1] {88#true} is VALID [2022-02-20 20:57:45,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {88#true} [172] thread1ENTRY-->L43: Formula: (= v_~z1~0_1 1) InVars {} OutVars{~z1~0=v_~z1~0_1} AuxVars[] AssignedVars[~z1~0] {88#true} is VALID [2022-02-20 20:57:45,877 INFO L290 TraceCheckUtils]: 28: Hoare triple {88#true} [173] L43-->L43-1: Formula: (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1_1| 256) 0)) InVars {thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} AuxVars[] AssignedVars[] {88#true} is VALID [2022-02-20 20:57:45,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {88#true} [175] L43-1-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1] {88#true} is VALID [2022-02-20 20:57:45,878 INFO L290 TraceCheckUtils]: 30: Hoare triple {88#true} [177] L44-->L43-4: Formula: (= v_~x1~0_1 1) InVars {} OutVars{~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[~x1~0] {90#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:57:45,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {90#(= (+ (- 1) ~x1~0) 0)} [179] L43-4-->L50: Formula: (= (+ v_~x1~0_3 v_~y~0_1) v_~l1~0_1) InVars {~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} OutVars{~l1~0=v_~l1~0_1, ~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~l1~0] {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:45,879 INFO L290 TraceCheckUtils]: 32: Hoare triple {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [180] L50-->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] {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:45,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [181] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:45,880 INFO L290 TraceCheckUtils]: 34: Hoare triple {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [105] L70-4-->L70-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:45,881 INFO L290 TraceCheckUtils]: 35: Hoare triple {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [150] L70-5-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:45,881 INFO L290 TraceCheckUtils]: 36: Hoare triple {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [99] L71-->L71-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:45,882 INFO L290 TraceCheckUtils]: 37: Hoare triple {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [110] L71-1-->L71-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:45,882 INFO L290 TraceCheckUtils]: 38: Hoare triple {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [155] L71-2-->L71-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~pre6#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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] {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:45,883 INFO L290 TraceCheckUtils]: 39: Hoare triple {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [195] L71-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_10|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~nondet2, thread2Thread1of1ForFork1_thidvar1] {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:45,883 INFO L290 TraceCheckUtils]: 40: Hoare triple {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [103] L71-4-->L71-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:45,884 INFO L290 TraceCheckUtils]: 41: Hoare triple {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [136] L71-5-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:45,884 INFO L290 TraceCheckUtils]: 42: Hoare triple {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [167] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:45,885 INFO L290 TraceCheckUtils]: 43: Hoare triple {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [196] thread1EXIT-->L72-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem8#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:45,886 INFO L290 TraceCheckUtils]: 44: Hoare triple {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [100] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:45,886 INFO L290 TraceCheckUtils]: 45: Hoare triple {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [122] L73-->L73-1: Formula: (= |v_ULTIMATE.start_main_#t~mem9#1_2| (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|)) 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_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_2|, 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|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:45,887 INFO L290 TraceCheckUtils]: 46: Hoare triple {91#(and (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [182] thread2ENTRY-->L55: Formula: (= v_~z2~0_2 1) InVars {} OutVars{~z2~0=v_~z2~0_2} AuxVars[] AssignedVars[~z2~0] {92#(and (= ~z2~0 1) (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:45,887 INFO L290 TraceCheckUtils]: 47: Hoare triple {92#(and (= ~z2~0 1) (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [184] L55-->L55-3: Formula: (= (mod |v_thread2Thread1of1ForFork1_#t~nondet2_3| 256) 0) InVars {thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} AuxVars[] AssignedVars[] {92#(and (= ~z2~0 1) (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:45,888 INFO L290 TraceCheckUtils]: 48: Hoare triple {92#(and (= ~z2~0 1) (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [186] L55-3-->L58: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet2] {92#(and (= ~z2~0 1) (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:45,888 INFO L290 TraceCheckUtils]: 49: Hoare triple {92#(and (= ~z2~0 1) (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [188] L58-->L55-4: Formula: (= v_~x2~0_2 v_~z2~0_1) InVars {~z2~0=v_~z2~0_1} OutVars{~x2~0=v_~x2~0_2, ~z2~0=v_~z2~0_1} AuxVars[] AssignedVars[~x2~0] {93#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:45,889 INFO L290 TraceCheckUtils]: 50: Hoare triple {93#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [189] L55-4-->L62: Formula: (= v_~l2~0_1 (+ v_~x2~0_3 v_~y~0_2)) InVars {~y~0=v_~y~0_2, ~x2~0=v_~x2~0_3} OutVars{~x2~0=v_~x2~0_3, ~y~0=v_~y~0_2, ~l2~0=v_~l2~0_1} AuxVars[] AssignedVars[~l2~0] {94#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:57:45,890 INFO L290 TraceCheckUtils]: 51: Hoare triple {94#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [190] L62-->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] {94#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:57:45,891 INFO L290 TraceCheckUtils]: 52: Hoare triple {94#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [191] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:57:45,892 INFO L290 TraceCheckUtils]: 53: Hoare triple {94#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [197] thread2EXIT-->L73-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem9#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {94#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:57:45,892 INFO L290 TraceCheckUtils]: 54: Hoare triple {94#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [123] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {94#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:57:45,893 INFO L290 TraceCheckUtils]: 55: Hoare triple {94#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [159] L75-->L75-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:57:45,894 INFO L290 TraceCheckUtils]: 56: Hoare triple {94#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [119] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (= (mod v_~l1~0_3 4294967296) (mod v_~l2~0_3 4294967296))) 1 0)) InVars {~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3} OutVars{~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {95#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:57:45,894 INFO L290 TraceCheckUtils]: 57: Hoare triple {95#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [143] L75-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] {95#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:57:45,895 INFO L290 TraceCheckUtils]: 58: Hoare triple {95#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [118] 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] {96#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:57:45,895 INFO L290 TraceCheckUtils]: 59: Hoare triple {96#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [146] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {89#false} is VALID [2022-02-20 20:57:45,895 INFO L290 TraceCheckUtils]: 60: Hoare triple {89#false} [140] L34-1-->L76: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89#false} is VALID [2022-02-20 20:57:45,896 INFO L290 TraceCheckUtils]: 61: Hoare triple {89#false} [169] L76-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89#false} is VALID [2022-02-20 20:57:45,897 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:57:45,897 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:57:45,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261700718] [2022-02-20 20:57:45,898 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261700718] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:57:45,898 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:57:45,898 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:57:45,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249573603] [2022-02-20 20:57:45,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:57:45,907 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 20:57:45,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:57:45,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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:57:45,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:57:45,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:57:45,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:57:45,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:57:45,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:57:45,984 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 81 [2022-02-20 20:57:45,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 70 transitions, 152 flow. Second operand has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 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:57:45,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:57:45,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 81 [2022-02-20 20:57:45,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:57:46,534 INFO L129 PetriNetUnfolder]: 32/219 cut-off events. [2022-02-20 20:57:46,534 INFO L130 PetriNetUnfolder]: For 57/60 co-relation queries the response was YES. [2022-02-20 20:57:46,537 INFO L84 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 219 events. 32/219 cut-off events. For 57/60 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 894 event pairs, 11 based on Foata normal form. 5/212 useless extension candidates. Maximal degree in co-relation 170. Up to 47 conditions per place. [2022-02-20 20:57:46,539 INFO L132 encePairwiseOnDemand]: 70/81 looper letters, 34 selfloop transitions, 2 changer transitions 24/106 dead transitions. [2022-02-20 20:57:46,539 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 106 transitions, 377 flow [2022-02-20 20:57:46,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 20:57:46,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-02-20 20:57:46,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 906 transitions. [2022-02-20 20:57:46,566 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.745679012345679 [2022-02-20 20:57:46,566 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 906 transitions. [2022-02-20 20:57:46,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 906 transitions. [2022-02-20 20:57:46,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:57:46,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 906 transitions. [2022-02-20 20:57:46,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 60.4) internal successors, (906), 15 states have internal predecessors, (906), 0 states have call successors, (0), 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:57:46,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 81.0) internal successors, (1296), 16 states have internal predecessors, (1296), 0 states have call successors, (0), 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:57:46,577 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 81.0) internal successors, (1296), 16 states have internal predecessors, (1296), 0 states have call successors, (0), 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:57:46,578 INFO L186 Difference]: Start difference. First operand has 74 places, 70 transitions, 152 flow. Second operand 15 states and 906 transitions. [2022-02-20 20:57:46,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 106 transitions, 377 flow [2022-02-20 20:57:46,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 106 transitions, 347 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-02-20 20:57:46,584 INFO L242 Difference]: Finished difference. Result has 95 places, 69 transitions, 175 flow [2022-02-20 20:57:46,585 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=175, PETRI_PLACES=95, PETRI_TRANSITIONS=69} [2022-02-20 20:57:46,587 INFO L334 CegarLoopForPetriNet]: 74 programPoint places, 21 predicate places. [2022-02-20 20:57:46,588 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 69 transitions, 175 flow [2022-02-20 20:57:46,615 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 749 states, 745 states have (on average 2.4120805369127516) internal successors, (1797), 748 states have internal predecessors, (1797), 0 states have call successors, (0), 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:57:46,618 INFO L78 Accepts]: Start accepts. Automaton has has 749 states, 745 states have (on average 2.4120805369127516) internal successors, (1797), 748 states have internal predecessors, (1797), 0 states have call successors, (0), 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 62 [2022-02-20 20:57:46,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:57:46,619 INFO L470 AbstractCegarLoop]: Abstraction has has 95 places, 69 transitions, 175 flow [2022-02-20 20:57:46,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 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:57:46,619 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:57:46,620 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] [2022-02-20 20:57:46,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:57:46,620 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:57:46,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:57:46,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1262948190, now seen corresponding path program 1 times [2022-02-20 20:57:46,621 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:57:46,621 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399174132] [2022-02-20 20:57:46,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:57:46,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:57:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:57:46,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {881#true} [149] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {881#true} is VALID [2022-02-20 20:57:46,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#true} [129] 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] {881#true} is VALID [2022-02-20 20:57:46,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#true} [154] 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[] {881#true} is VALID [2022-02-20 20:57:46,814 INFO L290 TraceCheckUtils]: 3: Hoare triple {881#true} [156] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {881#true} is VALID [2022-02-20 20:57:46,814 INFO L290 TraceCheckUtils]: 4: Hoare triple {881#true} [120] 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[] {881#true} is VALID [2022-02-20 20:57:46,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {881#true} [144] 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[] {881#true} is VALID [2022-02-20 20:57:46,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {881#true} [142] 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[] {881#true} is VALID [2022-02-20 20:57:46,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {881#true} [106] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 15 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {881#true} is VALID [2022-02-20 20:57:46,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {881#true} [164] L21-4-->L38: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] {881#true} is VALID [2022-02-20 20:57:46,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {881#true} [165] L38-->L38-1: Formula: (= v_~x1~0_4 0) InVars {} OutVars{~x1~0=v_~x1~0_4} AuxVars[] AssignedVars[~x1~0] {881#true} is VALID [2022-02-20 20:57:46,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {881#true} [107] L38-1-->L38-2: Formula: (= v_~z1~0_3 0) InVars {} OutVars{~z1~0=v_~z1~0_3} AuxVars[] AssignedVars[~z1~0] {881#true} is VALID [2022-02-20 20:57:46,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {881#true} [151] L38-2-->L38-3: Formula: (= v_~l1~0_2 0) InVars {} OutVars{~l1~0=v_~l1~0_2} AuxVars[] AssignedVars[~l1~0] {881#true} is VALID [2022-02-20 20:57:46,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {881#true} [127] L38-3-->L38-4: Formula: (= v_~x2~0_4 0) InVars {} OutVars{~x2~0=v_~x2~0_4} AuxVars[] AssignedVars[~x2~0] {881#true} is VALID [2022-02-20 20:57:46,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {881#true} [98] L38-4-->L38-5: Formula: (= v_~z2~0_3 0) InVars {} OutVars{~z2~0=v_~z2~0_3} AuxVars[] AssignedVars[~z2~0] {881#true} is VALID [2022-02-20 20:57:46,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {881#true} [97] L38-5-->L-1-3: Formula: (= v_~l2~0_2 0) InVars {} OutVars{~l2~0=v_~l2~0_2} AuxVars[] AssignedVars[~l2~0] {881#true} is VALID [2022-02-20 20:57:46,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {881#true} [161] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {881#true} is VALID [2022-02-20 20:57:46,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {881#true} [139] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {881#true} is VALID [2022-02-20 20:57:46,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {881#true} [104] 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] {881#true} is VALID [2022-02-20 20:57:46,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {881#true} [137] L-1-6-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {881#true} is VALID [2022-02-20 20:57:46,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {881#true} [126] L66-->L66-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] {881#true} is VALID [2022-02-20 20:57:46,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {881#true} [157] L66-1-->L66-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] {881#true} is VALID [2022-02-20 20:57:46,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {881#true} [132] L66-2-->L68: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_2| v_~y~0_4) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~y~0=v_~y~0_4} AuxVars[] AssignedVars[~y~0] {881#true} is VALID [2022-02-20 20:57:46,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {881#true} [152] L68-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {881#true} is VALID [2022-02-20 20:57:46,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {881#true} [168] L70-->L70-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {881#true} is VALID [2022-02-20 20:57:46,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {881#true} [117] L70-1-->L70-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {881#true} is VALID [2022-02-20 20:57:46,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {881#true} [116] L70-2-->L70-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {881#true} is VALID [2022-02-20 20:57:46,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {881#true} [193] L70-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{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, thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_10|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~nondet1] {881#true} is VALID [2022-02-20 20:57:46,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {881#true} [172] thread1ENTRY-->L43: Formula: (= v_~z1~0_1 1) InVars {} OutVars{~z1~0=v_~z1~0_1} AuxVars[] AssignedVars[~z1~0] {881#true} is VALID [2022-02-20 20:57:46,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {881#true} [173] L43-->L43-1: Formula: (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1_1| 256) 0)) InVars {thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} AuxVars[] AssignedVars[] {881#true} is VALID [2022-02-20 20:57:46,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {881#true} [175] L43-1-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1] {881#true} is VALID [2022-02-20 20:57:46,819 INFO L290 TraceCheckUtils]: 30: Hoare triple {881#true} [177] L44-->L43-4: Formula: (= v_~x1~0_1 1) InVars {} OutVars{~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[~x1~0] {883#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:57:46,820 INFO L290 TraceCheckUtils]: 31: Hoare triple {883#(= (+ (- 1) ~x1~0) 0)} [105] L70-4-->L70-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {883#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:57:46,820 INFO L290 TraceCheckUtils]: 32: Hoare triple {883#(= (+ (- 1) ~x1~0) 0)} [150] L70-5-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {883#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:57:46,820 INFO L290 TraceCheckUtils]: 33: Hoare triple {883#(= (+ (- 1) ~x1~0) 0)} [99] L71-->L71-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {883#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:57:46,821 INFO L290 TraceCheckUtils]: 34: Hoare triple {883#(= (+ (- 1) ~x1~0) 0)} [110] L71-1-->L71-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {883#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:57:46,821 INFO L290 TraceCheckUtils]: 35: Hoare triple {883#(= (+ (- 1) ~x1~0) 0)} [155] L71-2-->L71-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~pre6#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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] {883#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:57:46,822 INFO L290 TraceCheckUtils]: 36: Hoare triple {883#(= (+ (- 1) ~x1~0) 0)} [195] L71-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_10|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~nondet2, thread2Thread1of1ForFork1_thidvar1] {883#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:57:46,822 INFO L290 TraceCheckUtils]: 37: Hoare triple {883#(= (+ (- 1) ~x1~0) 0)} [182] thread2ENTRY-->L55: Formula: (= v_~z2~0_2 1) InVars {} OutVars{~z2~0=v_~z2~0_2} AuxVars[] AssignedVars[~z2~0] {883#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:57:46,822 INFO L290 TraceCheckUtils]: 38: Hoare triple {883#(= (+ (- 1) ~x1~0) 0)} [183] L55-->L55-1: Formula: (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet2_1| 256) 0)) InVars {thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_1|} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_1|} AuxVars[] AssignedVars[] {883#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:57:46,823 INFO L290 TraceCheckUtils]: 39: Hoare triple {883#(= (+ (- 1) ~x1~0) 0)} [185] L55-1-->L56: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet2] {883#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:57:46,823 INFO L290 TraceCheckUtils]: 40: Hoare triple {883#(= (+ (- 1) ~x1~0) 0)} [187] L56-->L55-4: Formula: (= v_~x2~0_1 1) InVars {} OutVars{~x2~0=v_~x2~0_1} AuxVars[] AssignedVars[~x2~0] {884#(and (= (+ (- 1) ~x2~0) 0) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:57:46,824 INFO L290 TraceCheckUtils]: 41: Hoare triple {884#(and (= (+ (- 1) ~x2~0) 0) (= (+ (- 1) ~x1~0) 0))} [189] L55-4-->L62: Formula: (= v_~l2~0_1 (+ v_~x2~0_3 v_~y~0_2)) InVars {~y~0=v_~y~0_2, ~x2~0=v_~x2~0_3} OutVars{~x2~0=v_~x2~0_3, ~y~0=v_~y~0_2, ~l2~0=v_~l2~0_1} AuxVars[] AssignedVars[~l2~0] {885#(and (<= ~l2~0 (+ ~y~0 1)) (= (+ (- 1) ~x1~0) 0) (<= (+ ~y~0 1) ~l2~0))} is VALID [2022-02-20 20:57:46,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {885#(and (<= ~l2~0 (+ ~y~0 1)) (= (+ (- 1) ~x1~0) 0) (<= (+ ~y~0 1) ~l2~0))} [179] L43-4-->L50: Formula: (= (+ v_~x1~0_3 v_~y~0_1) v_~l1~0_1) InVars {~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} OutVars{~l1~0=v_~l1~0_1, ~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~l1~0] {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:57:46,825 INFO L290 TraceCheckUtils]: 43: Hoare triple {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [180] L50-->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] {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:57:46,826 INFO L290 TraceCheckUtils]: 44: Hoare triple {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [181] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:57:46,826 INFO L290 TraceCheckUtils]: 45: Hoare triple {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [103] L71-4-->L71-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:57:46,827 INFO L290 TraceCheckUtils]: 46: Hoare triple {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [136] L71-5-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:57:46,827 INFO L290 TraceCheckUtils]: 47: Hoare triple {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [167] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:57:46,828 INFO L290 TraceCheckUtils]: 48: Hoare triple {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [196] thread1EXIT-->L72-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem8#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:57:46,828 INFO L290 TraceCheckUtils]: 49: Hoare triple {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [100] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:57:46,829 INFO L290 TraceCheckUtils]: 50: Hoare triple {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [122] L73-->L73-1: Formula: (= |v_ULTIMATE.start_main_#t~mem9#1_2| (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|)) 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_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_2|, 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|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:57:46,830 INFO L290 TraceCheckUtils]: 51: Hoare triple {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [190] L62-->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] {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:57:46,830 INFO L290 TraceCheckUtils]: 52: Hoare triple {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [191] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:57:46,831 INFO L290 TraceCheckUtils]: 53: Hoare triple {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [197] thread2EXIT-->L73-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem9#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:57:46,831 INFO L290 TraceCheckUtils]: 54: Hoare triple {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [123] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:57:46,832 INFO L290 TraceCheckUtils]: 55: Hoare triple {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [159] L75-->L75-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:57:46,833 INFO L290 TraceCheckUtils]: 56: Hoare triple {886#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [119] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (= (mod v_~l1~0_3 4294967296) (mod v_~l2~0_3 4294967296))) 1 0)) InVars {~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3} OutVars{~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {887#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:57:46,833 INFO L290 TraceCheckUtils]: 57: Hoare triple {887#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [143] L75-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] {887#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:57:46,833 INFO L290 TraceCheckUtils]: 58: Hoare triple {887#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [118] 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] {888#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:57:46,834 INFO L290 TraceCheckUtils]: 59: Hoare triple {888#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [146] 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[] {882#false} is VALID [2022-02-20 20:57:46,834 INFO L290 TraceCheckUtils]: 60: Hoare triple {882#false} [140] L34-1-->L76: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {882#false} is VALID [2022-02-20 20:57:46,834 INFO L290 TraceCheckUtils]: 61: Hoare triple {882#false} [169] L76-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {882#false} is VALID [2022-02-20 20:57:46,834 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:57:46,835 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:57:46,835 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399174132] [2022-02-20 20:57:46,835 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399174132] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:57:46,835 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:57:46,835 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:57:46,835 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506155608] [2022-02-20 20:57:46,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:57:46,837 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 20:57:46,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:57:46,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 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:57:46,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:57:46,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:57:46,875 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:57:46,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:57:46,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:57:46,876 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 81 [2022-02-20 20:57:46,877 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 69 transitions, 175 flow. Second operand has 8 states, 8 states have (on average 60.25) internal successors, (482), 8 states have internal predecessors, (482), 0 states have call successors, (0), 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:57:46,877 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:57:46,877 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 81 [2022-02-20 20:57:46,877 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:57:47,192 INFO L129 PetriNetUnfolder]: 21/184 cut-off events. [2022-02-20 20:57:47,192 INFO L130 PetriNetUnfolder]: For 99/103 co-relation queries the response was YES. [2022-02-20 20:57:47,193 INFO L84 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 184 events. 21/184 cut-off events. For 99/103 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 651 event pairs, 8 based on Foata normal form. 1/178 useless extension candidates. Maximal degree in co-relation 336. Up to 39 conditions per place. [2022-02-20 20:57:47,194 INFO L132 encePairwiseOnDemand]: 74/81 looper letters, 37 selfloop transitions, 3 changer transitions 6/94 dead transitions. [2022-02-20 20:57:47,194 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 94 transitions, 379 flow [2022-02-20 20:57:47,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:57:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-02-20 20:57:47,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 511 transitions. [2022-02-20 20:57:47,200 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7885802469135802 [2022-02-20 20:57:47,200 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 511 transitions. [2022-02-20 20:57:47,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 511 transitions. [2022-02-20 20:57:47,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:57:47,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 511 transitions. [2022-02-20 20:57:47,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 63.875) internal successors, (511), 8 states have internal predecessors, (511), 0 states have call successors, (0), 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:57:47,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 81.0) internal successors, (729), 9 states have internal predecessors, (729), 0 states have call successors, (0), 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:57:47,203 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 81.0) internal successors, (729), 9 states have internal predecessors, (729), 0 states have call successors, (0), 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:57:47,203 INFO L186 Difference]: Start difference. First operand has 95 places, 69 transitions, 175 flow. Second operand 8 states and 511 transitions. [2022-02-20 20:57:47,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 94 transitions, 379 flow [2022-02-20 20:57:48,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 94 transitions, 314 flow, removed 32 selfloop flow, removed 10 redundant places. [2022-02-20 20:57:48,170 INFO L242 Difference]: Finished difference. Result has 86 places, 71 transitions, 183 flow [2022-02-20 20:57:48,170 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=183, PETRI_PLACES=86, PETRI_TRANSITIONS=71} [2022-02-20 20:57:48,170 INFO L334 CegarLoopForPetriNet]: 74 programPoint places, 12 predicate places. [2022-02-20 20:57:48,170 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 86 places, 71 transitions, 183 flow [2022-02-20 20:57:48,184 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 834 states, 828 states have (on average 2.3659420289855073) internal successors, (1959), 833 states have internal predecessors, (1959), 0 states have call successors, (0), 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:57:48,186 INFO L78 Accepts]: Start accepts. Automaton has has 834 states, 828 states have (on average 2.3659420289855073) internal successors, (1959), 833 states have internal predecessors, (1959), 0 states have call successors, (0), 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 62 [2022-02-20 20:57:48,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:57:48,186 INFO L470 AbstractCegarLoop]: Abstraction has has 86 places, 71 transitions, 183 flow [2022-02-20 20:57:48,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 60.25) internal successors, (482), 8 states have internal predecessors, (482), 0 states have call successors, (0), 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:57:48,187 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:57:48,187 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] [2022-02-20 20:57:48,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:57:48,187 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:57:48,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:57:48,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1033469356, now seen corresponding path program 2 times [2022-02-20 20:57:48,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:57:48,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521235988] [2022-02-20 20:57:48,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:57:48,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:57:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:57:48,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {1739#true} [149] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1739#true} is VALID [2022-02-20 20:57:48,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {1739#true} [129] 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] {1739#true} is VALID [2022-02-20 20:57:48,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {1739#true} [154] 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[] {1739#true} is VALID [2022-02-20 20:57:48,297 INFO L290 TraceCheckUtils]: 3: Hoare triple {1739#true} [156] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {1739#true} is VALID [2022-02-20 20:57:48,297 INFO L290 TraceCheckUtils]: 4: Hoare triple {1739#true} [120] 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[] {1739#true} is VALID [2022-02-20 20:57:48,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {1739#true} [144] 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[] {1739#true} is VALID [2022-02-20 20:57:48,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {1739#true} [142] 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[] {1739#true} is VALID [2022-02-20 20:57:48,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {1739#true} [106] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 15 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {1739#true} is VALID [2022-02-20 20:57:48,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {1739#true} [164] L21-4-->L38: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] {1739#true} is VALID [2022-02-20 20:57:48,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {1739#true} [165] L38-->L38-1: Formula: (= v_~x1~0_4 0) InVars {} OutVars{~x1~0=v_~x1~0_4} AuxVars[] AssignedVars[~x1~0] {1739#true} is VALID [2022-02-20 20:57:48,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {1739#true} [107] L38-1-->L38-2: Formula: (= v_~z1~0_3 0) InVars {} OutVars{~z1~0=v_~z1~0_3} AuxVars[] AssignedVars[~z1~0] {1739#true} is VALID [2022-02-20 20:57:48,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {1739#true} [151] L38-2-->L38-3: Formula: (= v_~l1~0_2 0) InVars {} OutVars{~l1~0=v_~l1~0_2} AuxVars[] AssignedVars[~l1~0] {1739#true} is VALID [2022-02-20 20:57:48,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {1739#true} [127] L38-3-->L38-4: Formula: (= v_~x2~0_4 0) InVars {} OutVars{~x2~0=v_~x2~0_4} AuxVars[] AssignedVars[~x2~0] {1739#true} is VALID [2022-02-20 20:57:48,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {1739#true} [98] L38-4-->L38-5: Formula: (= v_~z2~0_3 0) InVars {} OutVars{~z2~0=v_~z2~0_3} AuxVars[] AssignedVars[~z2~0] {1739#true} is VALID [2022-02-20 20:57:48,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {1739#true} [97] L38-5-->L-1-3: Formula: (= v_~l2~0_2 0) InVars {} OutVars{~l2~0=v_~l2~0_2} AuxVars[] AssignedVars[~l2~0] {1739#true} is VALID [2022-02-20 20:57:48,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {1739#true} [161] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1739#true} is VALID [2022-02-20 20:57:48,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {1739#true} [139] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1739#true} is VALID [2022-02-20 20:57:48,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {1739#true} [104] 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] {1739#true} is VALID [2022-02-20 20:57:48,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {1739#true} [137] L-1-6-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {1739#true} is VALID [2022-02-20 20:57:48,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {1739#true} [126] L66-->L66-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] {1739#true} is VALID [2022-02-20 20:57:48,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {1739#true} [157] L66-1-->L66-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] {1739#true} is VALID [2022-02-20 20:57:48,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {1739#true} [132] L66-2-->L68: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_2| v_~y~0_4) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~y~0=v_~y~0_4} AuxVars[] AssignedVars[~y~0] {1739#true} is VALID [2022-02-20 20:57:48,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {1739#true} [152] L68-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {1739#true} is VALID [2022-02-20 20:57:48,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {1739#true} [168] L70-->L70-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {1739#true} is VALID [2022-02-20 20:57:48,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {1739#true} [117] L70-1-->L70-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {1739#true} is VALID [2022-02-20 20:57:48,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {1739#true} [116] L70-2-->L70-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {1739#true} is VALID [2022-02-20 20:57:48,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {1739#true} [193] L70-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{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, thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_10|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~nondet1] {1739#true} is VALID [2022-02-20 20:57:48,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {1739#true} [105] L70-4-->L70-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {1739#true} is VALID [2022-02-20 20:57:48,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {1739#true} [150] L70-5-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {1739#true} is VALID [2022-02-20 20:57:48,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {1739#true} [99] L71-->L71-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {1739#true} is VALID [2022-02-20 20:57:48,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {1739#true} [110] L71-1-->L71-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {1739#true} is VALID [2022-02-20 20:57:48,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {1739#true} [155] L71-2-->L71-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~pre6#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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] {1739#true} is VALID [2022-02-20 20:57:48,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {1739#true} [195] L71-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_10|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~nondet2, thread2Thread1of1ForFork1_thidvar1] {1739#true} is VALID [2022-02-20 20:57:48,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {1739#true} [103] L71-4-->L71-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {1739#true} is VALID [2022-02-20 20:57:48,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {1739#true} [136] L71-5-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {1739#true} is VALID [2022-02-20 20:57:48,303 INFO L290 TraceCheckUtils]: 35: Hoare triple {1739#true} [167] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {1739#true} is VALID [2022-02-20 20:57:48,303 INFO L290 TraceCheckUtils]: 36: Hoare triple {1739#true} [182] thread2ENTRY-->L55: Formula: (= v_~z2~0_2 1) InVars {} OutVars{~z2~0=v_~z2~0_2} AuxVars[] AssignedVars[~z2~0] {1739#true} is VALID [2022-02-20 20:57:48,303 INFO L290 TraceCheckUtils]: 37: Hoare triple {1739#true} [183] L55-->L55-1: Formula: (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet2_1| 256) 0)) InVars {thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_1|} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_1|} AuxVars[] AssignedVars[] {1739#true} is VALID [2022-02-20 20:57:48,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {1739#true} [185] L55-1-->L56: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet2] {1739#true} is VALID [2022-02-20 20:57:48,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {1739#true} [187] L56-->L55-4: Formula: (= v_~x2~0_1 1) InVars {} OutVars{~x2~0=v_~x2~0_1} AuxVars[] AssignedVars[~x2~0] {1741#(= (+ (- 1) ~x2~0) 0)} is VALID [2022-02-20 20:57:48,304 INFO L290 TraceCheckUtils]: 40: Hoare triple {1741#(= (+ (- 1) ~x2~0) 0)} [172] thread1ENTRY-->L43: Formula: (= v_~z1~0_1 1) InVars {} OutVars{~z1~0=v_~z1~0_1} AuxVars[] AssignedVars[~z1~0] {1741#(= (+ (- 1) ~x2~0) 0)} is VALID [2022-02-20 20:57:48,304 INFO L290 TraceCheckUtils]: 41: Hoare triple {1741#(= (+ (- 1) ~x2~0) 0)} [173] L43-->L43-1: Formula: (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1_1| 256) 0)) InVars {thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} AuxVars[] AssignedVars[] {1741#(= (+ (- 1) ~x2~0) 0)} is VALID [2022-02-20 20:57:48,304 INFO L290 TraceCheckUtils]: 42: Hoare triple {1741#(= (+ (- 1) ~x2~0) 0)} [175] L43-1-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1] {1741#(= (+ (- 1) ~x2~0) 0)} is VALID [2022-02-20 20:57:48,305 INFO L290 TraceCheckUtils]: 43: Hoare triple {1741#(= (+ (- 1) ~x2~0) 0)} [189] L55-4-->L62: Formula: (= v_~l2~0_1 (+ v_~x2~0_3 v_~y~0_2)) InVars {~y~0=v_~y~0_2, ~x2~0=v_~x2~0_3} OutVars{~x2~0=v_~x2~0_3, ~y~0=v_~y~0_2, ~l2~0=v_~l2~0_1} AuxVars[] AssignedVars[~l2~0] {1742#(and (<= ~l2~0 (+ ~y~0 1)) (<= (+ ~y~0 1) ~l2~0))} is VALID [2022-02-20 20:57:48,307 INFO L290 TraceCheckUtils]: 44: Hoare triple {1742#(and (<= ~l2~0 (+ ~y~0 1)) (<= (+ ~y~0 1) ~l2~0))} [177] L44-->L43-4: Formula: (= v_~x1~0_1 1) InVars {} OutVars{~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[~x1~0] {1743#(and (<= ~l2~0 (+ ~y~0 1)) (= (+ (- 1) ~x1~0) 0) (<= (+ ~y~0 1) ~l2~0))} is VALID [2022-02-20 20:57:48,308 INFO L290 TraceCheckUtils]: 45: Hoare triple {1743#(and (<= ~l2~0 (+ ~y~0 1)) (= (+ (- 1) ~x1~0) 0) (<= (+ ~y~0 1) ~l2~0))} [179] L43-4-->L50: Formula: (= (+ v_~x1~0_3 v_~y~0_1) v_~l1~0_1) InVars {~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} OutVars{~l1~0=v_~l1~0_1, ~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~l1~0] {1744#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:57:48,308 INFO L290 TraceCheckUtils]: 46: Hoare triple {1744#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [180] L50-->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] {1744#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:57:48,308 INFO L290 TraceCheckUtils]: 47: Hoare triple {1744#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [181] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1744#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:57:48,309 INFO L290 TraceCheckUtils]: 48: Hoare triple {1744#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [196] thread1EXIT-->L72-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem8#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {1744#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:57:48,309 INFO L290 TraceCheckUtils]: 49: Hoare triple {1744#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [100] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {1744#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:57:48,311 INFO L290 TraceCheckUtils]: 50: Hoare triple {1744#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [122] L73-->L73-1: Formula: (= |v_ULTIMATE.start_main_#t~mem9#1_2| (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|)) 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_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_2|, 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|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {1744#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:57:48,311 INFO L290 TraceCheckUtils]: 51: Hoare triple {1744#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [190] L62-->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] {1744#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:57:48,311 INFO L290 TraceCheckUtils]: 52: Hoare triple {1744#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [191] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1744#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:57:48,313 INFO L290 TraceCheckUtils]: 53: Hoare triple {1744#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [197] thread2EXIT-->L73-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem9#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {1744#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:57:48,314 INFO L290 TraceCheckUtils]: 54: Hoare triple {1744#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [123] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {1744#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:57:48,314 INFO L290 TraceCheckUtils]: 55: Hoare triple {1744#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [159] L75-->L75-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1744#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:57:48,315 INFO L290 TraceCheckUtils]: 56: Hoare triple {1744#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [119] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (= (mod v_~l1~0_3 4294967296) (mod v_~l2~0_3 4294967296))) 1 0)) InVars {~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3} OutVars{~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {1745#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:57:48,316 INFO L290 TraceCheckUtils]: 57: Hoare triple {1745#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [143] L75-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] {1745#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:57:48,316 INFO L290 TraceCheckUtils]: 58: Hoare triple {1745#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [118] 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] {1746#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:57:48,316 INFO L290 TraceCheckUtils]: 59: Hoare triple {1746#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [146] 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[] {1740#false} is VALID [2022-02-20 20:57:48,317 INFO L290 TraceCheckUtils]: 60: Hoare triple {1740#false} [140] L34-1-->L76: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1740#false} is VALID [2022-02-20 20:57:48,317 INFO L290 TraceCheckUtils]: 61: Hoare triple {1740#false} [169] L76-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1740#false} is VALID [2022-02-20 20:57:48,317 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:57:48,317 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:57:48,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521235988] [2022-02-20 20:57:48,318 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521235988] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:57:48,318 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:57:48,318 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:57:48,318 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148308858] [2022-02-20 20:57:48,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:57:48,318 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 20:57:48,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:57:48,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 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:57:48,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:57:48,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:57:48,353 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:57:48,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:57:48,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:57:48,354 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 81 [2022-02-20 20:57:48,355 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 71 transitions, 183 flow. Second operand has 8 states, 8 states have (on average 60.25) internal successors, (482), 8 states have internal predecessors, (482), 0 states have call successors, (0), 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:57:48,355 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:57:48,355 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 81 [2022-02-20 20:57:48,355 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:57:48,599 INFO L129 PetriNetUnfolder]: 25/241 cut-off events. [2022-02-20 20:57:48,600 INFO L130 PetriNetUnfolder]: For 111/115 co-relation queries the response was YES. [2022-02-20 20:57:48,601 INFO L84 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 241 events. 25/241 cut-off events. For 111/115 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1132 event pairs, 16 based on Foata normal form. 1/233 useless extension candidates. Maximal degree in co-relation 427. Up to 61 conditions per place. [2022-02-20 20:57:48,602 INFO L132 encePairwiseOnDemand]: 74/81 looper letters, 34 selfloop transitions, 4 changer transitions 7/93 dead transitions. [2022-02-20 20:57:48,602 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 93 transitions, 366 flow [2022-02-20 20:57:48,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:57:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-02-20 20:57:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 505 transitions. [2022-02-20 20:57:48,607 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.779320987654321 [2022-02-20 20:57:48,607 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 505 transitions. [2022-02-20 20:57:48,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 505 transitions. [2022-02-20 20:57:48,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:57:48,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 505 transitions. [2022-02-20 20:57:48,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 63.125) internal successors, (505), 8 states have internal predecessors, (505), 0 states have call successors, (0), 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:57:48,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 81.0) internal successors, (729), 9 states have internal predecessors, (729), 0 states have call successors, (0), 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:57:48,611 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 81.0) internal successors, (729), 9 states have internal predecessors, (729), 0 states have call successors, (0), 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:57:48,611 INFO L186 Difference]: Start difference. First operand has 86 places, 71 transitions, 183 flow. Second operand 8 states and 505 transitions. [2022-02-20 20:57:48,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 93 transitions, 366 flow [2022-02-20 20:57:49,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 93 transitions, 347 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-02-20 20:57:49,989 INFO L242 Difference]: Finished difference. Result has 92 places, 72 transitions, 206 flow [2022-02-20 20:57:49,989 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=206, PETRI_PLACES=92, PETRI_TRANSITIONS=72} [2022-02-20 20:57:49,991 INFO L334 CegarLoopForPetriNet]: 74 programPoint places, 18 predicate places. [2022-02-20 20:57:49,991 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 72 transitions, 206 flow [2022-02-20 20:57:50,015 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1100 states, 1091 states have (on average 2.3382218148487626) internal successors, (2551), 1099 states have internal predecessors, (2551), 0 states have call successors, (0), 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:57:50,017 INFO L78 Accepts]: Start accepts. Automaton has has 1100 states, 1091 states have (on average 2.3382218148487626) internal successors, (2551), 1099 states have internal predecessors, (2551), 0 states have call successors, (0), 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 62 [2022-02-20 20:57:50,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:57:50,017 INFO L470 AbstractCegarLoop]: Abstraction has has 92 places, 72 transitions, 206 flow [2022-02-20 20:57:50,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 60.25) internal successors, (482), 8 states have internal predecessors, (482), 0 states have call successors, (0), 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:57:50,018 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:57:50,018 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] [2022-02-20 20:57:50,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:57:50,018 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:57:50,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:57:50,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1244957747, now seen corresponding path program 2 times [2022-02-20 20:57:50,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:57:50,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737186439] [2022-02-20 20:57:50,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:57:50,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:57:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:57:50,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {2865#true} [149] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2865#true} is VALID [2022-02-20 20:57:50,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {2865#true} [129] 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] {2865#true} is VALID [2022-02-20 20:57:50,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {2865#true} [154] 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[] {2865#true} is VALID [2022-02-20 20:57:50,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {2865#true} [156] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {2865#true} is VALID [2022-02-20 20:57:50,169 INFO L290 TraceCheckUtils]: 4: Hoare triple {2865#true} [120] 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[] {2865#true} is VALID [2022-02-20 20:57:50,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {2865#true} [144] 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[] {2865#true} is VALID [2022-02-20 20:57:50,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {2865#true} [142] 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[] {2865#true} is VALID [2022-02-20 20:57:50,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {2865#true} [106] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 15 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {2865#true} is VALID [2022-02-20 20:57:50,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {2865#true} [164] L21-4-->L38: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] {2865#true} is VALID [2022-02-20 20:57:50,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {2865#true} [165] L38-->L38-1: Formula: (= v_~x1~0_4 0) InVars {} OutVars{~x1~0=v_~x1~0_4} AuxVars[] AssignedVars[~x1~0] {2865#true} is VALID [2022-02-20 20:57:50,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {2865#true} [107] L38-1-->L38-2: Formula: (= v_~z1~0_3 0) InVars {} OutVars{~z1~0=v_~z1~0_3} AuxVars[] AssignedVars[~z1~0] {2865#true} is VALID [2022-02-20 20:57:50,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {2865#true} [151] L38-2-->L38-3: Formula: (= v_~l1~0_2 0) InVars {} OutVars{~l1~0=v_~l1~0_2} AuxVars[] AssignedVars[~l1~0] {2865#true} is VALID [2022-02-20 20:57:50,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {2865#true} [127] L38-3-->L38-4: Formula: (= v_~x2~0_4 0) InVars {} OutVars{~x2~0=v_~x2~0_4} AuxVars[] AssignedVars[~x2~0] {2865#true} is VALID [2022-02-20 20:57:50,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {2865#true} [98] L38-4-->L38-5: Formula: (= v_~z2~0_3 0) InVars {} OutVars{~z2~0=v_~z2~0_3} AuxVars[] AssignedVars[~z2~0] {2865#true} is VALID [2022-02-20 20:57:50,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {2865#true} [97] L38-5-->L-1-3: Formula: (= v_~l2~0_2 0) InVars {} OutVars{~l2~0=v_~l2~0_2} AuxVars[] AssignedVars[~l2~0] {2865#true} is VALID [2022-02-20 20:57:50,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {2865#true} [161] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2865#true} is VALID [2022-02-20 20:57:50,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {2865#true} [139] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2865#true} is VALID [2022-02-20 20:57:50,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {2865#true} [104] 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] {2865#true} is VALID [2022-02-20 20:57:50,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {2865#true} [137] L-1-6-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {2865#true} is VALID [2022-02-20 20:57:50,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {2865#true} [126] L66-->L66-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] {2865#true} is VALID [2022-02-20 20:57:50,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {2865#true} [157] L66-1-->L66-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] {2865#true} is VALID [2022-02-20 20:57:50,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {2865#true} [132] L66-2-->L68: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_2| v_~y~0_4) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~y~0=v_~y~0_4} AuxVars[] AssignedVars[~y~0] {2865#true} is VALID [2022-02-20 20:57:50,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {2865#true} [152] L68-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {2865#true} is VALID [2022-02-20 20:57:50,172 INFO L290 TraceCheckUtils]: 23: Hoare triple {2865#true} [168] L70-->L70-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {2865#true} is VALID [2022-02-20 20:57:50,172 INFO L290 TraceCheckUtils]: 24: Hoare triple {2865#true} [117] L70-1-->L70-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {2865#true} is VALID [2022-02-20 20:57:50,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {2865#true} [116] L70-2-->L70-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {2865#true} is VALID [2022-02-20 20:57:50,173 INFO L290 TraceCheckUtils]: 26: Hoare triple {2865#true} [193] L70-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{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, thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_10|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~nondet1] {2865#true} is VALID [2022-02-20 20:57:50,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {2865#true} [172] thread1ENTRY-->L43: Formula: (= v_~z1~0_1 1) InVars {} OutVars{~z1~0=v_~z1~0_1} AuxVars[] AssignedVars[~z1~0] {2865#true} is VALID [2022-02-20 20:57:50,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {2865#true} [173] L43-->L43-1: Formula: (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1_1| 256) 0)) InVars {thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} AuxVars[] AssignedVars[] {2865#true} is VALID [2022-02-20 20:57:50,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {2865#true} [175] L43-1-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1] {2865#true} is VALID [2022-02-20 20:57:50,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {2865#true} [105] L70-4-->L70-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {2865#true} is VALID [2022-02-20 20:57:50,174 INFO L290 TraceCheckUtils]: 31: Hoare triple {2865#true} [150] L70-5-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {2865#true} is VALID [2022-02-20 20:57:50,174 INFO L290 TraceCheckUtils]: 32: Hoare triple {2865#true} [99] L71-->L71-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {2865#true} is VALID [2022-02-20 20:57:50,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {2865#true} [110] L71-1-->L71-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {2865#true} is VALID [2022-02-20 20:57:50,174 INFO L290 TraceCheckUtils]: 34: Hoare triple {2865#true} [155] L71-2-->L71-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~pre6#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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] {2865#true} is VALID [2022-02-20 20:57:50,174 INFO L290 TraceCheckUtils]: 35: Hoare triple {2865#true} [195] L71-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_10|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~nondet2, thread2Thread1of1ForFork1_thidvar1] {2865#true} is VALID [2022-02-20 20:57:50,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {2865#true} [182] thread2ENTRY-->L55: Formula: (= v_~z2~0_2 1) InVars {} OutVars{~z2~0=v_~z2~0_2} AuxVars[] AssignedVars[~z2~0] {2867#(= ~z2~0 1)} is VALID [2022-02-20 20:57:50,175 INFO L290 TraceCheckUtils]: 37: Hoare triple {2867#(= ~z2~0 1)} [184] L55-->L55-3: Formula: (= (mod |v_thread2Thread1of1ForFork1_#t~nondet2_3| 256) 0) InVars {thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} AuxVars[] AssignedVars[] {2867#(= ~z2~0 1)} is VALID [2022-02-20 20:57:50,175 INFO L290 TraceCheckUtils]: 38: Hoare triple {2867#(= ~z2~0 1)} [186] L55-3-->L58: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet2] {2867#(= ~z2~0 1)} is VALID [2022-02-20 20:57:50,176 INFO L290 TraceCheckUtils]: 39: Hoare triple {2867#(= ~z2~0 1)} [188] L58-->L55-4: Formula: (= v_~x2~0_2 v_~z2~0_1) InVars {~z2~0=v_~z2~0_1} OutVars{~x2~0=v_~x2~0_2, ~z2~0=v_~z2~0_1} AuxVars[] AssignedVars[~x2~0] {2868#(= (+ (- 1) ~x2~0) 0)} is VALID [2022-02-20 20:57:50,176 INFO L290 TraceCheckUtils]: 40: Hoare triple {2868#(= (+ (- 1) ~x2~0) 0)} [177] L44-->L43-4: Formula: (= v_~x1~0_1 1) InVars {} OutVars{~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[~x1~0] {2869#(and (= (+ (- 1) ~x2~0) 0) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:57:50,176 INFO L290 TraceCheckUtils]: 41: Hoare triple {2869#(and (= (+ (- 1) ~x2~0) 0) (= (+ (- 1) ~x1~0) 0))} [179] L43-4-->L50: Formula: (= (+ v_~x1~0_3 v_~y~0_1) v_~l1~0_1) InVars {~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} OutVars{~l1~0=v_~l1~0_1, ~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~l1~0] {2870#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:50,177 INFO L290 TraceCheckUtils]: 42: Hoare triple {2870#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [180] L50-->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] {2870#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:50,177 INFO L290 TraceCheckUtils]: 43: Hoare triple {2870#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [181] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2870#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:50,177 INFO L290 TraceCheckUtils]: 44: Hoare triple {2870#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [103] L71-4-->L71-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {2870#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:50,178 INFO L290 TraceCheckUtils]: 45: Hoare triple {2870#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [136] L71-5-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {2870#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:50,178 INFO L290 TraceCheckUtils]: 46: Hoare triple {2870#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [167] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {2870#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:50,179 INFO L290 TraceCheckUtils]: 47: Hoare triple {2870#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [196] thread1EXIT-->L72-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem8#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {2870#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:50,180 INFO L290 TraceCheckUtils]: 48: Hoare triple {2870#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [189] L55-4-->L62: Formula: (= v_~l2~0_1 (+ v_~x2~0_3 v_~y~0_2)) InVars {~y~0=v_~y~0_2, ~x2~0=v_~x2~0_3} OutVars{~x2~0=v_~x2~0_3, ~y~0=v_~y~0_2, ~l2~0=v_~l2~0_1} AuxVars[] AssignedVars[~l2~0] {2871#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:57:50,180 INFO L290 TraceCheckUtils]: 49: Hoare triple {2871#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [190] L62-->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] {2871#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:57:50,180 INFO L290 TraceCheckUtils]: 50: Hoare triple {2871#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [191] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2871#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:57:50,181 INFO L290 TraceCheckUtils]: 51: Hoare triple {2871#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [100] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {2871#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:57:50,181 INFO L290 TraceCheckUtils]: 52: Hoare triple {2871#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [122] L73-->L73-1: Formula: (= |v_ULTIMATE.start_main_#t~mem9#1_2| (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|)) 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_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_2|, 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|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {2871#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:57:50,182 INFO L290 TraceCheckUtils]: 53: Hoare triple {2871#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [197] thread2EXIT-->L73-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem9#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {2871#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:57:50,182 INFO L290 TraceCheckUtils]: 54: Hoare triple {2871#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [123] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {2871#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:57:50,183 INFO L290 TraceCheckUtils]: 55: Hoare triple {2871#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [159] L75-->L75-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2871#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:57:50,184 INFO L290 TraceCheckUtils]: 56: Hoare triple {2871#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [119] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (= (mod v_~l1~0_3 4294967296) (mod v_~l2~0_3 4294967296))) 1 0)) InVars {~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3} OutVars{~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {2872#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:57:50,188 INFO L290 TraceCheckUtils]: 57: Hoare triple {2872#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [143] L75-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] {2872#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:57:50,188 INFO L290 TraceCheckUtils]: 58: Hoare triple {2872#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [118] 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] {2873#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:57:50,189 INFO L290 TraceCheckUtils]: 59: Hoare triple {2873#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [146] 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[] {2866#false} is VALID [2022-02-20 20:57:50,189 INFO L290 TraceCheckUtils]: 60: Hoare triple {2866#false} [140] L34-1-->L76: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2866#false} is VALID [2022-02-20 20:57:50,189 INFO L290 TraceCheckUtils]: 61: Hoare triple {2866#false} [169] L76-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2866#false} is VALID [2022-02-20 20:57:50,189 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:57:50,190 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:57:50,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737186439] [2022-02-20 20:57:50,190 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737186439] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:57:50,190 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:57:50,190 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:57:50,190 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279140657] [2022-02-20 20:57:50,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:57:50,191 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 20:57:50,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:57:50,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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:57:50,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:57:50,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:57:50,223 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:57:50,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:57:50,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:57:50,225 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 81 [2022-02-20 20:57:50,225 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 72 transitions, 206 flow. Second operand has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 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:57:50,225 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:57:50,225 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 81 [2022-02-20 20:57:50,226 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:57:50,538 INFO L129 PetriNetUnfolder]: 28/290 cut-off events. [2022-02-20 20:57:50,538 INFO L130 PetriNetUnfolder]: For 250/251 co-relation queries the response was YES. [2022-02-20 20:57:50,539 INFO L84 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 290 events. 28/290 cut-off events. For 250/251 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1531 event pairs, 5 based on Foata normal form. 2/280 useless extension candidates. Maximal degree in co-relation 563. Up to 65 conditions per place. [2022-02-20 20:57:50,540 INFO L132 encePairwiseOnDemand]: 72/81 looper letters, 38 selfloop transitions, 6 changer transitions 8/98 dead transitions. [2022-02-20 20:57:50,540 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 98 transitions, 438 flow [2022-02-20 20:57:50,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 20:57:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-02-20 20:57:50,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 549 transitions. [2022-02-20 20:57:50,545 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7530864197530864 [2022-02-20 20:57:50,545 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 549 transitions. [2022-02-20 20:57:50,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 549 transitions. [2022-02-20 20:57:50,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:57:50,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 549 transitions. [2022-02-20 20:57:50,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 61.0) internal successors, (549), 9 states have internal predecessors, (549), 0 states have call successors, (0), 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:57:50,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 0 states have call successors, (0), 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:57:50,548 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 0 states have call successors, (0), 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:57:50,548 INFO L186 Difference]: Start difference. First operand has 92 places, 72 transitions, 206 flow. Second operand 9 states and 549 transitions. [2022-02-20 20:57:50,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 98 transitions, 438 flow [2022-02-20 20:57:57,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 98 transitions, 406 flow, removed 15 selfloop flow, removed 5 redundant places. [2022-02-20 20:57:57,642 INFO L242 Difference]: Finished difference. Result has 97 places, 74 transitions, 243 flow [2022-02-20 20:57:57,642 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=243, PETRI_PLACES=97, PETRI_TRANSITIONS=74} [2022-02-20 20:57:57,643 INFO L334 CegarLoopForPetriNet]: 74 programPoint places, 23 predicate places. [2022-02-20 20:57:57,643 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 97 places, 74 transitions, 243 flow [2022-02-20 20:57:57,669 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1185 states, 1173 states have (on average 2.297527706734868) internal successors, (2695), 1184 states have internal predecessors, (2695), 0 states have call successors, (0), 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:57:57,671 INFO L78 Accepts]: Start accepts. Automaton has has 1185 states, 1173 states have (on average 2.297527706734868) internal successors, (2695), 1184 states have internal predecessors, (2695), 0 states have call successors, (0), 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 62 [2022-02-20 20:57:57,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:57:57,671 INFO L470 AbstractCegarLoop]: Abstraction has has 97 places, 74 transitions, 243 flow [2022-02-20 20:57:57,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 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:57:57,672 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:57:57,672 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] [2022-02-20 20:57:57,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:57:57,673 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:57:57,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:57:57,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1661894565, now seen corresponding path program 3 times [2022-02-20 20:57:57,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:57:57,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155754103] [2022-02-20 20:57:57,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:57:57,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:57:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:57:57,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {4079#true} [149] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4079#true} is VALID [2022-02-20 20:57:57,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {4079#true} [129] 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] {4079#true} is VALID [2022-02-20 20:57:57,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {4079#true} [154] 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[] {4079#true} is VALID [2022-02-20 20:57:57,842 INFO L290 TraceCheckUtils]: 3: Hoare triple {4079#true} [156] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {4079#true} is VALID [2022-02-20 20:57:57,843 INFO L290 TraceCheckUtils]: 4: Hoare triple {4079#true} [120] 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[] {4079#true} is VALID [2022-02-20 20:57:57,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {4079#true} [144] 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[] {4079#true} is VALID [2022-02-20 20:57:57,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {4079#true} [142] 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[] {4079#true} is VALID [2022-02-20 20:57:57,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {4079#true} [106] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 15 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {4079#true} is VALID [2022-02-20 20:57:57,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {4079#true} [164] L21-4-->L38: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] {4079#true} is VALID [2022-02-20 20:57:57,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {4079#true} [165] L38-->L38-1: Formula: (= v_~x1~0_4 0) InVars {} OutVars{~x1~0=v_~x1~0_4} AuxVars[] AssignedVars[~x1~0] {4079#true} is VALID [2022-02-20 20:57:57,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {4079#true} [107] L38-1-->L38-2: Formula: (= v_~z1~0_3 0) InVars {} OutVars{~z1~0=v_~z1~0_3} AuxVars[] AssignedVars[~z1~0] {4079#true} is VALID [2022-02-20 20:57:57,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {4079#true} [151] L38-2-->L38-3: Formula: (= v_~l1~0_2 0) InVars {} OutVars{~l1~0=v_~l1~0_2} AuxVars[] AssignedVars[~l1~0] {4079#true} is VALID [2022-02-20 20:57:57,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {4079#true} [127] L38-3-->L38-4: Formula: (= v_~x2~0_4 0) InVars {} OutVars{~x2~0=v_~x2~0_4} AuxVars[] AssignedVars[~x2~0] {4079#true} is VALID [2022-02-20 20:57:57,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {4079#true} [98] L38-4-->L38-5: Formula: (= v_~z2~0_3 0) InVars {} OutVars{~z2~0=v_~z2~0_3} AuxVars[] AssignedVars[~z2~0] {4079#true} is VALID [2022-02-20 20:57:57,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {4079#true} [97] L38-5-->L-1-3: Formula: (= v_~l2~0_2 0) InVars {} OutVars{~l2~0=v_~l2~0_2} AuxVars[] AssignedVars[~l2~0] {4079#true} is VALID [2022-02-20 20:57:57,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {4079#true} [161] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4079#true} is VALID [2022-02-20 20:57:57,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {4079#true} [139] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4079#true} is VALID [2022-02-20 20:57:57,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {4079#true} [104] 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] {4079#true} is VALID [2022-02-20 20:57:57,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {4079#true} [137] L-1-6-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {4079#true} is VALID [2022-02-20 20:57:57,848 INFO L290 TraceCheckUtils]: 19: Hoare triple {4079#true} [126] L66-->L66-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] {4079#true} is VALID [2022-02-20 20:57:57,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {4079#true} [157] L66-1-->L66-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] {4079#true} is VALID [2022-02-20 20:57:57,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {4079#true} [132] L66-2-->L68: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_2| v_~y~0_4) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~y~0=v_~y~0_4} AuxVars[] AssignedVars[~y~0] {4079#true} is VALID [2022-02-20 20:57:57,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {4079#true} [152] L68-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {4079#true} is VALID [2022-02-20 20:57:57,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {4079#true} [168] L70-->L70-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {4079#true} is VALID [2022-02-20 20:57:57,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {4079#true} [117] L70-1-->L70-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {4079#true} is VALID [2022-02-20 20:57:57,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {4079#true} [116] L70-2-->L70-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {4079#true} is VALID [2022-02-20 20:57:57,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {4079#true} [193] L70-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{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, thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_10|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~nondet1] {4079#true} is VALID [2022-02-20 20:57:57,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {4079#true} [172] thread1ENTRY-->L43: Formula: (= v_~z1~0_1 1) InVars {} OutVars{~z1~0=v_~z1~0_1} AuxVars[] AssignedVars[~z1~0] {4079#true} is VALID [2022-02-20 20:57:57,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {4079#true} [173] L43-->L43-1: Formula: (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1_1| 256) 0)) InVars {thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} AuxVars[] AssignedVars[] {4079#true} is VALID [2022-02-20 20:57:57,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {4079#true} [175] L43-1-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1] {4079#true} is VALID [2022-02-20 20:57:57,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {4079#true} [105] L70-4-->L70-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {4079#true} is VALID [2022-02-20 20:57:57,849 INFO L290 TraceCheckUtils]: 31: Hoare triple {4079#true} [150] L70-5-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {4079#true} is VALID [2022-02-20 20:57:57,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {4079#true} [99] L71-->L71-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {4079#true} is VALID [2022-02-20 20:57:57,850 INFO L290 TraceCheckUtils]: 33: Hoare triple {4079#true} [110] L71-1-->L71-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {4079#true} is VALID [2022-02-20 20:57:57,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {4079#true} [155] L71-2-->L71-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~pre6#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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] {4079#true} is VALID [2022-02-20 20:57:57,851 INFO L290 TraceCheckUtils]: 35: Hoare triple {4079#true} [195] L71-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_10|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~nondet2, thread2Thread1of1ForFork1_thidvar1] {4079#true} is VALID [2022-02-20 20:57:57,851 INFO L290 TraceCheckUtils]: 36: Hoare triple {4079#true} [177] L44-->L43-4: Formula: (= v_~x1~0_1 1) InVars {} OutVars{~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[~x1~0] {4081#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:57:57,851 INFO L290 TraceCheckUtils]: 37: Hoare triple {4081#(= (+ (- 1) ~x1~0) 0)} [182] thread2ENTRY-->L55: Formula: (= v_~z2~0_2 1) InVars {} OutVars{~z2~0=v_~z2~0_2} AuxVars[] AssignedVars[~z2~0] {4082#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:57:57,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {4082#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} [184] L55-->L55-3: Formula: (= (mod |v_thread2Thread1of1ForFork1_#t~nondet2_3| 256) 0) InVars {thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} AuxVars[] AssignedVars[] {4082#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:57:57,852 INFO L290 TraceCheckUtils]: 39: Hoare triple {4082#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} [186] L55-3-->L58: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet2] {4082#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:57:57,853 INFO L290 TraceCheckUtils]: 40: Hoare triple {4082#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} [103] L71-4-->L71-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {4082#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:57:57,853 INFO L290 TraceCheckUtils]: 41: Hoare triple {4082#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} [136] L71-5-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {4082#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:57:57,853 INFO L290 TraceCheckUtils]: 42: Hoare triple {4082#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} [167] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {4082#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:57:57,854 INFO L290 TraceCheckUtils]: 43: Hoare triple {4082#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} [179] L43-4-->L50: Formula: (= (+ v_~x1~0_3 v_~y~0_1) v_~l1~0_1) InVars {~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} OutVars{~l1~0=v_~l1~0_1, ~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~l1~0] {4083#(and (= ~z2~0 1) (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:57,854 INFO L290 TraceCheckUtils]: 44: Hoare triple {4083#(and (= ~z2~0 1) (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [180] L50-->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] {4083#(and (= ~z2~0 1) (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:57,855 INFO L290 TraceCheckUtils]: 45: Hoare triple {4083#(and (= ~z2~0 1) (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [181] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4083#(and (= ~z2~0 1) (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:57,855 INFO L290 TraceCheckUtils]: 46: Hoare triple {4083#(and (= ~z2~0 1) (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [196] thread1EXIT-->L72-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem8#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {4083#(and (= ~z2~0 1) (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:57,856 INFO L290 TraceCheckUtils]: 47: Hoare triple {4083#(and (= ~z2~0 1) (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [188] L58-->L55-4: Formula: (= v_~x2~0_2 v_~z2~0_1) InVars {~z2~0=v_~z2~0_1} OutVars{~x2~0=v_~x2~0_2, ~z2~0=v_~z2~0_1} AuxVars[] AssignedVars[~x2~0] {4084#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:57:57,856 INFO L290 TraceCheckUtils]: 48: Hoare triple {4084#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [189] L55-4-->L62: Formula: (= v_~l2~0_1 (+ v_~x2~0_3 v_~y~0_2)) InVars {~y~0=v_~y~0_2, ~x2~0=v_~x2~0_3} OutVars{~x2~0=v_~x2~0_3, ~y~0=v_~y~0_2, ~l2~0=v_~l2~0_1} AuxVars[] AssignedVars[~l2~0] {4085#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:57:57,857 INFO L290 TraceCheckUtils]: 49: Hoare triple {4085#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [100] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {4085#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:57:57,857 INFO L290 TraceCheckUtils]: 50: Hoare triple {4085#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [122] L73-->L73-1: Formula: (= |v_ULTIMATE.start_main_#t~mem9#1_2| (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|)) 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_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_2|, 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|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {4085#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:57:57,857 INFO L290 TraceCheckUtils]: 51: Hoare triple {4085#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [190] L62-->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] {4085#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:57:57,858 INFO L290 TraceCheckUtils]: 52: Hoare triple {4085#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [191] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4085#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:57:57,858 INFO L290 TraceCheckUtils]: 53: Hoare triple {4085#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [197] thread2EXIT-->L73-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem9#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {4085#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:57:57,859 INFO L290 TraceCheckUtils]: 54: Hoare triple {4085#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [123] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {4085#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:57:57,859 INFO L290 TraceCheckUtils]: 55: Hoare triple {4085#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [159] L75-->L75-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4085#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:57:57,860 INFO L290 TraceCheckUtils]: 56: Hoare triple {4085#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [119] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (= (mod v_~l1~0_3 4294967296) (mod v_~l2~0_3 4294967296))) 1 0)) InVars {~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3} OutVars{~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {4086#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:57:57,860 INFO L290 TraceCheckUtils]: 57: Hoare triple {4086#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [143] L75-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] {4086#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:57:57,861 INFO L290 TraceCheckUtils]: 58: Hoare triple {4086#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [118] 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] {4087#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:57:57,862 INFO L290 TraceCheckUtils]: 59: Hoare triple {4087#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [146] 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[] {4080#false} is VALID [2022-02-20 20:57:57,862 INFO L290 TraceCheckUtils]: 60: Hoare triple {4080#false} [140] L34-1-->L76: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4080#false} is VALID [2022-02-20 20:57:57,862 INFO L290 TraceCheckUtils]: 61: Hoare triple {4080#false} [169] L76-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4080#false} is VALID [2022-02-20 20:57:57,864 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:57:57,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:57:57,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155754103] [2022-02-20 20:57:57,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155754103] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:57:57,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:57:57,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:57:57,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711495317] [2022-02-20 20:57:57,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:57:57,866 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 20:57:57,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:57:57,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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:57:57,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:57:57,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:57:57,908 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:57:57,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:57:57,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:57:57,910 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 81 [2022-02-20 20:57:57,911 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 74 transitions, 243 flow. Second operand has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 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:57:57,911 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:57:57,911 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 81 [2022-02-20 20:57:57,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:57:58,222 INFO L129 PetriNetUnfolder]: 30/346 cut-off events. [2022-02-20 20:57:58,222 INFO L130 PetriNetUnfolder]: For 420/424 co-relation queries the response was YES. [2022-02-20 20:57:58,223 INFO L84 FinitePrefix]: Finished finitePrefix Result has 763 conditions, 346 events. 30/346 cut-off events. For 420/424 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2040 event pairs, 24 based on Foata normal form. 4/337 useless extension candidates. Maximal degree in co-relation 707. Up to 62 conditions per place. [2022-02-20 20:57:58,224 INFO L132 encePairwiseOnDemand]: 73/81 looper letters, 47 selfloop transitions, 4 changer transitions 9/106 dead transitions. [2022-02-20 20:57:58,225 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 106 transitions, 523 flow [2022-02-20 20:57:58,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 20:57:58,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-02-20 20:57:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 558 transitions. [2022-02-20 20:57:58,229 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7654320987654321 [2022-02-20 20:57:58,229 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 558 transitions. [2022-02-20 20:57:58,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 558 transitions. [2022-02-20 20:57:58,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:57:58,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 558 transitions. [2022-02-20 20:57:58,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 62.0) internal successors, (558), 9 states have internal predecessors, (558), 0 states have call successors, (0), 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:57:58,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 0 states have call successors, (0), 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:57:58,233 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 0 states have call successors, (0), 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:57:58,233 INFO L186 Difference]: Start difference. First operand has 97 places, 74 transitions, 243 flow. Second operand 9 states and 558 transitions. [2022-02-20 20:57:58,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 106 transitions, 523 flow [2022-02-20 20:58:02,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 106 transitions, 488 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-02-20 20:58:02,924 INFO L242 Difference]: Finished difference. Result has 104 places, 76 transitions, 272 flow [2022-02-20 20:58:02,924 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=272, PETRI_PLACES=104, PETRI_TRANSITIONS=76} [2022-02-20 20:58:02,925 INFO L334 CegarLoopForPetriNet]: 74 programPoint places, 30 predicate places. [2022-02-20 20:58:02,925 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 76 transitions, 272 flow [2022-02-20 20:58:02,955 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1450 states, 1433 states have (on average 2.2679692951849266) internal successors, (3250), 1449 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:02,957 INFO L78 Accepts]: Start accepts. Automaton has has 1450 states, 1433 states have (on average 2.2679692951849266) internal successors, (3250), 1449 states have internal predecessors, (3250), 0 states have call successors, (0), 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 62 [2022-02-20 20:58:02,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:58:02,958 INFO L470 AbstractCegarLoop]: Abstraction has has 104 places, 76 transitions, 272 flow [2022-02-20 20:58:02,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:02,958 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:58:02,958 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] [2022-02-20 20:58:02,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:58:02,958 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:58:02,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:58:02,959 INFO L85 PathProgramCache]: Analyzing trace with hash 407443089, now seen corresponding path program 4 times [2022-02-20 20:58:02,959 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:58:02,959 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177769138] [2022-02-20 20:58:02,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:58:02,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:58:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:58:03,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {5557#true} [149] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5557#true} is VALID [2022-02-20 20:58:03,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {5557#true} [129] 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] {5557#true} is VALID [2022-02-20 20:58:03,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {5557#true} [154] 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[] {5557#true} is VALID [2022-02-20 20:58:03,066 INFO L290 TraceCheckUtils]: 3: Hoare triple {5557#true} [156] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {5557#true} is VALID [2022-02-20 20:58:03,066 INFO L290 TraceCheckUtils]: 4: Hoare triple {5557#true} [120] 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[] {5557#true} is VALID [2022-02-20 20:58:03,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {5557#true} [144] 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[] {5557#true} is VALID [2022-02-20 20:58:03,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {5557#true} [142] 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[] {5557#true} is VALID [2022-02-20 20:58:03,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {5557#true} [106] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 15 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {5557#true} is VALID [2022-02-20 20:58:03,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {5557#true} [164] L21-4-->L38: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] {5557#true} is VALID [2022-02-20 20:58:03,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {5557#true} [165] L38-->L38-1: Formula: (= v_~x1~0_4 0) InVars {} OutVars{~x1~0=v_~x1~0_4} AuxVars[] AssignedVars[~x1~0] {5557#true} is VALID [2022-02-20 20:58:03,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {5557#true} [107] L38-1-->L38-2: Formula: (= v_~z1~0_3 0) InVars {} OutVars{~z1~0=v_~z1~0_3} AuxVars[] AssignedVars[~z1~0] {5557#true} is VALID [2022-02-20 20:58:03,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {5557#true} [151] L38-2-->L38-3: Formula: (= v_~l1~0_2 0) InVars {} OutVars{~l1~0=v_~l1~0_2} AuxVars[] AssignedVars[~l1~0] {5557#true} is VALID [2022-02-20 20:58:03,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {5557#true} [127] L38-3-->L38-4: Formula: (= v_~x2~0_4 0) InVars {} OutVars{~x2~0=v_~x2~0_4} AuxVars[] AssignedVars[~x2~0] {5557#true} is VALID [2022-02-20 20:58:03,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {5557#true} [98] L38-4-->L38-5: Formula: (= v_~z2~0_3 0) InVars {} OutVars{~z2~0=v_~z2~0_3} AuxVars[] AssignedVars[~z2~0] {5557#true} is VALID [2022-02-20 20:58:03,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {5557#true} [97] L38-5-->L-1-3: Formula: (= v_~l2~0_2 0) InVars {} OutVars{~l2~0=v_~l2~0_2} AuxVars[] AssignedVars[~l2~0] {5557#true} is VALID [2022-02-20 20:58:03,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {5557#true} [161] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5557#true} is VALID [2022-02-20 20:58:03,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {5557#true} [139] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5557#true} is VALID [2022-02-20 20:58:03,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {5557#true} [104] 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] {5557#true} is VALID [2022-02-20 20:58:03,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {5557#true} [137] L-1-6-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {5557#true} is VALID [2022-02-20 20:58:03,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {5557#true} [126] L66-->L66-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] {5557#true} is VALID [2022-02-20 20:58:03,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {5557#true} [157] L66-1-->L66-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] {5557#true} is VALID [2022-02-20 20:58:03,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {5557#true} [132] L66-2-->L68: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_2| v_~y~0_4) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~y~0=v_~y~0_4} AuxVars[] AssignedVars[~y~0] {5557#true} is VALID [2022-02-20 20:58:03,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {5557#true} [152] L68-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {5557#true} is VALID [2022-02-20 20:58:03,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {5557#true} [168] L70-->L70-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {5557#true} is VALID [2022-02-20 20:58:03,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {5557#true} [117] L70-1-->L70-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {5557#true} is VALID [2022-02-20 20:58:03,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {5557#true} [116] L70-2-->L70-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {5557#true} is VALID [2022-02-20 20:58:03,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {5557#true} [193] L70-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{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, thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_10|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~nondet1] {5557#true} is VALID [2022-02-20 20:58:03,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {5557#true} [105] L70-4-->L70-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {5557#true} is VALID [2022-02-20 20:58:03,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {5557#true} [150] L70-5-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {5557#true} is VALID [2022-02-20 20:58:03,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {5557#true} [99] L71-->L71-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {5557#true} is VALID [2022-02-20 20:58:03,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {5557#true} [110] L71-1-->L71-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {5557#true} is VALID [2022-02-20 20:58:03,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {5557#true} [155] L71-2-->L71-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~pre6#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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] {5557#true} is VALID [2022-02-20 20:58:03,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {5557#true} [195] L71-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_10|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~nondet2, thread2Thread1of1ForFork1_thidvar1] {5557#true} is VALID [2022-02-20 20:58:03,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {5557#true} [182] thread2ENTRY-->L55: Formula: (= v_~z2~0_2 1) InVars {} OutVars{~z2~0=v_~z2~0_2} AuxVars[] AssignedVars[~z2~0] {5559#(= ~z2~0 1)} is VALID [2022-02-20 20:58:03,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {5559#(= ~z2~0 1)} [172] thread1ENTRY-->L43: Formula: (= v_~z1~0_1 1) InVars {} OutVars{~z1~0=v_~z1~0_1} AuxVars[] AssignedVars[~z1~0] {5559#(= ~z2~0 1)} is VALID [2022-02-20 20:58:03,078 INFO L290 TraceCheckUtils]: 35: Hoare triple {5559#(= ~z2~0 1)} [173] L43-->L43-1: Formula: (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1_1| 256) 0)) InVars {thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} AuxVars[] AssignedVars[] {5559#(= ~z2~0 1)} is VALID [2022-02-20 20:58:03,078 INFO L290 TraceCheckUtils]: 36: Hoare triple {5559#(= ~z2~0 1)} [175] L43-1-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1] {5559#(= ~z2~0 1)} is VALID [2022-02-20 20:58:03,078 INFO L290 TraceCheckUtils]: 37: Hoare triple {5559#(= ~z2~0 1)} [177] L44-->L43-4: Formula: (= v_~x1~0_1 1) InVars {} OutVars{~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[~x1~0] {5560#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:58:03,079 INFO L290 TraceCheckUtils]: 38: Hoare triple {5560#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} [184] L55-->L55-3: Formula: (= (mod |v_thread2Thread1of1ForFork1_#t~nondet2_3| 256) 0) InVars {thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} AuxVars[] AssignedVars[] {5560#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:58:03,079 INFO L290 TraceCheckUtils]: 39: Hoare triple {5560#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} [186] L55-3-->L58: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet2] {5560#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:58:03,079 INFO L290 TraceCheckUtils]: 40: Hoare triple {5560#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} [188] L58-->L55-4: Formula: (= v_~x2~0_2 v_~z2~0_1) InVars {~z2~0=v_~z2~0_1} OutVars{~x2~0=v_~x2~0_2, ~z2~0=v_~z2~0_1} AuxVars[] AssignedVars[~x2~0] {5561#(and (= (+ (- 1) ~x2~0) 0) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:58:03,080 INFO L290 TraceCheckUtils]: 41: Hoare triple {5561#(and (= (+ (- 1) ~x2~0) 0) (= (+ (- 1) ~x1~0) 0))} [179] L43-4-->L50: Formula: (= (+ v_~x1~0_3 v_~y~0_1) v_~l1~0_1) InVars {~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} OutVars{~l1~0=v_~l1~0_1, ~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~l1~0] {5562#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:03,080 INFO L290 TraceCheckUtils]: 42: Hoare triple {5562#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [180] L50-->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] {5562#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:03,081 INFO L290 TraceCheckUtils]: 43: Hoare triple {5562#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [181] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5562#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:03,081 INFO L290 TraceCheckUtils]: 44: Hoare triple {5562#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [103] L71-4-->L71-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {5562#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:03,081 INFO L290 TraceCheckUtils]: 45: Hoare triple {5562#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [136] L71-5-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {5562#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:03,082 INFO L290 TraceCheckUtils]: 46: Hoare triple {5562#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [167] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {5562#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:03,082 INFO L290 TraceCheckUtils]: 47: Hoare triple {5562#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [196] thread1EXIT-->L72-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem8#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {5562#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:03,083 INFO L290 TraceCheckUtils]: 48: Hoare triple {5562#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [189] L55-4-->L62: Formula: (= v_~l2~0_1 (+ v_~x2~0_3 v_~y~0_2)) InVars {~y~0=v_~y~0_2, ~x2~0=v_~x2~0_3} OutVars{~x2~0=v_~x2~0_3, ~y~0=v_~y~0_2, ~l2~0=v_~l2~0_1} AuxVars[] AssignedVars[~l2~0] {5563#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:03,083 INFO L290 TraceCheckUtils]: 49: Hoare triple {5563#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [190] L62-->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] {5563#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:03,084 INFO L290 TraceCheckUtils]: 50: Hoare triple {5563#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [191] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5563#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:03,084 INFO L290 TraceCheckUtils]: 51: Hoare triple {5563#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [100] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {5563#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:03,084 INFO L290 TraceCheckUtils]: 52: Hoare triple {5563#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [122] L73-->L73-1: Formula: (= |v_ULTIMATE.start_main_#t~mem9#1_2| (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|)) 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_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_2|, 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|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {5563#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:03,085 INFO L290 TraceCheckUtils]: 53: Hoare triple {5563#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [197] thread2EXIT-->L73-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem9#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {5563#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:03,085 INFO L290 TraceCheckUtils]: 54: Hoare triple {5563#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [123] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {5563#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:03,086 INFO L290 TraceCheckUtils]: 55: Hoare triple {5563#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [159] L75-->L75-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5563#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:03,086 INFO L290 TraceCheckUtils]: 56: Hoare triple {5563#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [119] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (= (mod v_~l1~0_3 4294967296) (mod v_~l2~0_3 4294967296))) 1 0)) InVars {~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3} OutVars{~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {5564#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:03,086 INFO L290 TraceCheckUtils]: 57: Hoare triple {5564#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [143] L75-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] {5564#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:03,087 INFO L290 TraceCheckUtils]: 58: Hoare triple {5564#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [118] 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] {5565#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:58:03,087 INFO L290 TraceCheckUtils]: 59: Hoare triple {5565#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [146] 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[] {5558#false} is VALID [2022-02-20 20:58:03,088 INFO L290 TraceCheckUtils]: 60: Hoare triple {5558#false} [140] L34-1-->L76: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5558#false} is VALID [2022-02-20 20:58:03,088 INFO L290 TraceCheckUtils]: 61: Hoare triple {5558#false} [169] L76-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5558#false} is VALID [2022-02-20 20:58:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:58:03,089 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:58:03,089 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177769138] [2022-02-20 20:58:03,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177769138] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:58:03,090 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:58:03,090 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:58:03,090 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176158702] [2022-02-20 20:58:03,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:58:03,091 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 20:58:03,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:58:03,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:03,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:58:03,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:58:03,122 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:58:03,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:58:03,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:58:03,123 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 81 [2022-02-20 20:58:03,123 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 76 transitions, 272 flow. Second operand has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:03,123 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:58:03,123 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 81 [2022-02-20 20:58:03,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:58:03,454 INFO L129 PetriNetUnfolder]: 27/352 cut-off events. [2022-02-20 20:58:03,454 INFO L130 PetriNetUnfolder]: For 511/513 co-relation queries the response was YES. [2022-02-20 20:58:03,455 INFO L84 FinitePrefix]: Finished finitePrefix Result has 814 conditions, 352 events. 27/352 cut-off events. For 511/513 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2140 event pairs, 7 based on Foata normal form. 2/343 useless extension candidates. Maximal degree in co-relation 754. Up to 73 conditions per place. [2022-02-20 20:58:03,455 INFO L132 encePairwiseOnDemand]: 72/81 looper letters, 51 selfloop transitions, 6 changer transitions 10/113 dead transitions. [2022-02-20 20:58:03,456 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 113 transitions, 600 flow [2022-02-20 20:58:03,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 20:58:03,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-02-20 20:58:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 561 transitions. [2022-02-20 20:58:03,462 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7695473251028807 [2022-02-20 20:58:03,462 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 561 transitions. [2022-02-20 20:58:03,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 561 transitions. [2022-02-20 20:58:03,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:58:03,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 561 transitions. [2022-02-20 20:58:03,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 62.333333333333336) internal successors, (561), 9 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:03,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:03,465 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:03,465 INFO L186 Difference]: Start difference. First operand has 104 places, 76 transitions, 272 flow. Second operand 9 states and 561 transitions. [2022-02-20 20:58:03,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 113 transitions, 600 flow [2022-02-20 20:58:13,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 113 transitions, 559 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-02-20 20:58:13,112 INFO L242 Difference]: Finished difference. Result has 110 places, 79 transitions, 330 flow [2022-02-20 20:58:13,112 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=330, PETRI_PLACES=110, PETRI_TRANSITIONS=79} [2022-02-20 20:58:13,112 INFO L334 CegarLoopForPetriNet]: 74 programPoint places, 36 predicate places. [2022-02-20 20:58:13,112 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 110 places, 79 transitions, 330 flow [2022-02-20 20:58:13,144 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1434 states, 1417 states have (on average 2.260409315455187) internal successors, (3203), 1433 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:13,146 INFO L78 Accepts]: Start accepts. Automaton has has 1434 states, 1417 states have (on average 2.260409315455187) internal successors, (3203), 1433 states have internal predecessors, (3203), 0 states have call successors, (0), 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 62 [2022-02-20 20:58:13,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:58:13,147 INFO L470 AbstractCegarLoop]: Abstraction has has 110 places, 79 transitions, 330 flow [2022-02-20 20:58:13,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:13,147 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:58:13,147 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] [2022-02-20 20:58:13,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:58:13,148 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:58:13,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:58:13,148 INFO L85 PathProgramCache]: Analyzing trace with hash 741952778, now seen corresponding path program 3 times [2022-02-20 20:58:13,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:58:13,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733964002] [2022-02-20 20:58:13,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:58:13,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:58:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:58:13,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {7019#true} [149] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7019#true} is VALID [2022-02-20 20:58:13,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {7019#true} [129] 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] {7019#true} is VALID [2022-02-20 20:58:13,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {7019#true} [154] 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[] {7019#true} is VALID [2022-02-20 20:58:13,239 INFO L290 TraceCheckUtils]: 3: Hoare triple {7019#true} [156] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {7019#true} is VALID [2022-02-20 20:58:13,239 INFO L290 TraceCheckUtils]: 4: Hoare triple {7019#true} [120] 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[] {7019#true} is VALID [2022-02-20 20:58:13,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {7019#true} [144] 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[] {7019#true} is VALID [2022-02-20 20:58:13,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {7019#true} [142] 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[] {7019#true} is VALID [2022-02-20 20:58:13,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {7019#true} [106] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 15 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {7019#true} is VALID [2022-02-20 20:58:13,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {7019#true} [164] L21-4-->L38: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] {7019#true} is VALID [2022-02-20 20:58:13,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {7019#true} [165] L38-->L38-1: Formula: (= v_~x1~0_4 0) InVars {} OutVars{~x1~0=v_~x1~0_4} AuxVars[] AssignedVars[~x1~0] {7019#true} is VALID [2022-02-20 20:58:13,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {7019#true} [107] L38-1-->L38-2: Formula: (= v_~z1~0_3 0) InVars {} OutVars{~z1~0=v_~z1~0_3} AuxVars[] AssignedVars[~z1~0] {7019#true} is VALID [2022-02-20 20:58:13,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {7019#true} [151] L38-2-->L38-3: Formula: (= v_~l1~0_2 0) InVars {} OutVars{~l1~0=v_~l1~0_2} AuxVars[] AssignedVars[~l1~0] {7019#true} is VALID [2022-02-20 20:58:13,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {7019#true} [127] L38-3-->L38-4: Formula: (= v_~x2~0_4 0) InVars {} OutVars{~x2~0=v_~x2~0_4} AuxVars[] AssignedVars[~x2~0] {7019#true} is VALID [2022-02-20 20:58:13,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {7019#true} [98] L38-4-->L38-5: Formula: (= v_~z2~0_3 0) InVars {} OutVars{~z2~0=v_~z2~0_3} AuxVars[] AssignedVars[~z2~0] {7019#true} is VALID [2022-02-20 20:58:13,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {7019#true} [97] L38-5-->L-1-3: Formula: (= v_~l2~0_2 0) InVars {} OutVars{~l2~0=v_~l2~0_2} AuxVars[] AssignedVars[~l2~0] {7019#true} is VALID [2022-02-20 20:58:13,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {7019#true} [161] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7019#true} is VALID [2022-02-20 20:58:13,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {7019#true} [139] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7019#true} is VALID [2022-02-20 20:58:13,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {7019#true} [104] 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] {7019#true} is VALID [2022-02-20 20:58:13,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {7019#true} [137] L-1-6-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {7019#true} is VALID [2022-02-20 20:58:13,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {7019#true} [126] L66-->L66-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] {7019#true} is VALID [2022-02-20 20:58:13,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {7019#true} [157] L66-1-->L66-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] {7019#true} is VALID [2022-02-20 20:58:13,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {7019#true} [132] L66-2-->L68: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_2| v_~y~0_4) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~y~0=v_~y~0_4} AuxVars[] AssignedVars[~y~0] {7019#true} is VALID [2022-02-20 20:58:13,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {7019#true} [152] L68-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {7019#true} is VALID [2022-02-20 20:58:13,242 INFO L290 TraceCheckUtils]: 23: Hoare triple {7019#true} [168] L70-->L70-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {7019#true} is VALID [2022-02-20 20:58:13,242 INFO L290 TraceCheckUtils]: 24: Hoare triple {7019#true} [117] L70-1-->L70-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {7019#true} is VALID [2022-02-20 20:58:13,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {7019#true} [116] L70-2-->L70-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {7019#true} is VALID [2022-02-20 20:58:13,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {7019#true} [193] L70-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{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, thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_10|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~nondet1] {7019#true} is VALID [2022-02-20 20:58:13,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {7019#true} [172] thread1ENTRY-->L43: Formula: (= v_~z1~0_1 1) InVars {} OutVars{~z1~0=v_~z1~0_1} AuxVars[] AssignedVars[~z1~0] {7019#true} is VALID [2022-02-20 20:58:13,242 INFO L290 TraceCheckUtils]: 28: Hoare triple {7019#true} [173] L43-->L43-1: Formula: (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1_1| 256) 0)) InVars {thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} AuxVars[] AssignedVars[] {7019#true} is VALID [2022-02-20 20:58:13,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {7019#true} [175] L43-1-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1] {7019#true} is VALID [2022-02-20 20:58:13,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {7019#true} [105] L70-4-->L70-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {7019#true} is VALID [2022-02-20 20:58:13,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {7019#true} [150] L70-5-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {7019#true} is VALID [2022-02-20 20:58:13,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {7019#true} [99] L71-->L71-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {7019#true} is VALID [2022-02-20 20:58:13,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {7019#true} [110] L71-1-->L71-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {7019#true} is VALID [2022-02-20 20:58:13,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {7019#true} [155] L71-2-->L71-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~pre6#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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] {7019#true} is VALID [2022-02-20 20:58:13,243 INFO L290 TraceCheckUtils]: 35: Hoare triple {7019#true} [195] L71-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_10|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~nondet2, thread2Thread1of1ForFork1_thidvar1] {7019#true} is VALID [2022-02-20 20:58:13,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {7019#true} [177] L44-->L43-4: Formula: (= v_~x1~0_1 1) InVars {} OutVars{~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[~x1~0] {7021#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:58:13,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {7021#(= (+ (- 1) ~x1~0) 0)} [182] thread2ENTRY-->L55: Formula: (= v_~z2~0_2 1) InVars {} OutVars{~z2~0=v_~z2~0_2} AuxVars[] AssignedVars[~z2~0] {7021#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:58:13,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {7021#(= (+ (- 1) ~x1~0) 0)} [183] L55-->L55-1: Formula: (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet2_1| 256) 0)) InVars {thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_1|} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_1|} AuxVars[] AssignedVars[] {7021#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:58:13,245 INFO L290 TraceCheckUtils]: 39: Hoare triple {7021#(= (+ (- 1) ~x1~0) 0)} [185] L55-1-->L56: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet2] {7021#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:58:13,245 INFO L290 TraceCheckUtils]: 40: Hoare triple {7021#(= (+ (- 1) ~x1~0) 0)} [187] L56-->L55-4: Formula: (= v_~x2~0_1 1) InVars {} OutVars{~x2~0=v_~x2~0_1} AuxVars[] AssignedVars[~x2~0] {7022#(and (= (+ (- 1) ~x2~0) 0) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:58:13,245 INFO L290 TraceCheckUtils]: 41: Hoare triple {7022#(and (= (+ (- 1) ~x2~0) 0) (= (+ (- 1) ~x1~0) 0))} [179] L43-4-->L50: Formula: (= (+ v_~x1~0_3 v_~y~0_1) v_~l1~0_1) InVars {~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} OutVars{~l1~0=v_~l1~0_1, ~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~l1~0] {7023#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:13,246 INFO L290 TraceCheckUtils]: 42: Hoare triple {7023#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [103] L71-4-->L71-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {7023#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:13,246 INFO L290 TraceCheckUtils]: 43: Hoare triple {7023#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [136] L71-5-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {7023#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:13,247 INFO L290 TraceCheckUtils]: 44: Hoare triple {7023#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [167] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {7023#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:13,247 INFO L290 TraceCheckUtils]: 45: Hoare triple {7023#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [180] L50-->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] {7023#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:13,247 INFO L290 TraceCheckUtils]: 46: Hoare triple {7023#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [181] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7023#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:13,248 INFO L290 TraceCheckUtils]: 47: Hoare triple {7023#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [196] thread1EXIT-->L72-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem8#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {7023#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:13,249 INFO L290 TraceCheckUtils]: 48: Hoare triple {7023#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [189] L55-4-->L62: Formula: (= v_~l2~0_1 (+ v_~x2~0_3 v_~y~0_2)) InVars {~y~0=v_~y~0_2, ~x2~0=v_~x2~0_3} OutVars{~x2~0=v_~x2~0_3, ~y~0=v_~y~0_2, ~l2~0=v_~l2~0_1} AuxVars[] AssignedVars[~l2~0] {7024#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:58:13,249 INFO L290 TraceCheckUtils]: 49: Hoare triple {7024#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [190] L62-->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] {7024#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:58:13,249 INFO L290 TraceCheckUtils]: 50: Hoare triple {7024#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [191] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7024#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:58:13,250 INFO L290 TraceCheckUtils]: 51: Hoare triple {7024#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [100] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {7024#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:58:13,250 INFO L290 TraceCheckUtils]: 52: Hoare triple {7024#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [122] L73-->L73-1: Formula: (= |v_ULTIMATE.start_main_#t~mem9#1_2| (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|)) 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_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_2|, 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|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {7024#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:58:13,251 INFO L290 TraceCheckUtils]: 53: Hoare triple {7024#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [197] thread2EXIT-->L73-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem9#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {7024#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:58:13,251 INFO L290 TraceCheckUtils]: 54: Hoare triple {7024#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [123] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {7024#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:58:13,252 INFO L290 TraceCheckUtils]: 55: Hoare triple {7024#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [159] L75-->L75-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7024#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:58:13,252 INFO L290 TraceCheckUtils]: 56: Hoare triple {7024#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [119] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (= (mod v_~l1~0_3 4294967296) (mod v_~l2~0_3 4294967296))) 1 0)) InVars {~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3} OutVars{~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {7025#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:13,253 INFO L290 TraceCheckUtils]: 57: Hoare triple {7025#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [143] L75-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] {7025#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:13,253 INFO L290 TraceCheckUtils]: 58: Hoare triple {7025#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [118] 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] {7026#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:58:13,253 INFO L290 TraceCheckUtils]: 59: Hoare triple {7026#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [146] 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[] {7020#false} is VALID [2022-02-20 20:58:13,253 INFO L290 TraceCheckUtils]: 60: Hoare triple {7020#false} [140] L34-1-->L76: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7020#false} is VALID [2022-02-20 20:58:13,254 INFO L290 TraceCheckUtils]: 61: Hoare triple {7020#false} [169] L76-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7020#false} is VALID [2022-02-20 20:58:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:58:13,254 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:58:13,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733964002] [2022-02-20 20:58:13,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733964002] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:58:13,255 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:58:13,255 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:58:13,255 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107945] [2022-02-20 20:58:13,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:58:13,255 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 20:58:13,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:58:13,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:13,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:58:13,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:58:13,292 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:58:13,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:58:13,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:58:13,293 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 81 [2022-02-20 20:58:13,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 79 transitions, 330 flow. Second operand has 8 states, 8 states have (on average 60.25) internal successors, (482), 8 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:13,293 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:58:13,293 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 81 [2022-02-20 20:58:13,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:58:13,543 INFO L129 PetriNetUnfolder]: 22/306 cut-off events. [2022-02-20 20:58:13,543 INFO L130 PetriNetUnfolder]: For 578/585 co-relation queries the response was YES. [2022-02-20 20:58:13,544 INFO L84 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 306 events. 22/306 cut-off events. For 578/585 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1700 event pairs, 19 based on Foata normal form. 1/298 useless extension candidates. Maximal degree in co-relation 675. Up to 70 conditions per place. [2022-02-20 20:58:13,544 INFO L132 encePairwiseOnDemand]: 74/81 looper letters, 35 selfloop transitions, 3 changer transitions 10/97 dead transitions. [2022-02-20 20:58:13,545 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 97 transitions, 518 flow [2022-02-20 20:58:13,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:58:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-02-20 20:58:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 505 transitions. [2022-02-20 20:58:13,548 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.779320987654321 [2022-02-20 20:58:13,548 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 505 transitions. [2022-02-20 20:58:13,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 505 transitions. [2022-02-20 20:58:13,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:58:13,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 505 transitions. [2022-02-20 20:58:13,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 63.125) internal successors, (505), 8 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:13,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 81.0) internal successors, (729), 9 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:13,551 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 81.0) internal successors, (729), 9 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:13,551 INFO L186 Difference]: Start difference. First operand has 110 places, 79 transitions, 330 flow. Second operand 8 states and 505 transitions. [2022-02-20 20:58:13,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 97 transitions, 518 flow [2022-02-20 20:58:20,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 97 transitions, 488 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-02-20 20:58:20,438 INFO L242 Difference]: Finished difference. Result has 114 places, 77 transitions, 302 flow [2022-02-20 20:58:20,438 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=302, PETRI_PLACES=114, PETRI_TRANSITIONS=77} [2022-02-20 20:58:20,439 INFO L334 CegarLoopForPetriNet]: 74 programPoint places, 40 predicate places. [2022-02-20 20:58:20,439 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 77 transitions, 302 flow [2022-02-20 20:58:20,492 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1349 states, 1334 states have (on average 2.2766116941529235) internal successors, (3037), 1348 states have internal predecessors, (3037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:20,509 INFO L78 Accepts]: Start accepts. Automaton has has 1349 states, 1334 states have (on average 2.2766116941529235) internal successors, (3037), 1348 states have internal predecessors, (3037), 0 states have call successors, (0), 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 62 [2022-02-20 20:58:20,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:58:20,510 INFO L470 AbstractCegarLoop]: Abstraction has has 114 places, 77 transitions, 302 flow [2022-02-20 20:58:20,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 60.25) internal successors, (482), 8 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:20,510 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:58:20,510 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] [2022-02-20 20:58:20,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:58:20,510 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:58:20,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:58:20,511 INFO L85 PathProgramCache]: Analyzing trace with hash -848346999, now seen corresponding path program 5 times [2022-02-20 20:58:20,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:58:20,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711359292] [2022-02-20 20:58:20,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:58:20,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:58:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:58:20,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {8390#true} [149] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8390#true} is VALID [2022-02-20 20:58:20,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {8390#true} [129] 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] {8390#true} is VALID [2022-02-20 20:58:20,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {8390#true} [154] 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[] {8390#true} is VALID [2022-02-20 20:58:20,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {8390#true} [156] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {8390#true} is VALID [2022-02-20 20:58:20,664 INFO L290 TraceCheckUtils]: 4: Hoare triple {8390#true} [120] 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[] {8390#true} is VALID [2022-02-20 20:58:20,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {8390#true} [144] 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[] {8390#true} is VALID [2022-02-20 20:58:20,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {8390#true} [142] 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[] {8390#true} is VALID [2022-02-20 20:58:20,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {8390#true} [106] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 15 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {8390#true} is VALID [2022-02-20 20:58:20,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {8390#true} [164] L21-4-->L38: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] {8390#true} is VALID [2022-02-20 20:58:20,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {8390#true} [165] L38-->L38-1: Formula: (= v_~x1~0_4 0) InVars {} OutVars{~x1~0=v_~x1~0_4} AuxVars[] AssignedVars[~x1~0] {8390#true} is VALID [2022-02-20 20:58:20,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {8390#true} [107] L38-1-->L38-2: Formula: (= v_~z1~0_3 0) InVars {} OutVars{~z1~0=v_~z1~0_3} AuxVars[] AssignedVars[~z1~0] {8390#true} is VALID [2022-02-20 20:58:20,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {8390#true} [151] L38-2-->L38-3: Formula: (= v_~l1~0_2 0) InVars {} OutVars{~l1~0=v_~l1~0_2} AuxVars[] AssignedVars[~l1~0] {8390#true} is VALID [2022-02-20 20:58:20,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {8390#true} [127] L38-3-->L38-4: Formula: (= v_~x2~0_4 0) InVars {} OutVars{~x2~0=v_~x2~0_4} AuxVars[] AssignedVars[~x2~0] {8390#true} is VALID [2022-02-20 20:58:20,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {8390#true} [98] L38-4-->L38-5: Formula: (= v_~z2~0_3 0) InVars {} OutVars{~z2~0=v_~z2~0_3} AuxVars[] AssignedVars[~z2~0] {8390#true} is VALID [2022-02-20 20:58:20,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {8390#true} [97] L38-5-->L-1-3: Formula: (= v_~l2~0_2 0) InVars {} OutVars{~l2~0=v_~l2~0_2} AuxVars[] AssignedVars[~l2~0] {8390#true} is VALID [2022-02-20 20:58:20,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {8390#true} [161] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8390#true} is VALID [2022-02-20 20:58:20,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {8390#true} [139] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8390#true} is VALID [2022-02-20 20:58:20,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {8390#true} [104] 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] {8390#true} is VALID [2022-02-20 20:58:20,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {8390#true} [137] L-1-6-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {8390#true} is VALID [2022-02-20 20:58:20,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {8390#true} [126] L66-->L66-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] {8390#true} is VALID [2022-02-20 20:58:20,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {8390#true} [157] L66-1-->L66-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] {8390#true} is VALID [2022-02-20 20:58:20,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {8390#true} [132] L66-2-->L68: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_2| v_~y~0_4) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~y~0=v_~y~0_4} AuxVars[] AssignedVars[~y~0] {8390#true} is VALID [2022-02-20 20:58:20,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {8390#true} [152] L68-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {8390#true} is VALID [2022-02-20 20:58:20,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {8390#true} [168] L70-->L70-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {8390#true} is VALID [2022-02-20 20:58:20,667 INFO L290 TraceCheckUtils]: 24: Hoare triple {8390#true} [117] L70-1-->L70-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {8390#true} is VALID [2022-02-20 20:58:20,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {8390#true} [116] L70-2-->L70-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {8390#true} is VALID [2022-02-20 20:58:20,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {8390#true} [193] L70-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{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, thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_10|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~nondet1] {8390#true} is VALID [2022-02-20 20:58:20,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {8390#true} [172] thread1ENTRY-->L43: Formula: (= v_~z1~0_1 1) InVars {} OutVars{~z1~0=v_~z1~0_1} AuxVars[] AssignedVars[~z1~0] {8390#true} is VALID [2022-02-20 20:58:20,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {8390#true} [173] L43-->L43-1: Formula: (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1_1| 256) 0)) InVars {thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} AuxVars[] AssignedVars[] {8390#true} is VALID [2022-02-20 20:58:20,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {8390#true} [175] L43-1-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1] {8390#true} is VALID [2022-02-20 20:58:20,668 INFO L290 TraceCheckUtils]: 30: Hoare triple {8390#true} [177] L44-->L43-4: Formula: (= v_~x1~0_1 1) InVars {} OutVars{~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[~x1~0] {8392#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:58:20,668 INFO L290 TraceCheckUtils]: 31: Hoare triple {8392#(= (+ (- 1) ~x1~0) 0)} [105] L70-4-->L70-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {8392#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:58:20,669 INFO L290 TraceCheckUtils]: 32: Hoare triple {8392#(= (+ (- 1) ~x1~0) 0)} [150] L70-5-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {8392#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:58:20,669 INFO L290 TraceCheckUtils]: 33: Hoare triple {8392#(= (+ (- 1) ~x1~0) 0)} [99] L71-->L71-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {8392#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:58:20,669 INFO L290 TraceCheckUtils]: 34: Hoare triple {8392#(= (+ (- 1) ~x1~0) 0)} [110] L71-1-->L71-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {8392#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:58:20,670 INFO L290 TraceCheckUtils]: 35: Hoare triple {8392#(= (+ (- 1) ~x1~0) 0)} [155] L71-2-->L71-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~pre6#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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] {8392#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:58:20,670 INFO L290 TraceCheckUtils]: 36: Hoare triple {8392#(= (+ (- 1) ~x1~0) 0)} [195] L71-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_10|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~nondet2, thread2Thread1of1ForFork1_thidvar1] {8392#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:58:20,670 INFO L290 TraceCheckUtils]: 37: Hoare triple {8392#(= (+ (- 1) ~x1~0) 0)} [182] thread2ENTRY-->L55: Formula: (= v_~z2~0_2 1) InVars {} OutVars{~z2~0=v_~z2~0_2} AuxVars[] AssignedVars[~z2~0] {8393#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:58:20,671 INFO L290 TraceCheckUtils]: 38: Hoare triple {8393#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} [184] L55-->L55-3: Formula: (= (mod |v_thread2Thread1of1ForFork1_#t~nondet2_3| 256) 0) InVars {thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} AuxVars[] AssignedVars[] {8393#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:58:20,671 INFO L290 TraceCheckUtils]: 39: Hoare triple {8393#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} [186] L55-3-->L58: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet2] {8393#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:58:20,671 INFO L290 TraceCheckUtils]: 40: Hoare triple {8393#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} [188] L58-->L55-4: Formula: (= v_~x2~0_2 v_~z2~0_1) InVars {~z2~0=v_~z2~0_1} OutVars{~x2~0=v_~x2~0_2, ~z2~0=v_~z2~0_1} AuxVars[] AssignedVars[~x2~0] {8394#(and (= (+ (- 1) ~x2~0) 0) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:58:20,672 INFO L290 TraceCheckUtils]: 41: Hoare triple {8394#(and (= (+ (- 1) ~x2~0) 0) (= (+ (- 1) ~x1~0) 0))} [179] L43-4-->L50: Formula: (= (+ v_~x1~0_3 v_~y~0_1) v_~l1~0_1) InVars {~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} OutVars{~l1~0=v_~l1~0_1, ~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~l1~0] {8395#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:20,672 INFO L290 TraceCheckUtils]: 42: Hoare triple {8395#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [103] L71-4-->L71-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {8395#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:20,672 INFO L290 TraceCheckUtils]: 43: Hoare triple {8395#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [136] L71-5-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {8395#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:20,673 INFO L290 TraceCheckUtils]: 44: Hoare triple {8395#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [167] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {8395#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:20,673 INFO L290 TraceCheckUtils]: 45: Hoare triple {8395#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [180] L50-->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] {8395#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:20,673 INFO L290 TraceCheckUtils]: 46: Hoare triple {8395#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [181] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8395#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:20,674 INFO L290 TraceCheckUtils]: 47: Hoare triple {8395#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [196] thread1EXIT-->L72-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem8#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {8395#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:20,675 INFO L290 TraceCheckUtils]: 48: Hoare triple {8395#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [189] L55-4-->L62: Formula: (= v_~l2~0_1 (+ v_~x2~0_3 v_~y~0_2)) InVars {~y~0=v_~y~0_2, ~x2~0=v_~x2~0_3} OutVars{~x2~0=v_~x2~0_3, ~y~0=v_~y~0_2, ~l2~0=v_~l2~0_1} AuxVars[] AssignedVars[~l2~0] {8396#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:58:20,675 INFO L290 TraceCheckUtils]: 49: Hoare triple {8396#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [190] L62-->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] {8396#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:58:20,675 INFO L290 TraceCheckUtils]: 50: Hoare triple {8396#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [191] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8396#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:58:20,676 INFO L290 TraceCheckUtils]: 51: Hoare triple {8396#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [100] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {8396#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:58:20,676 INFO L290 TraceCheckUtils]: 52: Hoare triple {8396#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [122] L73-->L73-1: Formula: (= |v_ULTIMATE.start_main_#t~mem9#1_2| (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|)) 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_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_2|, 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|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {8396#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:58:20,677 INFO L290 TraceCheckUtils]: 53: Hoare triple {8396#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [197] thread2EXIT-->L73-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem9#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {8396#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:58:20,677 INFO L290 TraceCheckUtils]: 54: Hoare triple {8396#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [123] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {8396#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:58:20,678 INFO L290 TraceCheckUtils]: 55: Hoare triple {8396#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [159] L75-->L75-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8396#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} is VALID [2022-02-20 20:58:20,678 INFO L290 TraceCheckUtils]: 56: Hoare triple {8396#(and (< (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0 1)) (<= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0)) (<= (div ~l1~0 4294967296) (div ~l2~0 4294967296)))} [119] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (= (mod v_~l1~0_3 4294967296) (mod v_~l2~0_3 4294967296))) 1 0)) InVars {~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3} OutVars{~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {8397#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:20,679 INFO L290 TraceCheckUtils]: 57: Hoare triple {8397#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [143] L75-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] {8397#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:20,679 INFO L290 TraceCheckUtils]: 58: Hoare triple {8397#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [118] 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] {8398#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:58:20,679 INFO L290 TraceCheckUtils]: 59: Hoare triple {8398#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [146] 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[] {8391#false} is VALID [2022-02-20 20:58:20,679 INFO L290 TraceCheckUtils]: 60: Hoare triple {8391#false} [140] L34-1-->L76: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8391#false} is VALID [2022-02-20 20:58:20,679 INFO L290 TraceCheckUtils]: 61: Hoare triple {8391#false} [169] L76-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8391#false} is VALID [2022-02-20 20:58:20,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:58:20,680 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:58:20,680 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711359292] [2022-02-20 20:58:20,680 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711359292] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:58:20,680 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:58:20,680 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:58:20,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492103786] [2022-02-20 20:58:20,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:58:20,681 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 20:58:20,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:58:20,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:20,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:58:20,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:58:20,711 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:58:20,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:58:20,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:58:20,712 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 81 [2022-02-20 20:58:20,712 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 77 transitions, 302 flow. Second operand has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:20,712 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:58:20,712 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 81 [2022-02-20 20:58:20,712 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:58:21,025 INFO L129 PetriNetUnfolder]: 23/304 cut-off events. [2022-02-20 20:58:21,026 INFO L130 PetriNetUnfolder]: For 497/501 co-relation queries the response was YES. [2022-02-20 20:58:21,026 INFO L84 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 304 events. 23/304 cut-off events. For 497/501 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1677 event pairs, 20 based on Foata normal form. 2/296 useless extension candidates. Maximal degree in co-relation 660. Up to 62 conditions per place. [2022-02-20 20:58:21,027 INFO L132 encePairwiseOnDemand]: 73/81 looper letters, 42 selfloop transitions, 6 changer transitions 8/102 dead transitions. [2022-02-20 20:58:21,027 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 102 transitions, 532 flow [2022-02-20 20:58:21,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 20:58:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-02-20 20:58:21,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 555 transitions. [2022-02-20 20:58:21,031 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7613168724279835 [2022-02-20 20:58:21,031 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 555 transitions. [2022-02-20 20:58:21,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 555 transitions. [2022-02-20 20:58:21,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:58:21,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 555 transitions. [2022-02-20 20:58:21,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 61.666666666666664) internal successors, (555), 9 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:21,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:21,034 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:21,034 INFO L186 Difference]: Start difference. First operand has 114 places, 77 transitions, 302 flow. Second operand 9 states and 555 transitions. [2022-02-20 20:58:21,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 102 transitions, 532 flow [2022-02-20 20:58:36,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 102 transitions, 493 flow, removed 18 selfloop flow, removed 7 redundant places. [2022-02-20 20:58:36,346 INFO L242 Difference]: Finished difference. Result has 113 places, 78 transitions, 318 flow [2022-02-20 20:58:36,347 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=318, PETRI_PLACES=113, PETRI_TRANSITIONS=78} [2022-02-20 20:58:36,347 INFO L334 CegarLoopForPetriNet]: 74 programPoint places, 39 predicate places. [2022-02-20 20:58:36,347 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 78 transitions, 318 flow [2022-02-20 20:58:36,374 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1274 states, 1259 states have (on average 2.257347100873709) internal successors, (2842), 1273 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:36,375 INFO L78 Accepts]: Start accepts. Automaton has has 1274 states, 1259 states have (on average 2.257347100873709) internal successors, (2842), 1273 states have internal predecessors, (2842), 0 states have call successors, (0), 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 62 [2022-02-20 20:58:36,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:58:36,375 INFO L470 AbstractCegarLoop]: Abstraction has has 113 places, 78 transitions, 318 flow [2022-02-20 20:58:36,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:36,376 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:58:36,376 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] [2022-02-20 20:58:36,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 20:58:36,376 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:58:36,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:58:36,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1067497159, now seen corresponding path program 6 times [2022-02-20 20:58:36,377 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:58:36,377 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637498780] [2022-02-20 20:58:36,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:58:36,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:58:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:58:36,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {9690#true} [149] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9690#true} is VALID [2022-02-20 20:58:36,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {9690#true} [129] 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] {9690#true} is VALID [2022-02-20 20:58:36,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {9690#true} [154] 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[] {9690#true} is VALID [2022-02-20 20:58:36,479 INFO L290 TraceCheckUtils]: 3: Hoare triple {9690#true} [156] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {9690#true} is VALID [2022-02-20 20:58:36,480 INFO L290 TraceCheckUtils]: 4: Hoare triple {9690#true} [120] 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[] {9690#true} is VALID [2022-02-20 20:58:36,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {9690#true} [144] 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[] {9690#true} is VALID [2022-02-20 20:58:36,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {9690#true} [142] 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[] {9690#true} is VALID [2022-02-20 20:58:36,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {9690#true} [106] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 15 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {9690#true} is VALID [2022-02-20 20:58:36,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {9690#true} [164] L21-4-->L38: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] {9690#true} is VALID [2022-02-20 20:58:36,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {9690#true} [165] L38-->L38-1: Formula: (= v_~x1~0_4 0) InVars {} OutVars{~x1~0=v_~x1~0_4} AuxVars[] AssignedVars[~x1~0] {9690#true} is VALID [2022-02-20 20:58:36,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {9690#true} [107] L38-1-->L38-2: Formula: (= v_~z1~0_3 0) InVars {} OutVars{~z1~0=v_~z1~0_3} AuxVars[] AssignedVars[~z1~0] {9690#true} is VALID [2022-02-20 20:58:36,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {9690#true} [151] L38-2-->L38-3: Formula: (= v_~l1~0_2 0) InVars {} OutVars{~l1~0=v_~l1~0_2} AuxVars[] AssignedVars[~l1~0] {9690#true} is VALID [2022-02-20 20:58:36,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {9690#true} [127] L38-3-->L38-4: Formula: (= v_~x2~0_4 0) InVars {} OutVars{~x2~0=v_~x2~0_4} AuxVars[] AssignedVars[~x2~0] {9690#true} is VALID [2022-02-20 20:58:36,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {9690#true} [98] L38-4-->L38-5: Formula: (= v_~z2~0_3 0) InVars {} OutVars{~z2~0=v_~z2~0_3} AuxVars[] AssignedVars[~z2~0] {9690#true} is VALID [2022-02-20 20:58:36,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {9690#true} [97] L38-5-->L-1-3: Formula: (= v_~l2~0_2 0) InVars {} OutVars{~l2~0=v_~l2~0_2} AuxVars[] AssignedVars[~l2~0] {9690#true} is VALID [2022-02-20 20:58:36,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {9690#true} [161] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9690#true} is VALID [2022-02-20 20:58:36,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {9690#true} [139] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9690#true} is VALID [2022-02-20 20:58:36,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {9690#true} [104] 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] {9690#true} is VALID [2022-02-20 20:58:36,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {9690#true} [137] L-1-6-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {9690#true} is VALID [2022-02-20 20:58:36,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {9690#true} [126] L66-->L66-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] {9690#true} is VALID [2022-02-20 20:58:36,482 INFO L290 TraceCheckUtils]: 20: Hoare triple {9690#true} [157] L66-1-->L66-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] {9690#true} is VALID [2022-02-20 20:58:36,482 INFO L290 TraceCheckUtils]: 21: Hoare triple {9690#true} [132] L66-2-->L68: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_2| v_~y~0_4) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~y~0=v_~y~0_4} AuxVars[] AssignedVars[~y~0] {9690#true} is VALID [2022-02-20 20:58:36,482 INFO L290 TraceCheckUtils]: 22: Hoare triple {9690#true} [152] L68-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {9690#true} is VALID [2022-02-20 20:58:36,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {9690#true} [168] L70-->L70-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {9690#true} is VALID [2022-02-20 20:58:36,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {9690#true} [117] L70-1-->L70-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {9690#true} is VALID [2022-02-20 20:58:36,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {9690#true} [116] L70-2-->L70-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {9690#true} is VALID [2022-02-20 20:58:36,482 INFO L290 TraceCheckUtils]: 26: Hoare triple {9690#true} [193] L70-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{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, thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_10|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~nondet1] {9690#true} is VALID [2022-02-20 20:58:36,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {9690#true} [105] L70-4-->L70-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {9690#true} is VALID [2022-02-20 20:58:36,483 INFO L290 TraceCheckUtils]: 28: Hoare triple {9690#true} [150] L70-5-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {9690#true} is VALID [2022-02-20 20:58:36,483 INFO L290 TraceCheckUtils]: 29: Hoare triple {9690#true} [99] L71-->L71-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {9690#true} is VALID [2022-02-20 20:58:36,483 INFO L290 TraceCheckUtils]: 30: Hoare triple {9690#true} [110] L71-1-->L71-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {9690#true} is VALID [2022-02-20 20:58:36,483 INFO L290 TraceCheckUtils]: 31: Hoare triple {9690#true} [155] L71-2-->L71-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~pre6#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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] {9690#true} is VALID [2022-02-20 20:58:36,483 INFO L290 TraceCheckUtils]: 32: Hoare triple {9690#true} [172] thread1ENTRY-->L43: Formula: (= v_~z1~0_1 1) InVars {} OutVars{~z1~0=v_~z1~0_1} AuxVars[] AssignedVars[~z1~0] {9690#true} is VALID [2022-02-20 20:58:36,484 INFO L290 TraceCheckUtils]: 33: Hoare triple {9690#true} [173] L43-->L43-1: Formula: (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1_1| 256) 0)) InVars {thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} AuxVars[] AssignedVars[] {9690#true} is VALID [2022-02-20 20:58:36,484 INFO L290 TraceCheckUtils]: 34: Hoare triple {9690#true} [175] L43-1-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1] {9690#true} is VALID [2022-02-20 20:58:36,485 INFO L290 TraceCheckUtils]: 35: Hoare triple {9690#true} [177] L44-->L43-4: Formula: (= v_~x1~0_1 1) InVars {} OutVars{~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[~x1~0] {9692#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:58:36,485 INFO L290 TraceCheckUtils]: 36: Hoare triple {9692#(= (+ (- 1) ~x1~0) 0)} [195] L71-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_10|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~nondet2, thread2Thread1of1ForFork1_thidvar1] {9692#(= (+ (- 1) ~x1~0) 0)} is VALID [2022-02-20 20:58:36,485 INFO L290 TraceCheckUtils]: 37: Hoare triple {9692#(= (+ (- 1) ~x1~0) 0)} [182] thread2ENTRY-->L55: Formula: (= v_~z2~0_2 1) InVars {} OutVars{~z2~0=v_~z2~0_2} AuxVars[] AssignedVars[~z2~0] {9693#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:58:36,486 INFO L290 TraceCheckUtils]: 38: Hoare triple {9693#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} [184] L55-->L55-3: Formula: (= (mod |v_thread2Thread1of1ForFork1_#t~nondet2_3| 256) 0) InVars {thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} AuxVars[] AssignedVars[] {9693#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:58:36,486 INFO L290 TraceCheckUtils]: 39: Hoare triple {9693#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} [186] L55-3-->L58: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet2] {9693#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:58:36,486 INFO L290 TraceCheckUtils]: 40: Hoare triple {9693#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} [188] L58-->L55-4: Formula: (= v_~x2~0_2 v_~z2~0_1) InVars {~z2~0=v_~z2~0_1} OutVars{~x2~0=v_~x2~0_2, ~z2~0=v_~z2~0_1} AuxVars[] AssignedVars[~x2~0] {9694#(and (= (+ (- 1) ~x2~0) 0) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:58:36,487 INFO L290 TraceCheckUtils]: 41: Hoare triple {9694#(and (= (+ (- 1) ~x2~0) 0) (= (+ (- 1) ~x1~0) 0))} [189] L55-4-->L62: Formula: (= v_~l2~0_1 (+ v_~x2~0_3 v_~y~0_2)) InVars {~y~0=v_~y~0_2, ~x2~0=v_~x2~0_3} OutVars{~x2~0=v_~x2~0_3, ~y~0=v_~y~0_2, ~l2~0=v_~l2~0_1} AuxVars[] AssignedVars[~l2~0] {9695#(and (<= ~l2~0 (+ ~y~0 1)) (= (+ (- 1) ~x1~0) 0) (<= (+ ~y~0 1) ~l2~0))} is VALID [2022-02-20 20:58:36,487 INFO L290 TraceCheckUtils]: 42: Hoare triple {9695#(and (<= ~l2~0 (+ ~y~0 1)) (= (+ (- 1) ~x1~0) 0) (<= (+ ~y~0 1) ~l2~0))} [179] L43-4-->L50: Formula: (= (+ v_~x1~0_3 v_~y~0_1) v_~l1~0_1) InVars {~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} OutVars{~l1~0=v_~l1~0_1, ~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~l1~0] {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:36,488 INFO L290 TraceCheckUtils]: 43: Hoare triple {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [180] L50-->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] {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:36,488 INFO L290 TraceCheckUtils]: 44: Hoare triple {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [181] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:36,488 INFO L290 TraceCheckUtils]: 45: Hoare triple {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [103] L71-4-->L71-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:36,489 INFO L290 TraceCheckUtils]: 46: Hoare triple {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [136] L71-5-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:36,489 INFO L290 TraceCheckUtils]: 47: Hoare triple {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [167] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:36,490 INFO L290 TraceCheckUtils]: 48: Hoare triple {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [196] thread1EXIT-->L72-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem8#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:36,490 INFO L290 TraceCheckUtils]: 49: Hoare triple {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [100] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:36,490 INFO L290 TraceCheckUtils]: 50: Hoare triple {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [122] L73-->L73-1: Formula: (= |v_ULTIMATE.start_main_#t~mem9#1_2| (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|)) 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_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_2|, 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|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:36,491 INFO L290 TraceCheckUtils]: 51: Hoare triple {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [190] L62-->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] {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:36,491 INFO L290 TraceCheckUtils]: 52: Hoare triple {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [191] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:36,492 INFO L290 TraceCheckUtils]: 53: Hoare triple {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [197] thread2EXIT-->L73-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem9#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:36,492 INFO L290 TraceCheckUtils]: 54: Hoare triple {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [123] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:36,492 INFO L290 TraceCheckUtils]: 55: Hoare triple {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [159] L75-->L75-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:36,493 INFO L290 TraceCheckUtils]: 56: Hoare triple {9696#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [119] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (= (mod v_~l1~0_3 4294967296) (mod v_~l2~0_3 4294967296))) 1 0)) InVars {~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3} OutVars{~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {9697#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:36,493 INFO L290 TraceCheckUtils]: 57: Hoare triple {9697#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [143] L75-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] {9697#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:36,493 INFO L290 TraceCheckUtils]: 58: Hoare triple {9697#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [118] 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] {9698#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:58:36,494 INFO L290 TraceCheckUtils]: 59: Hoare triple {9698#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [146] 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[] {9691#false} is VALID [2022-02-20 20:58:36,494 INFO L290 TraceCheckUtils]: 60: Hoare triple {9691#false} [140] L34-1-->L76: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9691#false} is VALID [2022-02-20 20:58:36,494 INFO L290 TraceCheckUtils]: 61: Hoare triple {9691#false} [169] L76-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9691#false} is VALID [2022-02-20 20:58:36,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:58:36,494 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:58:36,495 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637498780] [2022-02-20 20:58:36,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637498780] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:58:36,495 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:58:36,495 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:58:36,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777178215] [2022-02-20 20:58:36,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:58:36,496 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 20:58:36,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:58:36,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:36,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:58:36,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:58:36,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:58:36,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:58:36,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:58:36,534 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 81 [2022-02-20 20:58:36,534 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 78 transitions, 318 flow. Second operand has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:36,534 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:58:36,535 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 81 [2022-02-20 20:58:36,535 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:58:36,773 INFO L129 PetriNetUnfolder]: 22/282 cut-off events. [2022-02-20 20:58:36,773 INFO L130 PetriNetUnfolder]: For 489/491 co-relation queries the response was YES. [2022-02-20 20:58:36,774 INFO L84 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 282 events. 22/282 cut-off events. For 489/491 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1494 event pairs, 20 based on Foata normal form. 2/274 useless extension candidates. Maximal degree in co-relation 630. Up to 62 conditions per place. [2022-02-20 20:58:36,774 INFO L132 encePairwiseOnDemand]: 73/81 looper letters, 34 selfloop transitions, 2 changer transitions 13/95 dead transitions. [2022-02-20 20:58:36,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 95 transitions, 499 flow [2022-02-20 20:58:36,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 20:58:36,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-02-20 20:58:36,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 548 transitions. [2022-02-20 20:58:36,778 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7517146776406035 [2022-02-20 20:58:36,778 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 548 transitions. [2022-02-20 20:58:36,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 548 transitions. [2022-02-20 20:58:36,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:58:36,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 548 transitions. [2022-02-20 20:58:36,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 60.888888888888886) internal successors, (548), 9 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:36,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:36,781 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:36,781 INFO L186 Difference]: Start difference. First operand has 113 places, 78 transitions, 318 flow. Second operand 9 states and 548 transitions. [2022-02-20 20:58:36,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 95 transitions, 499 flow [2022-02-20 20:58:53,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 95 transitions, 465 flow, removed 11 selfloop flow, removed 7 redundant places. [2022-02-20 20:58:53,174 INFO L242 Difference]: Finished difference. Result has 115 places, 74 transitions, 264 flow [2022-02-20 20:58:53,175 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=264, PETRI_PLACES=115, PETRI_TRANSITIONS=74} [2022-02-20 20:58:53,176 INFO L334 CegarLoopForPetriNet]: 74 programPoint places, 41 predicate places. [2022-02-20 20:58:53,176 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 115 places, 74 transitions, 264 flow [2022-02-20 20:58:53,210 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1126 states, 1115 states have (on average 2.3004484304932737) internal successors, (2565), 1125 states have internal predecessors, (2565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:53,212 INFO L78 Accepts]: Start accepts. Automaton has has 1126 states, 1115 states have (on average 2.3004484304932737) internal successors, (2565), 1125 states have internal predecessors, (2565), 0 states have call successors, (0), 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 62 [2022-02-20 20:58:53,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:58:53,216 INFO L470 AbstractCegarLoop]: Abstraction has has 115 places, 74 transitions, 264 flow [2022-02-20 20:58:53,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:53,216 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:58:53,216 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] [2022-02-20 20:58:53,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 20:58:53,217 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:58:53,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:58:53,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1970963035, now seen corresponding path program 7 times [2022-02-20 20:58:53,218 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:58:53,218 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706034106] [2022-02-20 20:58:53,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:58:53,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:58:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:58:53,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {10841#true} [149] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10841#true} is VALID [2022-02-20 20:58:53,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {10841#true} [129] 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] {10841#true} is VALID [2022-02-20 20:58:53,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {10841#true} [154] 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[] {10841#true} is VALID [2022-02-20 20:58:53,355 INFO L290 TraceCheckUtils]: 3: Hoare triple {10841#true} [156] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {10841#true} is VALID [2022-02-20 20:58:53,355 INFO L290 TraceCheckUtils]: 4: Hoare triple {10841#true} [120] 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[] {10841#true} is VALID [2022-02-20 20:58:53,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {10841#true} [144] 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[] {10841#true} is VALID [2022-02-20 20:58:53,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {10841#true} [142] 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[] {10841#true} is VALID [2022-02-20 20:58:53,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {10841#true} [106] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 15 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {10841#true} is VALID [2022-02-20 20:58:53,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {10841#true} [164] L21-4-->L38: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] {10841#true} is VALID [2022-02-20 20:58:53,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {10841#true} [165] L38-->L38-1: Formula: (= v_~x1~0_4 0) InVars {} OutVars{~x1~0=v_~x1~0_4} AuxVars[] AssignedVars[~x1~0] {10841#true} is VALID [2022-02-20 20:58:53,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {10841#true} [107] L38-1-->L38-2: Formula: (= v_~z1~0_3 0) InVars {} OutVars{~z1~0=v_~z1~0_3} AuxVars[] AssignedVars[~z1~0] {10841#true} is VALID [2022-02-20 20:58:53,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {10841#true} [151] L38-2-->L38-3: Formula: (= v_~l1~0_2 0) InVars {} OutVars{~l1~0=v_~l1~0_2} AuxVars[] AssignedVars[~l1~0] {10841#true} is VALID [2022-02-20 20:58:53,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {10841#true} [127] L38-3-->L38-4: Formula: (= v_~x2~0_4 0) InVars {} OutVars{~x2~0=v_~x2~0_4} AuxVars[] AssignedVars[~x2~0] {10841#true} is VALID [2022-02-20 20:58:53,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {10841#true} [98] L38-4-->L38-5: Formula: (= v_~z2~0_3 0) InVars {} OutVars{~z2~0=v_~z2~0_3} AuxVars[] AssignedVars[~z2~0] {10841#true} is VALID [2022-02-20 20:58:53,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {10841#true} [97] L38-5-->L-1-3: Formula: (= v_~l2~0_2 0) InVars {} OutVars{~l2~0=v_~l2~0_2} AuxVars[] AssignedVars[~l2~0] {10841#true} is VALID [2022-02-20 20:58:53,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {10841#true} [161] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10841#true} is VALID [2022-02-20 20:58:53,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {10841#true} [139] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10841#true} is VALID [2022-02-20 20:58:53,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {10841#true} [104] 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] {10841#true} is VALID [2022-02-20 20:58:53,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {10841#true} [137] L-1-6-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {10841#true} is VALID [2022-02-20 20:58:53,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {10841#true} [126] L66-->L66-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] {10841#true} is VALID [2022-02-20 20:58:53,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {10841#true} [157] L66-1-->L66-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] {10841#true} is VALID [2022-02-20 20:58:53,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {10841#true} [132] L66-2-->L68: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_2| v_~y~0_4) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~y~0=v_~y~0_4} AuxVars[] AssignedVars[~y~0] {10841#true} is VALID [2022-02-20 20:58:53,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {10841#true} [152] L68-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {10841#true} is VALID [2022-02-20 20:58:53,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {10841#true} [168] L70-->L70-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {10841#true} is VALID [2022-02-20 20:58:53,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {10841#true} [117] L70-1-->L70-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {10841#true} is VALID [2022-02-20 20:58:53,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {10841#true} [116] L70-2-->L70-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {10841#true} is VALID [2022-02-20 20:58:53,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {10841#true} [193] L70-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{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, thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_10|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~nondet1] {10841#true} is VALID [2022-02-20 20:58:53,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {10841#true} [105] L70-4-->L70-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {10841#true} is VALID [2022-02-20 20:58:53,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {10841#true} [150] L70-5-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {10841#true} is VALID [2022-02-20 20:58:53,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {10841#true} [99] L71-->L71-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {10841#true} is VALID [2022-02-20 20:58:53,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {10841#true} [110] L71-1-->L71-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {10841#true} is VALID [2022-02-20 20:58:53,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {10841#true} [155] L71-2-->L71-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~pre6#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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] {10841#true} is VALID [2022-02-20 20:58:53,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {10841#true} [195] L71-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_10|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~nondet2, thread2Thread1of1ForFork1_thidvar1] {10841#true} is VALID [2022-02-20 20:58:53,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {10841#true} [182] thread2ENTRY-->L55: Formula: (= v_~z2~0_2 1) InVars {} OutVars{~z2~0=v_~z2~0_2} AuxVars[] AssignedVars[~z2~0] {10843#(= ~z2~0 1)} is VALID [2022-02-20 20:58:53,360 INFO L290 TraceCheckUtils]: 34: Hoare triple {10843#(= ~z2~0 1)} [184] L55-->L55-3: Formula: (= (mod |v_thread2Thread1of1ForFork1_#t~nondet2_3| 256) 0) InVars {thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} AuxVars[] AssignedVars[] {10843#(= ~z2~0 1)} is VALID [2022-02-20 20:58:53,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {10843#(= ~z2~0 1)} [186] L55-3-->L58: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet2] {10843#(= ~z2~0 1)} is VALID [2022-02-20 20:58:53,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {10843#(= ~z2~0 1)} [103] L71-4-->L71-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {10843#(= ~z2~0 1)} is VALID [2022-02-20 20:58:53,361 INFO L290 TraceCheckUtils]: 37: Hoare triple {10843#(= ~z2~0 1)} [136] L71-5-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {10843#(= ~z2~0 1)} is VALID [2022-02-20 20:58:53,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {10843#(= ~z2~0 1)} [167] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {10843#(= ~z2~0 1)} is VALID [2022-02-20 20:58:53,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {10843#(= ~z2~0 1)} [172] thread1ENTRY-->L43: Formula: (= v_~z1~0_1 1) InVars {} OutVars{~z1~0=v_~z1~0_1} AuxVars[] AssignedVars[~z1~0] {10843#(= ~z2~0 1)} is VALID [2022-02-20 20:58:53,361 INFO L290 TraceCheckUtils]: 40: Hoare triple {10843#(= ~z2~0 1)} [173] L43-->L43-1: Formula: (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1_1| 256) 0)) InVars {thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} AuxVars[] AssignedVars[] {10843#(= ~z2~0 1)} is VALID [2022-02-20 20:58:53,362 INFO L290 TraceCheckUtils]: 41: Hoare triple {10843#(= ~z2~0 1)} [175] L43-1-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1] {10843#(= ~z2~0 1)} is VALID [2022-02-20 20:58:53,362 INFO L290 TraceCheckUtils]: 42: Hoare triple {10843#(= ~z2~0 1)} [177] L44-->L43-4: Formula: (= v_~x1~0_1 1) InVars {} OutVars{~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[~x1~0] {10844#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:58:53,362 INFO L290 TraceCheckUtils]: 43: Hoare triple {10844#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} [179] L43-4-->L50: Formula: (= (+ v_~x1~0_3 v_~y~0_1) v_~l1~0_1) InVars {~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} OutVars{~l1~0=v_~l1~0_1, ~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~l1~0] {10845#(and (= ~z2~0 1) (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:53,363 INFO L290 TraceCheckUtils]: 44: Hoare triple {10845#(and (= ~z2~0 1) (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [180] L50-->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] {10845#(and (= ~z2~0 1) (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:53,363 INFO L290 TraceCheckUtils]: 45: Hoare triple {10845#(and (= ~z2~0 1) (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [181] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10845#(and (= ~z2~0 1) (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:53,364 INFO L290 TraceCheckUtils]: 46: Hoare triple {10845#(and (= ~z2~0 1) (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [196] thread1EXIT-->L72-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem8#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {10845#(and (= ~z2~0 1) (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:53,364 INFO L290 TraceCheckUtils]: 47: Hoare triple {10845#(and (= ~z2~0 1) (<= (+ ~y~0 1) ~l1~0) (<= ~l1~0 (+ ~y~0 1)))} [188] L58-->L55-4: Formula: (= v_~x2~0_2 v_~z2~0_1) InVars {~z2~0=v_~z2~0_1} OutVars{~x2~0=v_~x2~0_2, ~z2~0=v_~z2~0_1} AuxVars[] AssignedVars[~x2~0] {10846#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} is VALID [2022-02-20 20:58:53,365 INFO L290 TraceCheckUtils]: 48: Hoare triple {10846#(and (<= (+ ~y~0 1) ~l1~0) (= (+ (- 1) ~x2~0) 0) (<= ~l1~0 (+ ~y~0 1)))} [189] L55-4-->L62: Formula: (= v_~l2~0_1 (+ v_~x2~0_3 v_~y~0_2)) InVars {~y~0=v_~y~0_2, ~x2~0=v_~x2~0_3} OutVars{~x2~0=v_~x2~0_3, ~y~0=v_~y~0_2, ~l2~0=v_~l2~0_1} AuxVars[] AssignedVars[~l2~0] {10847#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:53,365 INFO L290 TraceCheckUtils]: 49: Hoare triple {10847#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [190] L62-->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] {10847#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:53,365 INFO L290 TraceCheckUtils]: 50: Hoare triple {10847#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [191] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10847#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:53,366 INFO L290 TraceCheckUtils]: 51: Hoare triple {10847#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [100] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {10847#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:53,366 INFO L290 TraceCheckUtils]: 52: Hoare triple {10847#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [122] L73-->L73-1: Formula: (= |v_ULTIMATE.start_main_#t~mem9#1_2| (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|)) 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_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_2|, 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|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {10847#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:53,367 INFO L290 TraceCheckUtils]: 53: Hoare triple {10847#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [197] thread2EXIT-->L73-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem9#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {10847#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:53,367 INFO L290 TraceCheckUtils]: 54: Hoare triple {10847#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [123] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {10847#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:53,367 INFO L290 TraceCheckUtils]: 55: Hoare triple {10847#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [159] L75-->L75-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10847#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:53,368 INFO L290 TraceCheckUtils]: 56: Hoare triple {10847#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [119] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (= (mod v_~l1~0_3 4294967296) (mod v_~l2~0_3 4294967296))) 1 0)) InVars {~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3} OutVars{~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {10848#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:53,368 INFO L290 TraceCheckUtils]: 57: Hoare triple {10848#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [143] L75-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] {10848#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:53,368 INFO L290 TraceCheckUtils]: 58: Hoare triple {10848#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [118] 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] {10849#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:58:53,369 INFO L290 TraceCheckUtils]: 59: Hoare triple {10849#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [146] 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[] {10842#false} is VALID [2022-02-20 20:58:53,369 INFO L290 TraceCheckUtils]: 60: Hoare triple {10842#false} [140] L34-1-->L76: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10842#false} is VALID [2022-02-20 20:58:53,369 INFO L290 TraceCheckUtils]: 61: Hoare triple {10842#false} [169] L76-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10842#false} is VALID [2022-02-20 20:58:53,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:58:53,369 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:58:53,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706034106] [2022-02-20 20:58:53,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706034106] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:58:53,370 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:58:53,370 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:58:53,370 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344156589] [2022-02-20 20:58:53,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:58:53,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 20:58:53,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:58:53,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:53,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:58:53,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:58:53,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:58:53,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:58:53,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:58:53,405 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 81 [2022-02-20 20:58:53,406 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 74 transitions, 264 flow. Second operand has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:53,406 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:58:53,406 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 81 [2022-02-20 20:58:53,406 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:58:53,689 INFO L129 PetriNetUnfolder]: 20/236 cut-off events. [2022-02-20 20:58:53,689 INFO L130 PetriNetUnfolder]: For 368/368 co-relation queries the response was YES. [2022-02-20 20:58:53,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 567 conditions, 236 events. 20/236 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1119 event pairs, 2 based on Foata normal form. 1/230 useless extension candidates. Maximal degree in co-relation 519. Up to 45 conditions per place. [2022-02-20 20:58:53,690 INFO L132 encePairwiseOnDemand]: 73/81 looper letters, 33 selfloop transitions, 5 changer transitions 9/93 dead transitions. [2022-02-20 20:58:53,690 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 93 transitions, 446 flow [2022-02-20 20:58:53,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 20:58:53,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-02-20 20:58:53,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 547 transitions. [2022-02-20 20:58:53,694 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7503429355281207 [2022-02-20 20:58:53,694 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 547 transitions. [2022-02-20 20:58:53,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 547 transitions. [2022-02-20 20:58:53,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:58:53,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 547 transitions. [2022-02-20 20:58:53,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 60.77777777777778) internal successors, (547), 9 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:53,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:53,697 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:53,697 INFO L186 Difference]: Start difference. First operand has 115 places, 74 transitions, 264 flow. Second operand 9 states and 547 transitions. [2022-02-20 20:58:53,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 93 transitions, 446 flow [2022-02-20 20:58:56,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 93 transitions, 403 flow, removed 18 selfloop flow, removed 10 redundant places. [2022-02-20 20:58:57,001 INFO L242 Difference]: Finished difference. Result has 108 places, 73 transitions, 251 flow [2022-02-20 20:58:57,001 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=251, PETRI_PLACES=108, PETRI_TRANSITIONS=73} [2022-02-20 20:58:57,002 INFO L334 CegarLoopForPetriNet]: 74 programPoint places, 34 predicate places. [2022-02-20 20:58:57,003 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 73 transitions, 251 flow [2022-02-20 20:58:57,051 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 982 states, 972 states have (on average 2.3004115226337447) internal successors, (2236), 981 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:57,053 INFO L78 Accepts]: Start accepts. Automaton has has 982 states, 972 states have (on average 2.3004115226337447) internal successors, (2236), 981 states have internal predecessors, (2236), 0 states have call successors, (0), 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 62 [2022-02-20 20:58:57,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:58:57,053 INFO L470 AbstractCegarLoop]: Abstraction has has 108 places, 73 transitions, 251 flow [2022-02-20 20:58:57,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:57,053 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:58:57,053 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] [2022-02-20 20:58:57,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 20:58:57,054 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:58:57,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:58:57,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1966434263, now seen corresponding path program 8 times [2022-02-20 20:58:57,054 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:58:57,058 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221872839] [2022-02-20 20:58:57,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:58:57,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:58:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:58:57,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {11849#true} [149] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11849#true} is VALID [2022-02-20 20:58:57,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {11849#true} [129] 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] {11849#true} is VALID [2022-02-20 20:58:57,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {11849#true} [154] 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[] {11849#true} is VALID [2022-02-20 20:58:57,209 INFO L290 TraceCheckUtils]: 3: Hoare triple {11849#true} [156] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {11849#true} is VALID [2022-02-20 20:58:57,209 INFO L290 TraceCheckUtils]: 4: Hoare triple {11849#true} [120] 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[] {11849#true} is VALID [2022-02-20 20:58:57,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {11849#true} [144] 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[] {11849#true} is VALID [2022-02-20 20:58:57,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {11849#true} [142] 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[] {11849#true} is VALID [2022-02-20 20:58:57,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {11849#true} [106] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 15 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {11849#true} is VALID [2022-02-20 20:58:57,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {11849#true} [164] L21-4-->L38: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] {11849#true} is VALID [2022-02-20 20:58:57,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {11849#true} [165] L38-->L38-1: Formula: (= v_~x1~0_4 0) InVars {} OutVars{~x1~0=v_~x1~0_4} AuxVars[] AssignedVars[~x1~0] {11849#true} is VALID [2022-02-20 20:58:57,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {11849#true} [107] L38-1-->L38-2: Formula: (= v_~z1~0_3 0) InVars {} OutVars{~z1~0=v_~z1~0_3} AuxVars[] AssignedVars[~z1~0] {11849#true} is VALID [2022-02-20 20:58:57,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {11849#true} [151] L38-2-->L38-3: Formula: (= v_~l1~0_2 0) InVars {} OutVars{~l1~0=v_~l1~0_2} AuxVars[] AssignedVars[~l1~0] {11849#true} is VALID [2022-02-20 20:58:57,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {11849#true} [127] L38-3-->L38-4: Formula: (= v_~x2~0_4 0) InVars {} OutVars{~x2~0=v_~x2~0_4} AuxVars[] AssignedVars[~x2~0] {11849#true} is VALID [2022-02-20 20:58:57,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {11849#true} [98] L38-4-->L38-5: Formula: (= v_~z2~0_3 0) InVars {} OutVars{~z2~0=v_~z2~0_3} AuxVars[] AssignedVars[~z2~0] {11849#true} is VALID [2022-02-20 20:58:57,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {11849#true} [97] L38-5-->L-1-3: Formula: (= v_~l2~0_2 0) InVars {} OutVars{~l2~0=v_~l2~0_2} AuxVars[] AssignedVars[~l2~0] {11849#true} is VALID [2022-02-20 20:58:57,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {11849#true} [161] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11849#true} is VALID [2022-02-20 20:58:57,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {11849#true} [139] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11849#true} is VALID [2022-02-20 20:58:57,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {11849#true} [104] 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] {11849#true} is VALID [2022-02-20 20:58:57,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {11849#true} [137] L-1-6-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {11849#true} is VALID [2022-02-20 20:58:57,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {11849#true} [126] L66-->L66-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] {11849#true} is VALID [2022-02-20 20:58:57,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {11849#true} [157] L66-1-->L66-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] {11849#true} is VALID [2022-02-20 20:58:57,212 INFO L290 TraceCheckUtils]: 21: Hoare triple {11849#true} [132] L66-2-->L68: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_2| v_~y~0_4) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~y~0=v_~y~0_4} AuxVars[] AssignedVars[~y~0] {11849#true} is VALID [2022-02-20 20:58:57,212 INFO L290 TraceCheckUtils]: 22: Hoare triple {11849#true} [152] L68-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {11849#true} is VALID [2022-02-20 20:58:57,212 INFO L290 TraceCheckUtils]: 23: Hoare triple {11849#true} [168] L70-->L70-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {11849#true} is VALID [2022-02-20 20:58:57,212 INFO L290 TraceCheckUtils]: 24: Hoare triple {11849#true} [117] L70-1-->L70-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {11849#true} is VALID [2022-02-20 20:58:57,212 INFO L290 TraceCheckUtils]: 25: Hoare triple {11849#true} [116] L70-2-->L70-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {11849#true} is VALID [2022-02-20 20:58:57,212 INFO L290 TraceCheckUtils]: 26: Hoare triple {11849#true} [193] L70-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{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, thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_10|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~nondet1] {11849#true} is VALID [2022-02-20 20:58:57,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {11849#true} [105] L70-4-->L70-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {11849#true} is VALID [2022-02-20 20:58:57,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {11849#true} [150] L70-5-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {11849#true} is VALID [2022-02-20 20:58:57,213 INFO L290 TraceCheckUtils]: 29: Hoare triple {11849#true} [99] L71-->L71-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {11849#true} is VALID [2022-02-20 20:58:57,213 INFO L290 TraceCheckUtils]: 30: Hoare triple {11849#true} [110] L71-1-->L71-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {11849#true} is VALID [2022-02-20 20:58:57,213 INFO L290 TraceCheckUtils]: 31: Hoare triple {11849#true} [155] L71-2-->L71-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~pre6#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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] {11849#true} is VALID [2022-02-20 20:58:57,213 INFO L290 TraceCheckUtils]: 32: Hoare triple {11849#true} [195] L71-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_10|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~nondet2, thread2Thread1of1ForFork1_thidvar1] {11849#true} is VALID [2022-02-20 20:58:57,213 INFO L290 TraceCheckUtils]: 33: Hoare triple {11849#true} [182] thread2ENTRY-->L55: Formula: (= v_~z2~0_2 1) InVars {} OutVars{~z2~0=v_~z2~0_2} AuxVars[] AssignedVars[~z2~0] {11851#(= ~z2~0 1)} is VALID [2022-02-20 20:58:57,214 INFO L290 TraceCheckUtils]: 34: Hoare triple {11851#(= ~z2~0 1)} [172] thread1ENTRY-->L43: Formula: (= v_~z1~0_1 1) InVars {} OutVars{~z1~0=v_~z1~0_1} AuxVars[] AssignedVars[~z1~0] {11851#(= ~z2~0 1)} is VALID [2022-02-20 20:58:57,214 INFO L290 TraceCheckUtils]: 35: Hoare triple {11851#(= ~z2~0 1)} [173] L43-->L43-1: Formula: (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1_1| 256) 0)) InVars {thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} AuxVars[] AssignedVars[] {11851#(= ~z2~0 1)} is VALID [2022-02-20 20:58:57,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {11851#(= ~z2~0 1)} [175] L43-1-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1] {11851#(= ~z2~0 1)} is VALID [2022-02-20 20:58:57,215 INFO L290 TraceCheckUtils]: 37: Hoare triple {11851#(= ~z2~0 1)} [177] L44-->L43-4: Formula: (= v_~x1~0_1 1) InVars {} OutVars{~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[~x1~0] {11852#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:58:57,215 INFO L290 TraceCheckUtils]: 38: Hoare triple {11852#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} [184] L55-->L55-3: Formula: (= (mod |v_thread2Thread1of1ForFork1_#t~nondet2_3| 256) 0) InVars {thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} AuxVars[] AssignedVars[] {11852#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:58:57,215 INFO L290 TraceCheckUtils]: 39: Hoare triple {11852#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} [186] L55-3-->L58: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet2] {11852#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:58:57,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {11852#(and (= ~z2~0 1) (= (+ (- 1) ~x1~0) 0))} [188] L58-->L55-4: Formula: (= v_~x2~0_2 v_~z2~0_1) InVars {~z2~0=v_~z2~0_1} OutVars{~x2~0=v_~x2~0_2, ~z2~0=v_~z2~0_1} AuxVars[] AssignedVars[~x2~0] {11853#(and (= (+ (- 1) ~x2~0) 0) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:58:57,216 INFO L290 TraceCheckUtils]: 41: Hoare triple {11853#(and (= (+ (- 1) ~x2~0) 0) (= (+ (- 1) ~x1~0) 0))} [189] L55-4-->L62: Formula: (= v_~l2~0_1 (+ v_~x2~0_3 v_~y~0_2)) InVars {~y~0=v_~y~0_2, ~x2~0=v_~x2~0_3} OutVars{~x2~0=v_~x2~0_3, ~y~0=v_~y~0_2, ~l2~0=v_~l2~0_1} AuxVars[] AssignedVars[~l2~0] {11854#(and (<= ~l2~0 (+ ~y~0 1)) (= (+ (- 1) ~x1~0) 0) (<= (+ ~y~0 1) ~l2~0))} is VALID [2022-02-20 20:58:57,217 INFO L290 TraceCheckUtils]: 42: Hoare triple {11854#(and (<= ~l2~0 (+ ~y~0 1)) (= (+ (- 1) ~x1~0) 0) (<= (+ ~y~0 1) ~l2~0))} [190] L62-->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] {11854#(and (<= ~l2~0 (+ ~y~0 1)) (= (+ (- 1) ~x1~0) 0) (<= (+ ~y~0 1) ~l2~0))} is VALID [2022-02-20 20:58:57,217 INFO L290 TraceCheckUtils]: 43: Hoare triple {11854#(and (<= ~l2~0 (+ ~y~0 1)) (= (+ (- 1) ~x1~0) 0) (<= (+ ~y~0 1) ~l2~0))} [191] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11854#(and (<= ~l2~0 (+ ~y~0 1)) (= (+ (- 1) ~x1~0) 0) (<= (+ ~y~0 1) ~l2~0))} is VALID [2022-02-20 20:58:57,218 INFO L290 TraceCheckUtils]: 44: Hoare triple {11854#(and (<= ~l2~0 (+ ~y~0 1)) (= (+ (- 1) ~x1~0) 0) (<= (+ ~y~0 1) ~l2~0))} [179] L43-4-->L50: Formula: (= (+ v_~x1~0_3 v_~y~0_1) v_~l1~0_1) InVars {~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} OutVars{~l1~0=v_~l1~0_1, ~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~l1~0] {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:58:57,218 INFO L290 TraceCheckUtils]: 45: Hoare triple {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [180] L50-->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] {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:58:57,219 INFO L290 TraceCheckUtils]: 46: Hoare triple {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [181] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:58:57,219 INFO L290 TraceCheckUtils]: 47: Hoare triple {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [103] L71-4-->L71-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:58:57,220 INFO L290 TraceCheckUtils]: 48: Hoare triple {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [136] L71-5-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:58:57,220 INFO L290 TraceCheckUtils]: 49: Hoare triple {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [167] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:58:57,221 INFO L290 TraceCheckUtils]: 50: Hoare triple {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [196] thread1EXIT-->L72-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem8#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:58:57,221 INFO L290 TraceCheckUtils]: 51: Hoare triple {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [100] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:58:57,222 INFO L290 TraceCheckUtils]: 52: Hoare triple {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [122] L73-->L73-1: Formula: (= |v_ULTIMATE.start_main_#t~mem9#1_2| (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|)) 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_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_2|, 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|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:58:57,223 INFO L290 TraceCheckUtils]: 53: Hoare triple {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [197] thread2EXIT-->L73-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem9#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:58:57,223 INFO L290 TraceCheckUtils]: 54: Hoare triple {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [123] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:58:57,224 INFO L290 TraceCheckUtils]: 55: Hoare triple {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [159] L75-->L75-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} is VALID [2022-02-20 20:58:57,224 INFO L290 TraceCheckUtils]: 56: Hoare triple {11855#(and (< (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0 1)) (<= ~l2~0 ~l1~0) (<= (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0) (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0)))} [119] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (= (mod v_~l1~0_3 4294967296) (mod v_~l2~0_3 4294967296))) 1 0)) InVars {~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3} OutVars{~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {11856#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:57,224 INFO L290 TraceCheckUtils]: 57: Hoare triple {11856#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [143] L75-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] {11856#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:57,225 INFO L290 TraceCheckUtils]: 58: Hoare triple {11856#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [118] 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] {11857#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:58:57,225 INFO L290 TraceCheckUtils]: 59: Hoare triple {11857#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [146] 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[] {11850#false} is VALID [2022-02-20 20:58:57,225 INFO L290 TraceCheckUtils]: 60: Hoare triple {11850#false} [140] L34-1-->L76: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11850#false} is VALID [2022-02-20 20:58:57,225 INFO L290 TraceCheckUtils]: 61: Hoare triple {11850#false} [169] L76-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11850#false} is VALID [2022-02-20 20:58:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:58:57,226 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:58:57,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221872839] [2022-02-20 20:58:57,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221872839] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:58:57,226 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:58:57,226 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:58:57,227 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836340988] [2022-02-20 20:58:57,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:58:57,227 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 20:58:57,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:58:57,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:57,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:58:57,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:58:57,267 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:58:57,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:58:57,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:58:57,268 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 81 [2022-02-20 20:58:57,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 73 transitions, 251 flow. Second operand has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:57,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:58:57,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 81 [2022-02-20 20:58:57,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:58:57,594 INFO L129 PetriNetUnfolder]: 18/213 cut-off events. [2022-02-20 20:58:57,594 INFO L130 PetriNetUnfolder]: For 283/283 co-relation queries the response was YES. [2022-02-20 20:58:57,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 213 events. 18/213 cut-off events. For 283/283 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 883 event pairs, 6 based on Foata normal form. 1/208 useless extension candidates. Maximal degree in co-relation 457. Up to 45 conditions per place. [2022-02-20 20:58:57,594 INFO L132 encePairwiseOnDemand]: 73/81 looper letters, 33 selfloop transitions, 2 changer transitions 11/92 dead transitions. [2022-02-20 20:58:57,595 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 92 transitions, 432 flow [2022-02-20 20:58:57,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 20:58:57,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-02-20 20:58:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 548 transitions. [2022-02-20 20:58:57,598 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7517146776406035 [2022-02-20 20:58:57,598 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 548 transitions. [2022-02-20 20:58:57,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 548 transitions. [2022-02-20 20:58:57,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:58:57,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 548 transitions. [2022-02-20 20:58:57,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 60.888888888888886) internal successors, (548), 9 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:57,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:57,600 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:57,600 INFO L186 Difference]: Start difference. First operand has 108 places, 73 transitions, 251 flow. Second operand 9 states and 548 transitions. [2022-02-20 20:58:57,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 92 transitions, 432 flow [2022-02-20 20:58:57,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 92 transitions, 381 flow, removed 13 selfloop flow, removed 12 redundant places. [2022-02-20 20:58:57,912 INFO L242 Difference]: Finished difference. Result has 104 places, 70 transitions, 201 flow [2022-02-20 20:58:57,912 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=201, PETRI_PLACES=104, PETRI_TRANSITIONS=70} [2022-02-20 20:58:57,913 INFO L334 CegarLoopForPetriNet]: 74 programPoint places, 30 predicate places. [2022-02-20 20:58:57,913 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 70 transitions, 201 flow [2022-02-20 20:58:57,925 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 877 states, 870 states have (on average 2.3241379310344827) internal successors, (2022), 876 states have internal predecessors, (2022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:57,926 INFO L78 Accepts]: Start accepts. Automaton has has 877 states, 870 states have (on average 2.3241379310344827) internal successors, (2022), 876 states have internal predecessors, (2022), 0 states have call successors, (0), 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 62 [2022-02-20 20:58:57,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:58:57,927 INFO L470 AbstractCegarLoop]: Abstraction has has 104 places, 70 transitions, 201 flow [2022-02-20 20:58:57,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:57,927 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:58:57,927 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] [2022-02-20 20:58:57,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 20:58:57,927 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:58:57,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:58:57,928 INFO L85 PathProgramCache]: Analyzing trace with hash 656538785, now seen corresponding path program 9 times [2022-02-20 20:58:57,928 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:58:57,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011466998] [2022-02-20 20:58:57,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:58:57,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:58:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:58:58,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {12751#true} [149] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12751#true} is VALID [2022-02-20 20:58:58,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {12751#true} [129] 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] {12751#true} is VALID [2022-02-20 20:58:58,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {12751#true} [154] 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[] {12751#true} is VALID [2022-02-20 20:58:58,016 INFO L290 TraceCheckUtils]: 3: Hoare triple {12751#true} [156] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {12751#true} is VALID [2022-02-20 20:58:58,016 INFO L290 TraceCheckUtils]: 4: Hoare triple {12751#true} [120] 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[] {12751#true} is VALID [2022-02-20 20:58:58,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {12751#true} [144] 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[] {12751#true} is VALID [2022-02-20 20:58:58,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {12751#true} [142] 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[] {12751#true} is VALID [2022-02-20 20:58:58,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {12751#true} [106] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 15 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {12751#true} is VALID [2022-02-20 20:58:58,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {12751#true} [164] L21-4-->L38: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] {12751#true} is VALID [2022-02-20 20:58:58,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {12751#true} [165] L38-->L38-1: Formula: (= v_~x1~0_4 0) InVars {} OutVars{~x1~0=v_~x1~0_4} AuxVars[] AssignedVars[~x1~0] {12751#true} is VALID [2022-02-20 20:58:58,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {12751#true} [107] L38-1-->L38-2: Formula: (= v_~z1~0_3 0) InVars {} OutVars{~z1~0=v_~z1~0_3} AuxVars[] AssignedVars[~z1~0] {12751#true} is VALID [2022-02-20 20:58:58,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {12751#true} [151] L38-2-->L38-3: Formula: (= v_~l1~0_2 0) InVars {} OutVars{~l1~0=v_~l1~0_2} AuxVars[] AssignedVars[~l1~0] {12751#true} is VALID [2022-02-20 20:58:58,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {12751#true} [127] L38-3-->L38-4: Formula: (= v_~x2~0_4 0) InVars {} OutVars{~x2~0=v_~x2~0_4} AuxVars[] AssignedVars[~x2~0] {12751#true} is VALID [2022-02-20 20:58:58,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {12751#true} [98] L38-4-->L38-5: Formula: (= v_~z2~0_3 0) InVars {} OutVars{~z2~0=v_~z2~0_3} AuxVars[] AssignedVars[~z2~0] {12751#true} is VALID [2022-02-20 20:58:58,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {12751#true} [97] L38-5-->L-1-3: Formula: (= v_~l2~0_2 0) InVars {} OutVars{~l2~0=v_~l2~0_2} AuxVars[] AssignedVars[~l2~0] {12751#true} is VALID [2022-02-20 20:58:58,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {12751#true} [161] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12751#true} is VALID [2022-02-20 20:58:58,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {12751#true} [139] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12751#true} is VALID [2022-02-20 20:58:58,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {12751#true} [104] 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] {12751#true} is VALID [2022-02-20 20:58:58,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {12751#true} [137] L-1-6-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {12751#true} is VALID [2022-02-20 20:58:58,018 INFO L290 TraceCheckUtils]: 19: Hoare triple {12751#true} [126] L66-->L66-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] {12751#true} is VALID [2022-02-20 20:58:58,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {12751#true} [157] L66-1-->L66-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] {12751#true} is VALID [2022-02-20 20:58:58,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {12751#true} [132] L66-2-->L68: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_2| v_~y~0_4) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~y~0=v_~y~0_4} AuxVars[] AssignedVars[~y~0] {12751#true} is VALID [2022-02-20 20:58:58,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {12751#true} [152] L68-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {12751#true} is VALID [2022-02-20 20:58:58,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {12751#true} [168] L70-->L70-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {12751#true} is VALID [2022-02-20 20:58:58,019 INFO L290 TraceCheckUtils]: 24: Hoare triple {12751#true} [117] L70-1-->L70-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {12751#true} is VALID [2022-02-20 20:58:58,019 INFO L290 TraceCheckUtils]: 25: Hoare triple {12751#true} [116] L70-2-->L70-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {12751#true} is VALID [2022-02-20 20:58:58,019 INFO L290 TraceCheckUtils]: 26: Hoare triple {12751#true} [193] L70-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{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, thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_10|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~nondet1] {12751#true} is VALID [2022-02-20 20:58:58,019 INFO L290 TraceCheckUtils]: 27: Hoare triple {12751#true} [105] L70-4-->L70-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {12751#true} is VALID [2022-02-20 20:58:58,020 INFO L290 TraceCheckUtils]: 28: Hoare triple {12751#true} [150] L70-5-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {12751#true} is VALID [2022-02-20 20:58:58,020 INFO L290 TraceCheckUtils]: 29: Hoare triple {12751#true} [99] L71-->L71-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {12751#true} is VALID [2022-02-20 20:58:58,020 INFO L290 TraceCheckUtils]: 30: Hoare triple {12751#true} [110] L71-1-->L71-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {12751#true} is VALID [2022-02-20 20:58:58,020 INFO L290 TraceCheckUtils]: 31: Hoare triple {12751#true} [155] L71-2-->L71-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~pre6#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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] {12751#true} is VALID [2022-02-20 20:58:58,020 INFO L290 TraceCheckUtils]: 32: Hoare triple {12751#true} [195] L71-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_10|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~nondet2, thread2Thread1of1ForFork1_thidvar1] {12751#true} is VALID [2022-02-20 20:58:58,028 INFO L290 TraceCheckUtils]: 33: Hoare triple {12751#true} [182] thread2ENTRY-->L55: Formula: (= v_~z2~0_2 1) InVars {} OutVars{~z2~0=v_~z2~0_2} AuxVars[] AssignedVars[~z2~0] {12753#(= ~z2~0 1)} is VALID [2022-02-20 20:58:58,028 INFO L290 TraceCheckUtils]: 34: Hoare triple {12753#(= ~z2~0 1)} [172] thread1ENTRY-->L43: Formula: (= v_~z1~0_1 1) InVars {} OutVars{~z1~0=v_~z1~0_1} AuxVars[] AssignedVars[~z1~0] {12753#(= ~z2~0 1)} is VALID [2022-02-20 20:58:58,029 INFO L290 TraceCheckUtils]: 35: Hoare triple {12753#(= ~z2~0 1)} [173] L43-->L43-1: Formula: (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1_1| 256) 0)) InVars {thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} AuxVars[] AssignedVars[] {12753#(= ~z2~0 1)} is VALID [2022-02-20 20:58:58,029 INFO L290 TraceCheckUtils]: 36: Hoare triple {12753#(= ~z2~0 1)} [175] L43-1-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1] {12753#(= ~z2~0 1)} is VALID [2022-02-20 20:58:58,029 INFO L290 TraceCheckUtils]: 37: Hoare triple {12753#(= ~z2~0 1)} [184] L55-->L55-3: Formula: (= (mod |v_thread2Thread1of1ForFork1_#t~nondet2_3| 256) 0) InVars {thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} AuxVars[] AssignedVars[] {12753#(= ~z2~0 1)} is VALID [2022-02-20 20:58:58,030 INFO L290 TraceCheckUtils]: 38: Hoare triple {12753#(= ~z2~0 1)} [186] L55-3-->L58: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet2] {12753#(= ~z2~0 1)} is VALID [2022-02-20 20:58:58,030 INFO L290 TraceCheckUtils]: 39: Hoare triple {12753#(= ~z2~0 1)} [188] L58-->L55-4: Formula: (= v_~x2~0_2 v_~z2~0_1) InVars {~z2~0=v_~z2~0_1} OutVars{~x2~0=v_~x2~0_2, ~z2~0=v_~z2~0_1} AuxVars[] AssignedVars[~x2~0] {12754#(= (+ (- 1) ~x2~0) 0)} is VALID [2022-02-20 20:58:58,030 INFO L290 TraceCheckUtils]: 40: Hoare triple {12754#(= (+ (- 1) ~x2~0) 0)} [189] L55-4-->L62: Formula: (= v_~l2~0_1 (+ v_~x2~0_3 v_~y~0_2)) InVars {~y~0=v_~y~0_2, ~x2~0=v_~x2~0_3} OutVars{~x2~0=v_~x2~0_3, ~y~0=v_~y~0_2, ~l2~0=v_~l2~0_1} AuxVars[] AssignedVars[~l2~0] {12755#(and (<= ~l2~0 (+ ~y~0 1)) (<= (+ ~y~0 1) ~l2~0))} is VALID [2022-02-20 20:58:58,031 INFO L290 TraceCheckUtils]: 41: Hoare triple {12755#(and (<= ~l2~0 (+ ~y~0 1)) (<= (+ ~y~0 1) ~l2~0))} [177] L44-->L43-4: Formula: (= v_~x1~0_1 1) InVars {} OutVars{~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[~x1~0] {12756#(and (<= ~l2~0 (+ ~y~0 1)) (= (+ (- 1) ~x1~0) 0) (<= (+ ~y~0 1) ~l2~0))} is VALID [2022-02-20 20:58:58,031 INFO L290 TraceCheckUtils]: 42: Hoare triple {12756#(and (<= ~l2~0 (+ ~y~0 1)) (= (+ (- 1) ~x1~0) 0) (<= (+ ~y~0 1) ~l2~0))} [179] L43-4-->L50: Formula: (= (+ v_~x1~0_3 v_~y~0_1) v_~l1~0_1) InVars {~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} OutVars{~l1~0=v_~l1~0_1, ~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~l1~0] {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:58,032 INFO L290 TraceCheckUtils]: 43: Hoare triple {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [180] L50-->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] {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:58,032 INFO L290 TraceCheckUtils]: 44: Hoare triple {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [181] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:58,033 INFO L290 TraceCheckUtils]: 45: Hoare triple {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [103] L71-4-->L71-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:58,033 INFO L290 TraceCheckUtils]: 46: Hoare triple {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [136] L71-5-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:58,033 INFO L290 TraceCheckUtils]: 47: Hoare triple {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [167] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:58,034 INFO L290 TraceCheckUtils]: 48: Hoare triple {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [196] thread1EXIT-->L72-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem8#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:58,034 INFO L290 TraceCheckUtils]: 49: Hoare triple {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [190] L62-->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] {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:58,034 INFO L290 TraceCheckUtils]: 50: Hoare triple {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [191] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:58,035 INFO L290 TraceCheckUtils]: 51: Hoare triple {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [100] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:58,035 INFO L290 TraceCheckUtils]: 52: Hoare triple {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [122] L73-->L73-1: Formula: (= |v_ULTIMATE.start_main_#t~mem9#1_2| (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|)) 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_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_2|, 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|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:58,036 INFO L290 TraceCheckUtils]: 53: Hoare triple {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [197] thread2EXIT-->L73-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem9#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:58,036 INFO L290 TraceCheckUtils]: 54: Hoare triple {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [123] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:58,037 INFO L290 TraceCheckUtils]: 55: Hoare triple {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [159] L75-->L75-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:58,037 INFO L290 TraceCheckUtils]: 56: Hoare triple {12757#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [119] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (= (mod v_~l1~0_3 4294967296) (mod v_~l2~0_3 4294967296))) 1 0)) InVars {~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3} OutVars{~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {12758#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:58,038 INFO L290 TraceCheckUtils]: 57: Hoare triple {12758#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [143] L75-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] {12758#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:58,038 INFO L290 TraceCheckUtils]: 58: Hoare triple {12758#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [118] 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] {12759#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:58:58,038 INFO L290 TraceCheckUtils]: 59: Hoare triple {12759#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [146] 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[] {12752#false} is VALID [2022-02-20 20:58:58,038 INFO L290 TraceCheckUtils]: 60: Hoare triple {12752#false} [140] L34-1-->L76: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12752#false} is VALID [2022-02-20 20:58:58,039 INFO L290 TraceCheckUtils]: 61: Hoare triple {12752#false} [169] L76-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12752#false} is VALID [2022-02-20 20:58:58,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:58:58,039 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:58:58,039 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011466998] [2022-02-20 20:58:58,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011466998] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:58:58,039 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:58:58,039 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:58:58,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854932587] [2022-02-20 20:58:58,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:58:58,040 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 20:58:58,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:58:58,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:58,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:58:58,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:58:58,075 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:58:58,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:58:58,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:58:58,076 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 81 [2022-02-20 20:58:58,077 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 70 transitions, 201 flow. Second operand has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:58,077 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:58:58,077 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 81 [2022-02-20 20:58:58,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:58:58,328 INFO L129 PetriNetUnfolder]: 17/200 cut-off events. [2022-02-20 20:58:58,328 INFO L130 PetriNetUnfolder]: For 166/166 co-relation queries the response was YES. [2022-02-20 20:58:58,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 200 events. 17/200 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 783 event pairs, 2 based on Foata normal form. 1/195 useless extension candidates. Maximal degree in co-relation 405. Up to 40 conditions per place. [2022-02-20 20:58:58,330 INFO L132 encePairwiseOnDemand]: 72/81 looper letters, 28 selfloop transitions, 5 changer transitions 8/87 dead transitions. [2022-02-20 20:58:58,330 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 87 transitions, 360 flow [2022-02-20 20:58:58,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 20:58:58,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-02-20 20:58:58,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 543 transitions. [2022-02-20 20:58:58,333 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2022-02-20 20:58:58,334 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 543 transitions. [2022-02-20 20:58:58,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 543 transitions. [2022-02-20 20:58:58,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:58:58,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 543 transitions. [2022-02-20 20:58:58,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 60.333333333333336) internal successors, (543), 9 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:58,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:58,337 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:58,338 INFO L186 Difference]: Start difference. First operand has 104 places, 70 transitions, 201 flow. Second operand 9 states and 543 transitions. [2022-02-20 20:58:58,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 87 transitions, 360 flow [2022-02-20 20:58:59,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 87 transitions, 327 flow, removed 9 selfloop flow, removed 11 redundant places. [2022-02-20 20:58:59,037 INFO L242 Difference]: Finished difference. Result has 99 places, 70 transitions, 199 flow [2022-02-20 20:58:59,037 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=199, PETRI_PLACES=99, PETRI_TRANSITIONS=70} [2022-02-20 20:58:59,039 INFO L334 CegarLoopForPetriNet]: 74 programPoint places, 25 predicate places. [2022-02-20 20:58:59,039 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 99 places, 70 transitions, 199 flow [2022-02-20 20:58:59,051 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 877 states, 869 states have (on average 2.3130034522439584) internal successors, (2010), 876 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:59,052 INFO L78 Accepts]: Start accepts. Automaton has has 877 states, 869 states have (on average 2.3130034522439584) internal successors, (2010), 876 states have internal predecessors, (2010), 0 states have call successors, (0), 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 62 [2022-02-20 20:58:59,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:58:59,052 INFO L470 AbstractCegarLoop]: Abstraction has has 99 places, 70 transitions, 199 flow [2022-02-20 20:58:59,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:59,052 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:58:59,052 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] [2022-02-20 20:58:59,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 20:58:59,053 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:58:59,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:58:59,053 INFO L85 PathProgramCache]: Analyzing trace with hash -322699621, now seen corresponding path program 10 times [2022-02-20 20:58:59,053 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:58:59,054 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846322665] [2022-02-20 20:58:59,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:58:59,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:58:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:58:59,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {13656#true} [149] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13656#true} is VALID [2022-02-20 20:58:59,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {13656#true} [129] 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] {13656#true} is VALID [2022-02-20 20:58:59,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {13656#true} [154] 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[] {13656#true} is VALID [2022-02-20 20:58:59,177 INFO L290 TraceCheckUtils]: 3: Hoare triple {13656#true} [156] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {13656#true} is VALID [2022-02-20 20:58:59,177 INFO L290 TraceCheckUtils]: 4: Hoare triple {13656#true} [120] 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[] {13656#true} is VALID [2022-02-20 20:58:59,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {13656#true} [144] 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[] {13656#true} is VALID [2022-02-20 20:58:59,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {13656#true} [142] 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[] {13656#true} is VALID [2022-02-20 20:58:59,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {13656#true} [106] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 15 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {13656#true} is VALID [2022-02-20 20:58:59,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {13656#true} [164] L21-4-->L38: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] {13656#true} is VALID [2022-02-20 20:58:59,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {13656#true} [165] L38-->L38-1: Formula: (= v_~x1~0_4 0) InVars {} OutVars{~x1~0=v_~x1~0_4} AuxVars[] AssignedVars[~x1~0] {13656#true} is VALID [2022-02-20 20:58:59,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {13656#true} [107] L38-1-->L38-2: Formula: (= v_~z1~0_3 0) InVars {} OutVars{~z1~0=v_~z1~0_3} AuxVars[] AssignedVars[~z1~0] {13656#true} is VALID [2022-02-20 20:58:59,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {13656#true} [151] L38-2-->L38-3: Formula: (= v_~l1~0_2 0) InVars {} OutVars{~l1~0=v_~l1~0_2} AuxVars[] AssignedVars[~l1~0] {13656#true} is VALID [2022-02-20 20:58:59,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {13656#true} [127] L38-3-->L38-4: Formula: (= v_~x2~0_4 0) InVars {} OutVars{~x2~0=v_~x2~0_4} AuxVars[] AssignedVars[~x2~0] {13656#true} is VALID [2022-02-20 20:58:59,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {13656#true} [98] L38-4-->L38-5: Formula: (= v_~z2~0_3 0) InVars {} OutVars{~z2~0=v_~z2~0_3} AuxVars[] AssignedVars[~z2~0] {13656#true} is VALID [2022-02-20 20:58:59,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {13656#true} [97] L38-5-->L-1-3: Formula: (= v_~l2~0_2 0) InVars {} OutVars{~l2~0=v_~l2~0_2} AuxVars[] AssignedVars[~l2~0] {13656#true} is VALID [2022-02-20 20:58:59,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {13656#true} [161] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13656#true} is VALID [2022-02-20 20:58:59,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {13656#true} [139] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13656#true} is VALID [2022-02-20 20:58:59,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {13656#true} [104] 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] {13656#true} is VALID [2022-02-20 20:58:59,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {13656#true} [137] L-1-6-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {13656#true} is VALID [2022-02-20 20:58:59,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {13656#true} [126] L66-->L66-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] {13656#true} is VALID [2022-02-20 20:58:59,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {13656#true} [157] L66-1-->L66-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] {13656#true} is VALID [2022-02-20 20:58:59,179 INFO L290 TraceCheckUtils]: 21: Hoare triple {13656#true} [132] L66-2-->L68: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_2| v_~y~0_4) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~y~0=v_~y~0_4} AuxVars[] AssignedVars[~y~0] {13656#true} is VALID [2022-02-20 20:58:59,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {13656#true} [152] L68-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {13656#true} is VALID [2022-02-20 20:58:59,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {13656#true} [168] L70-->L70-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {13656#true} is VALID [2022-02-20 20:58:59,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {13656#true} [117] L70-1-->L70-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {13656#true} is VALID [2022-02-20 20:58:59,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {13656#true} [116] L70-2-->L70-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {13656#true} is VALID [2022-02-20 20:58:59,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {13656#true} [193] L70-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{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, thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_10|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~nondet1] {13656#true} is VALID [2022-02-20 20:58:59,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {13656#true} [105] L70-4-->L70-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {13656#true} is VALID [2022-02-20 20:58:59,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {13656#true} [150] L70-5-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {13656#true} is VALID [2022-02-20 20:58:59,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {13656#true} [99] L71-->L71-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {13656#true} is VALID [2022-02-20 20:58:59,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {13656#true} [110] L71-1-->L71-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {13656#true} is VALID [2022-02-20 20:58:59,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {13656#true} [155] L71-2-->L71-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~pre6#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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] {13656#true} is VALID [2022-02-20 20:58:59,181 INFO L290 TraceCheckUtils]: 32: Hoare triple {13656#true} [195] L71-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_10|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~nondet2, thread2Thread1of1ForFork1_thidvar1] {13656#true} is VALID [2022-02-20 20:58:59,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {13656#true} [182] thread2ENTRY-->L55: Formula: (= v_~z2~0_2 1) InVars {} OutVars{~z2~0=v_~z2~0_2} AuxVars[] AssignedVars[~z2~0] {13658#(= ~z2~0 1)} is VALID [2022-02-20 20:58:59,181 INFO L290 TraceCheckUtils]: 34: Hoare triple {13658#(= ~z2~0 1)} [172] thread1ENTRY-->L43: Formula: (= v_~z1~0_1 1) InVars {} OutVars{~z1~0=v_~z1~0_1} AuxVars[] AssignedVars[~z1~0] {13658#(= ~z2~0 1)} is VALID [2022-02-20 20:58:59,182 INFO L290 TraceCheckUtils]: 35: Hoare triple {13658#(= ~z2~0 1)} [173] L43-->L43-1: Formula: (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1_1| 256) 0)) InVars {thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} AuxVars[] AssignedVars[] {13658#(= ~z2~0 1)} is VALID [2022-02-20 20:58:59,182 INFO L290 TraceCheckUtils]: 36: Hoare triple {13658#(= ~z2~0 1)} [175] L43-1-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1] {13658#(= ~z2~0 1)} is VALID [2022-02-20 20:58:59,182 INFO L290 TraceCheckUtils]: 37: Hoare triple {13658#(= ~z2~0 1)} [184] L55-->L55-3: Formula: (= (mod |v_thread2Thread1of1ForFork1_#t~nondet2_3| 256) 0) InVars {thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} AuxVars[] AssignedVars[] {13658#(= ~z2~0 1)} is VALID [2022-02-20 20:58:59,182 INFO L290 TraceCheckUtils]: 38: Hoare triple {13658#(= ~z2~0 1)} [186] L55-3-->L58: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet2] {13658#(= ~z2~0 1)} is VALID [2022-02-20 20:58:59,183 INFO L290 TraceCheckUtils]: 39: Hoare triple {13658#(= ~z2~0 1)} [188] L58-->L55-4: Formula: (= v_~x2~0_2 v_~z2~0_1) InVars {~z2~0=v_~z2~0_1} OutVars{~x2~0=v_~x2~0_2, ~z2~0=v_~z2~0_1} AuxVars[] AssignedVars[~x2~0] {13659#(= (+ (- 1) ~x2~0) 0)} is VALID [2022-02-20 20:58:59,183 INFO L290 TraceCheckUtils]: 40: Hoare triple {13659#(= (+ (- 1) ~x2~0) 0)} [177] L44-->L43-4: Formula: (= v_~x1~0_1 1) InVars {} OutVars{~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[~x1~0] {13660#(and (= (+ (- 1) ~x2~0) 0) (= (+ (- 1) ~x1~0) 0))} is VALID [2022-02-20 20:58:59,183 INFO L290 TraceCheckUtils]: 41: Hoare triple {13660#(and (= (+ (- 1) ~x2~0) 0) (= (+ (- 1) ~x1~0) 0))} [189] L55-4-->L62: Formula: (= v_~l2~0_1 (+ v_~x2~0_3 v_~y~0_2)) InVars {~y~0=v_~y~0_2, ~x2~0=v_~x2~0_3} OutVars{~x2~0=v_~x2~0_3, ~y~0=v_~y~0_2, ~l2~0=v_~l2~0_1} AuxVars[] AssignedVars[~l2~0] {13661#(and (<= ~l2~0 (+ ~y~0 1)) (= (+ (- 1) ~x1~0) 0) (<= (+ ~y~0 1) ~l2~0))} is VALID [2022-02-20 20:58:59,184 INFO L290 TraceCheckUtils]: 42: Hoare triple {13661#(and (<= ~l2~0 (+ ~y~0 1)) (= (+ (- 1) ~x1~0) 0) (<= (+ ~y~0 1) ~l2~0))} [190] L62-->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] {13661#(and (<= ~l2~0 (+ ~y~0 1)) (= (+ (- 1) ~x1~0) 0) (<= (+ ~y~0 1) ~l2~0))} is VALID [2022-02-20 20:58:59,184 INFO L290 TraceCheckUtils]: 43: Hoare triple {13661#(and (<= ~l2~0 (+ ~y~0 1)) (= (+ (- 1) ~x1~0) 0) (<= (+ ~y~0 1) ~l2~0))} [191] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13661#(and (<= ~l2~0 (+ ~y~0 1)) (= (+ (- 1) ~x1~0) 0) (<= (+ ~y~0 1) ~l2~0))} is VALID [2022-02-20 20:58:59,185 INFO L290 TraceCheckUtils]: 44: Hoare triple {13661#(and (<= ~l2~0 (+ ~y~0 1)) (= (+ (- 1) ~x1~0) 0) (<= (+ ~y~0 1) ~l2~0))} [179] L43-4-->L50: Formula: (= (+ v_~x1~0_3 v_~y~0_1) v_~l1~0_1) InVars {~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} OutVars{~l1~0=v_~l1~0_1, ~y~0=v_~y~0_1, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~l1~0] {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:59,185 INFO L290 TraceCheckUtils]: 45: Hoare triple {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [180] L50-->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] {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:59,186 INFO L290 TraceCheckUtils]: 46: Hoare triple {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [181] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:59,186 INFO L290 TraceCheckUtils]: 47: Hoare triple {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [103] L71-4-->L71-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:59,186 INFO L290 TraceCheckUtils]: 48: Hoare triple {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [136] L71-5-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:59,187 INFO L290 TraceCheckUtils]: 49: Hoare triple {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [167] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:59,187 INFO L290 TraceCheckUtils]: 50: Hoare triple {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [196] thread1EXIT-->L72-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem8#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:59,188 INFO L290 TraceCheckUtils]: 51: Hoare triple {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [100] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:59,188 INFO L290 TraceCheckUtils]: 52: Hoare triple {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [122] L73-->L73-1: Formula: (= |v_ULTIMATE.start_main_#t~mem9#1_2| (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|)) 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_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_2|, 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|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:59,188 INFO L290 TraceCheckUtils]: 53: Hoare triple {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [197] thread2EXIT-->L73-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem9#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:59,189 INFO L290 TraceCheckUtils]: 54: Hoare triple {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [123] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:59,189 INFO L290 TraceCheckUtils]: 55: Hoare triple {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [159] L75-->L75-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} is VALID [2022-02-20 20:58:59,190 INFO L290 TraceCheckUtils]: 56: Hoare triple {13662#(= (+ (* (div ~l2~0 4294967296) 4294967296) ~l1~0) (+ (* (div ~l1~0 4294967296) 4294967296) ~l2~0))} [119] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (= (mod v_~l1~0_3 4294967296) (mod v_~l2~0_3 4294967296))) 1 0)) InVars {~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3} OutVars{~l1~0=v_~l1~0_3, ~l2~0=v_~l2~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {13663#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:59,190 INFO L290 TraceCheckUtils]: 57: Hoare triple {13663#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [143] L75-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] {13663#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:59,190 INFO L290 TraceCheckUtils]: 58: Hoare triple {13663#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [118] 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] {13664#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:58:59,191 INFO L290 TraceCheckUtils]: 59: Hoare triple {13664#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [146] 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[] {13657#false} is VALID [2022-02-20 20:58:59,191 INFO L290 TraceCheckUtils]: 60: Hoare triple {13657#false} [140] L34-1-->L76: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13657#false} is VALID [2022-02-20 20:58:59,191 INFO L290 TraceCheckUtils]: 61: Hoare triple {13657#false} [169] L76-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13657#false} is VALID [2022-02-20 20:58:59,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:58:59,191 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:58:59,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846322665] [2022-02-20 20:58:59,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846322665] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:58:59,192 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:58:59,192 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:58:59,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033251167] [2022-02-20 20:58:59,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:58:59,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 20:58:59,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:58:59,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:59,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:58:59,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:58:59,232 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:58:59,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:58:59,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:58:59,232 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 81 [2022-02-20 20:58:59,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 70 transitions, 199 flow. Second operand has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:59,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:58:59,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 81 [2022-02-20 20:58:59,233 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:58:59,497 INFO L129 PetriNetUnfolder]: 17/181 cut-off events. [2022-02-20 20:58:59,498 INFO L130 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2022-02-20 20:58:59,498 INFO L84 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 181 events. 17/181 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 666 event pairs, 2 based on Foata normal form. 2/177 useless extension candidates. Maximal degree in co-relation 370. Up to 38 conditions per place. [2022-02-20 20:58:59,498 INFO L132 encePairwiseOnDemand]: 72/81 looper letters, 25 selfloop transitions, 3 changer transitions 13/85 dead transitions. [2022-02-20 20:58:59,498 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 85 transitions, 344 flow [2022-02-20 20:58:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 20:58:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-02-20 20:58:59,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 542 transitions. [2022-02-20 20:58:59,502 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7434842249657064 [2022-02-20 20:58:59,502 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 542 transitions. [2022-02-20 20:58:59,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 542 transitions. [2022-02-20 20:58:59,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:58:59,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 542 transitions. [2022-02-20 20:58:59,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 60.22222222222222) internal successors, (542), 9 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:59,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:59,505 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:59,505 INFO L186 Difference]: Start difference. First operand has 99 places, 70 transitions, 199 flow. Second operand 9 states and 542 transitions. [2022-02-20 20:58:59,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 85 transitions, 344 flow