./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-nondet/nondet-array-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-nondet/nondet-array-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e22e1beeef18edf77effe210ae0122c1338eccee79cdab905e0b74599361bc08 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:39:22,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:39:22,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:39:22,807 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:39:22,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:39:22,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:39:22,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:39:22,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:39:22,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:39:22,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:39:22,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:39:22,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:39:22,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:39:22,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:39:22,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:39:22,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:39:22,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:39:22,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:39:22,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:39:22,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:39:22,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:39:22,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:39:22,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:39:22,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:39:22,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:39:22,842 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:39:22,842 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:39:22,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:39:22,844 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:39:22,844 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:39:22,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:39:22,845 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:39:22,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:39:22,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:39:22,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:39:22,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:39:22,848 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:39:22,848 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:39:22,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:39:22,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:39:22,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:39:22,851 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:39:22,874 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:39:22,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:39:22,875 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:39:22,875 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:39:22,876 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:39:22,876 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:39:22,876 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:39:22,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:39:22,876 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:39:22,877 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:39:22,877 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:39:22,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:39:22,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:39:22,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:39:22,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:39:22,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:39:22,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:39:22,878 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:39:22,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:39:22,879 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:39:22,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:39:22,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:39:22,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:39:22,879 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:39:22,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:39:22,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:39:22,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:39:22,881 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:39:22,881 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:39:22,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:39:22,881 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:39:22,881 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:39:22,881 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:39:22,881 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 -> e22e1beeef18edf77effe210ae0122c1338eccee79cdab905e0b74599361bc08 [2022-02-20 20:39:23,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:39:23,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:39:23,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:39:23,081 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:39:23,082 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:39:23,083 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-nondet/nondet-array-1.i [2022-02-20 20:39:23,132 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f2ea40b8/eae275531e62450d812cb4c257a94607/FLAG30e0d6bee [2022-02-20 20:39:23,571 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:39:23,574 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-array-1.i [2022-02-20 20:39:23,585 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f2ea40b8/eae275531e62450d812cb4c257a94607/FLAG30e0d6bee [2022-02-20 20:39:23,914 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f2ea40b8/eae275531e62450d812cb4c257a94607 [2022-02-20 20:39:23,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:39:23,917 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:39:23,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:39:23,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:39:23,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:39:23,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:39:23" (1/1) ... [2022-02-20 20:39:23,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21eaebba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:39:23, skipping insertion in model container [2022-02-20 20:39:23,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:39:23" (1/1) ... [2022-02-20 20:39:23,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:39:23,965 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:39:24,242 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-array-1.i[30035,30048] [2022-02-20 20:39:24,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:39:24,273 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:39:24,307 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-array-1.i[30035,30048] [2022-02-20 20:39:24,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:39:24,348 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:39:24,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:39:24 WrapperNode [2022-02-20 20:39:24,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:39:24,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:39:24,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:39:24,350 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:39:24,355 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:39:24" (1/1) ... [2022-02-20 20:39:24,379 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:39:24" (1/1) ... [2022-02-20 20:39:24,405 INFO L137 Inliner]: procedures = 170, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2022-02-20 20:39:24,407 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:39:24,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:39:24,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:39:24,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:39:24,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:39:24" (1/1) ... [2022-02-20 20:39:24,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:39:24" (1/1) ... [2022-02-20 20:39:24,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:39:24" (1/1) ... [2022-02-20 20:39:24,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:39:24" (1/1) ... [2022-02-20 20:39:24,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:39:24" (1/1) ... [2022-02-20 20:39:24,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:39:24" (1/1) ... [2022-02-20 20:39:24,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:39:24" (1/1) ... [2022-02-20 20:39:24,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:39:24,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:39:24,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:39:24,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:39:24,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:39:24" (1/1) ... [2022-02-20 20:39:24,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:39:24,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:39:24,479 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:39:24,485 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:39:24,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 20:39:24,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 20:39:24,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:39:24,516 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2022-02-20 20:39:24,516 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2022-02-20 20:39:24,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:39:24,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:39:24,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:39:24,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:39:24,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:39:24,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:39:24,520 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:39:24,620 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:39:24,621 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:39:24,828 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:39:24,833 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:39:24,835 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 20:39:24,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:39:24 BoogieIcfgContainer [2022-02-20 20:39:24,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:39:24,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:39:24,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:39:24,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:39:24,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:39:23" (1/3) ... [2022-02-20 20:39:24,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313bf532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:39:24, skipping insertion in model container [2022-02-20 20:39:24,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:39:24" (2/3) ... [2022-02-20 20:39:24,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313bf532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:39:24, skipping insertion in model container [2022-02-20 20:39:24,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:39:24" (3/3) ... [2022-02-20 20:39:24,845 INFO L111 eAbstractionObserver]: Analyzing ICFG nondet-array-1.i [2022-02-20 20:39:24,850 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:39:24,850 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:39:24,850 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:39:24,851 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:39:24,906 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:24,906 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:24,906 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:24,907 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:24,907 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:24,907 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:24,907 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:24,908 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:24,909 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:24,909 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:24,909 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:24,910 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:24,910 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:24,911 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:24,917 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:24,920 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:24,920 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:24,921 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:24,921 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:24,926 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-02-20 20:39:24,964 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:39:24,970 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:39:24,970 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:39:24,979 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 88 transitions, 184 flow [2022-02-20 20:39:25,032 INFO L129 PetriNetUnfolder]: 12/126 cut-off events. [2022-02-20 20:39:25,033 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:39:25,035 INFO L84 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 126 events. 12/126 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 225 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 71. Up to 4 conditions per place. [2022-02-20 20:39:25,035 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 88 transitions, 184 flow [2022-02-20 20:39:25,051 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 78 transitions, 164 flow [2022-02-20 20:39:25,070 INFO L129 PetriNetUnfolder]: 6/74 cut-off events. [2022-02-20 20:39:25,071 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:39:25,071 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:39:25,071 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] [2022-02-20 20:39:25,072 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:39:25,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:39:25,075 INFO L85 PathProgramCache]: Analyzing trace with hash -744396743, now seen corresponding path program 1 times [2022-02-20 20:39:25,081 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:39:25,082 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872466553] [2022-02-20 20:39:25,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:39:25,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:39:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:39:25,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {87#true} [187] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87#true} is VALID [2022-02-20 20:39:25,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {87#true} [167] 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] {87#true} is VALID [2022-02-20 20:39:25,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {87#true} [196] 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[] {87#true} is VALID [2022-02-20 20:39:25,266 INFO L290 TraceCheckUtils]: 3: Hoare triple {87#true} [199] L-1-2-->L683: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {87#true} is VALID [2022-02-20 20:39:25,266 INFO L290 TraceCheckUtils]: 4: Hoare triple {87#true} [137] L683-->L683-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {87#true} is VALID [2022-02-20 20:39:25,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {87#true} [185] L683-1-->L683-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {87#true} is VALID [2022-02-20 20:39:25,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {87#true} [165] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {87#true} is VALID [2022-02-20 20:39:25,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {87#true} [195] L683-3-->L683-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {87#true} is VALID [2022-02-20 20:39:25,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {87#true} [127] L683-4-->L690: Formula: (and (= |v_~#a~0.offset_1| 0) (= |v_~#a~0.base_1| 3)) InVars {} OutVars{~#a~0.base=|v_~#a~0.base_1|, ~#a~0.offset=|v_~#a~0.offset_1|} AuxVars[] AssignedVars[~#a~0.base, ~#a~0.offset] {87#true} is VALID [2022-02-20 20:39:25,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {87#true} [193] L690-->L690-1: Formula: (and (= (select |v_#valid_4| 3) 1) (= 40 (select |v_#length_3| 3))) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {87#true} is VALID [2022-02-20 20:39:25,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {87#true} [131] L690-1-->L690-2: Formula: (= (store |v_#memory_int_4| |v_~#a~0.base_2| ((as const (Array Int Int)) 0)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ~#a~0.base=|v_~#a~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#a~0.base=|v_~#a~0.base_2|} AuxVars[] AssignedVars[#memory_int] {87#true} is VALID [2022-02-20 20:39:25,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {87#true} [149] L690-2-->L690-3: Formula: (= (store |v_#memory_int_6| |v_~#a~0.base_3| (store (select |v_#memory_int_6| |v_~#a~0.base_3|) |v_~#a~0.offset_2| 0)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ~#a~0.base=|v_~#a~0.base_3|, ~#a~0.offset=|v_~#a~0.offset_2|} OutVars{#memory_int=|v_#memory_int_5|, ~#a~0.base=|v_~#a~0.base_3|, ~#a~0.offset=|v_~#a~0.offset_2|} AuxVars[] AssignedVars[#memory_int] {87#true} is VALID [2022-02-20 20:39:25,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {87#true} [163] L690-3-->L-1-3: Formula: (= v_~x~0_1 0) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] {87#true} is VALID [2022-02-20 20:39:25,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {87#true} [201] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87#true} is VALID [2022-02-20 20:39:25,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {87#true} [173] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87#true} is VALID [2022-02-20 20:39:25,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {87#true} [142] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {87#true} is VALID [2022-02-20 20:39:25,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {87#true} [171] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {87#true} is VALID [2022-02-20 20:39:25,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {87#true} [138] L-1-7-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_1|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_1|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t~1#1.offset, ULTIMATE.start_main_~#t~1#1.base, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~sum~0#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_#t~post4#1] {87#true} is VALID [2022-02-20 20:39:25,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {87#true} [161] L697-->L697-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {87#true} is VALID [2022-02-20 20:39:25,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {87#true} [143] L697-1-->L698: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {87#true} is VALID [2022-02-20 20:39:25,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {87#true} [156] L698-->L698-1: Formula: (and (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#t~1#1.base_2| 40)) (not (= |v_ULTIMATE.start_main_~#t~1#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~1#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t~1#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t~1#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t~1#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_2|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~1#1.offset, ULTIMATE.start_main_~#t~1#1.base, #valid, #length] {87#true} is VALID [2022-02-20 20:39:25,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {87#true} [154] L698-1-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {87#true} is VALID [2022-02-20 20:39:25,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {87#true} [200] L700-->L700-1: Formula: (= |v_ULTIMATE.start_main_~n~0#1_2| (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~nondet3#1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_2|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0#1] {87#true} is VALID [2022-02-20 20:39:25,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {87#true} [203] L700-1-->L701: 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] {87#true} is VALID [2022-02-20 20:39:25,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {87#true} [194] L701-->L701-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87#true} is VALID [2022-02-20 20:39:25,274 INFO L290 TraceCheckUtils]: 25: Hoare triple {87#true} [146] L701-1-->L701-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 5 |v_ULTIMATE.start_main_~n~0#1_3|) (<= |v_ULTIMATE.start_main_~n~0#1_3| 10)) 1 0)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_3|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_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] {87#true} is VALID [2022-02-20 20:39:25,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {87#true} [150] L701-2-->L686: 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] {87#true} is VALID [2022-02-20 20:39:25,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {87#true} [210] L686-->L687: 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] {87#true} is VALID [2022-02-20 20:39:25,275 INFO L290 TraceCheckUtils]: 28: Hoare triple {87#true} [190] L687-->L686-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[] {87#true} is VALID [2022-02-20 20:39:25,275 INFO L290 TraceCheckUtils]: 29: Hoare triple {87#true} [152] L686-1-->L702: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87#true} is VALID [2022-02-20 20:39:25,275 INFO L290 TraceCheckUtils]: 30: Hoare triple {87#true} [148] L702-->L702-6: Formula: (= |v_ULTIMATE.start_main_~i~0#1_3| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {87#true} is VALID [2022-02-20 20:39:25,276 INFO L290 TraceCheckUtils]: 31: Hoare triple {87#true} [208] L702-6-->L702-7: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_4| |v_ULTIMATE.start_main_~n~0#1_4|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|} AuxVars[] AssignedVars[] {87#true} is VALID [2022-02-20 20:39:25,277 INFO L290 TraceCheckUtils]: 32: Hoare triple {87#true} [140] L702-7-->L705-5: Formula: (= |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {87#true} is VALID [2022-02-20 20:39:25,277 INFO L290 TraceCheckUtils]: 33: Hoare triple {87#true} [133] L705-5-->L705-6: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {88#false} is VALID [2022-02-20 20:39:25,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {88#false} [206] L705-6-->L709: Formula: (= |v_ULTIMATE.start_main_~sum~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~sum~0#1] {88#false} is VALID [2022-02-20 20:39:25,278 INFO L290 TraceCheckUtils]: 35: Hoare triple {88#false} [175] L709-->L709-6: Formula: (= |v_ULTIMATE.start_main_~i~0#1_15| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {88#false} is VALID [2022-02-20 20:39:25,278 INFO L290 TraceCheckUtils]: 36: Hoare triple {88#false} [176] L709-6-->L709-7: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {88#false} is VALID [2022-02-20 20:39:25,278 INFO L290 TraceCheckUtils]: 37: Hoare triple {88#false} [158] L709-7-->L712: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#false} is VALID [2022-02-20 20:39:25,279 INFO L290 TraceCheckUtils]: 38: Hoare triple {88#false} [204] L712-->L712-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= |v_ULTIMATE.start_main_~sum~0#1_5| 9) 1 0)) InVars {ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_5|} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {88#false} is VALID [2022-02-20 20:39:25,279 INFO L290 TraceCheckUtils]: 39: Hoare triple {88#false} [130] L712-1-->L689: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {88#false} is VALID [2022-02-20 20:39:25,279 INFO L290 TraceCheckUtils]: 40: Hoare triple {88#false} [139] L689-->L689-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {88#false} is VALID [2022-02-20 20:39:25,279 INFO L290 TraceCheckUtils]: 41: Hoare triple {88#false} [144] L689-1-->L689-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_3| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[] {88#false} is VALID [2022-02-20 20:39:25,280 INFO L290 TraceCheckUtils]: 42: Hoare triple {88#false} [197] L689-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#false} is VALID [2022-02-20 20:39:25,281 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:39:25,284 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:39:25,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872466553] [2022-02-20 20:39:25,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872466553] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:39:25,284 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:39:25,285 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:39:25,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148587823] [2022-02-20 20:39:25,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:39:25,303 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 20:39:25,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:39:25,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 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:39:25,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:39:25,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 20:39:25,354 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:39:25,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 20:39:25,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 20:39:25,378 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 88 [2022-02-20 20:39:25,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 164 flow. Second operand has 2 states, 2 states have (on average 81.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 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:39:25,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:39:25,381 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 88 [2022-02-20 20:39:25,387 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:39:25,432 INFO L129 PetriNetUnfolder]: 3/99 cut-off events. [2022-02-20 20:39:25,432 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-02-20 20:39:25,433 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 99 events. 3/99 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 145 event pairs, 0 based on Foata normal form. 7/99 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2022-02-20 20:39:25,434 INFO L132 encePairwiseOnDemand]: 84/88 looper letters, 2 selfloop transitions, 0 changer transitions 1/74 dead transitions. [2022-02-20 20:39:25,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 74 transitions, 160 flow [2022-02-20 20:39:25,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 20:39:25,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-02-20 20:39:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 166 transitions. [2022-02-20 20:39:25,457 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9431818181818182 [2022-02-20 20:39:25,457 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 166 transitions. [2022-02-20 20:39:25,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 166 transitions. [2022-02-20 20:39:25,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:39:25,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 166 transitions. [2022-02-20 20:39:25,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 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:39:25,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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:39:25,468 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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:39:25,469 INFO L186 Difference]: Start difference. First operand has 75 places, 78 transitions, 164 flow. Second operand 2 states and 166 transitions. [2022-02-20 20:39:25,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 74 transitions, 160 flow [2022-02-20 20:39:25,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 74 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-02-20 20:39:25,476 INFO L242 Difference]: Finished difference. Result has 76 places, 73 transitions, 154 flow [2022-02-20 20:39:25,477 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=154, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2022-02-20 20:39:25,480 INFO L334 CegarLoopForPetriNet]: 75 programPoint places, 1 predicate places. [2022-02-20 20:39:25,480 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 73 transitions, 154 flow [2022-02-20 20:39:25,496 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 246 states, 242 states have (on average 1.665289256198347) internal successors, (403), 245 states have internal predecessors, (403), 0 states have call successors, (0), 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:39:25,498 INFO L78 Accepts]: Start accepts. Automaton has has 246 states, 242 states have (on average 1.665289256198347) internal successors, (403), 245 states have internal predecessors, (403), 0 states have call successors, (0), 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 43 [2022-02-20 20:39:25,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:39:25,498 INFO L470 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 154 flow [2022-02-20 20:39:25,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 81.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 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:39:25,499 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:39:25,499 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] [2022-02-20 20:39:25,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:39:25,499 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:39:25,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:39:25,500 INFO L85 PathProgramCache]: Analyzing trace with hash -53406567, now seen corresponding path program 1 times [2022-02-20 20:39:25,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:39:25,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450968992] [2022-02-20 20:39:25,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:39:25,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:39:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:39:25,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#true} [187] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {337#true} is VALID [2022-02-20 20:39:25,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#true} [167] 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] {337#true} is VALID [2022-02-20 20:39:25,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {337#true} [196] 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[] {337#true} is VALID [2022-02-20 20:39:25,644 INFO L290 TraceCheckUtils]: 3: Hoare triple {337#true} [199] L-1-2-->L683: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {337#true} is VALID [2022-02-20 20:39:25,644 INFO L290 TraceCheckUtils]: 4: Hoare triple {337#true} [137] L683-->L683-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {337#true} is VALID [2022-02-20 20:39:25,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {337#true} [185] L683-1-->L683-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {337#true} is VALID [2022-02-20 20:39:25,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {337#true} [165] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {337#true} is VALID [2022-02-20 20:39:25,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {337#true} [195] L683-3-->L683-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {337#true} is VALID [2022-02-20 20:39:25,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {337#true} [127] L683-4-->L690: Formula: (and (= |v_~#a~0.offset_1| 0) (= |v_~#a~0.base_1| 3)) InVars {} OutVars{~#a~0.base=|v_~#a~0.base_1|, ~#a~0.offset=|v_~#a~0.offset_1|} AuxVars[] AssignedVars[~#a~0.base, ~#a~0.offset] {337#true} is VALID [2022-02-20 20:39:25,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {337#true} [193] L690-->L690-1: Formula: (and (= (select |v_#valid_4| 3) 1) (= 40 (select |v_#length_3| 3))) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {337#true} is VALID [2022-02-20 20:39:25,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {337#true} [131] L690-1-->L690-2: Formula: (= (store |v_#memory_int_4| |v_~#a~0.base_2| ((as const (Array Int Int)) 0)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ~#a~0.base=|v_~#a~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#a~0.base=|v_~#a~0.base_2|} AuxVars[] AssignedVars[#memory_int] {337#true} is VALID [2022-02-20 20:39:25,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {337#true} [149] L690-2-->L690-3: Formula: (= (store |v_#memory_int_6| |v_~#a~0.base_3| (store (select |v_#memory_int_6| |v_~#a~0.base_3|) |v_~#a~0.offset_2| 0)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ~#a~0.base=|v_~#a~0.base_3|, ~#a~0.offset=|v_~#a~0.offset_2|} OutVars{#memory_int=|v_#memory_int_5|, ~#a~0.base=|v_~#a~0.base_3|, ~#a~0.offset=|v_~#a~0.offset_2|} AuxVars[] AssignedVars[#memory_int] {337#true} is VALID [2022-02-20 20:39:25,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {337#true} [163] L690-3-->L-1-3: Formula: (= v_~x~0_1 0) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] {337#true} is VALID [2022-02-20 20:39:25,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {337#true} [201] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {337#true} is VALID [2022-02-20 20:39:25,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {337#true} [173] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {337#true} is VALID [2022-02-20 20:39:25,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {337#true} [142] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {337#true} is VALID [2022-02-20 20:39:25,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {337#true} [171] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {337#true} is VALID [2022-02-20 20:39:25,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {337#true} [138] L-1-7-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_1|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_1|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t~1#1.offset, ULTIMATE.start_main_~#t~1#1.base, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~sum~0#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_#t~post4#1] {337#true} is VALID [2022-02-20 20:39:25,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {337#true} [161] L697-->L697-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {337#true} is VALID [2022-02-20 20:39:25,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {337#true} [143] L697-1-->L698: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {337#true} is VALID [2022-02-20 20:39:25,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {337#true} [156] L698-->L698-1: Formula: (and (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#t~1#1.base_2| 40)) (not (= |v_ULTIMATE.start_main_~#t~1#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~1#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t~1#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t~1#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t~1#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_2|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~1#1.offset, ULTIMATE.start_main_~#t~1#1.base, #valid, #length] {337#true} is VALID [2022-02-20 20:39:25,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {337#true} [154] L698-1-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {337#true} is VALID [2022-02-20 20:39:25,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {337#true} [200] L700-->L700-1: Formula: (= |v_ULTIMATE.start_main_~n~0#1_2| (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~nondet3#1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_2|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0#1] {337#true} is VALID [2022-02-20 20:39:25,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {337#true} [203] L700-1-->L701: 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] {337#true} is VALID [2022-02-20 20:39:25,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {337#true} [194] L701-->L701-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {337#true} is VALID [2022-02-20 20:39:25,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {337#true} [146] L701-1-->L701-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 5 |v_ULTIMATE.start_main_~n~0#1_3|) (<= |v_ULTIMATE.start_main_~n~0#1_3| 10)) 1 0)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_3|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_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] {339#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:39:25,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {339#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [150] L701-2-->L686: 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] {339#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:39:25,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {339#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [210] L686-->L687: 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] {340#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))} is VALID [2022-02-20 20:39:25,651 INFO L290 TraceCheckUtils]: 28: Hoare triple {340#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))} [190] L687-->L686-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[] {341#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:25,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {341#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [152] L686-1-->L702: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {341#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:25,652 INFO L290 TraceCheckUtils]: 30: Hoare triple {341#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [148] L702-->L702-6: Formula: (= |v_ULTIMATE.start_main_~i~0#1_3| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {342#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:25,652 INFO L290 TraceCheckUtils]: 31: Hoare triple {342#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [208] L702-6-->L702-7: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_4| |v_ULTIMATE.start_main_~n~0#1_4|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|} AuxVars[] AssignedVars[] {338#false} is VALID [2022-02-20 20:39:25,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {338#false} [140] L702-7-->L705-5: Formula: (= |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {338#false} is VALID [2022-02-20 20:39:25,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {338#false} [134] L705-5-->L705-6: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_10| |v_ULTIMATE.start_main_~n~0#1_6|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] {338#false} is VALID [2022-02-20 20:39:25,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {338#false} [206] L705-6-->L709: Formula: (= |v_ULTIMATE.start_main_~sum~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~sum~0#1] {338#false} is VALID [2022-02-20 20:39:25,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {338#false} [175] L709-->L709-6: Formula: (= |v_ULTIMATE.start_main_~i~0#1_15| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {338#false} is VALID [2022-02-20 20:39:25,653 INFO L290 TraceCheckUtils]: 36: Hoare triple {338#false} [177] L709-6-->L709-7: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_16| |v_ULTIMATE.start_main_~n~0#1_8|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} AuxVars[] AssignedVars[] {338#false} is VALID [2022-02-20 20:39:25,654 INFO L290 TraceCheckUtils]: 37: Hoare triple {338#false} [158] L709-7-->L712: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {338#false} is VALID [2022-02-20 20:39:25,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {338#false} [204] L712-->L712-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= |v_ULTIMATE.start_main_~sum~0#1_5| 9) 1 0)) InVars {ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_5|} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {338#false} is VALID [2022-02-20 20:39:25,654 INFO L290 TraceCheckUtils]: 39: Hoare triple {338#false} [130] L712-1-->L689: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {338#false} is VALID [2022-02-20 20:39:25,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {338#false} [139] L689-->L689-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {338#false} is VALID [2022-02-20 20:39:25,654 INFO L290 TraceCheckUtils]: 41: Hoare triple {338#false} [144] L689-1-->L689-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_3| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[] {338#false} is VALID [2022-02-20 20:39:25,655 INFO L290 TraceCheckUtils]: 42: Hoare triple {338#false} [197] L689-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {338#false} is VALID [2022-02-20 20:39:25,655 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:39:25,655 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:39:25,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450968992] [2022-02-20 20:39:25,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450968992] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:39:25,656 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:39:25,656 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:39:25,656 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502788516] [2022-02-20 20:39:25,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:39:25,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 20:39:25,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:39:25,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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:39:25,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:39:25,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:39:25,685 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:39:25,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:39:25,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:39:25,687 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 88 [2022-02-20 20:39:25,687 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 56.166666666666664) internal successors, (337), 6 states have internal predecessors, (337), 0 states have call successors, (0), 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:39:25,687 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:39:25,688 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 88 [2022-02-20 20:39:25,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:39:25,800 INFO L129 PetriNetUnfolder]: 1/85 cut-off events. [2022-02-20 20:39:25,800 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:39:25,801 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 85 events. 1/85 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 31 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 124. Up to 15 conditions per place. [2022-02-20 20:39:25,801 INFO L132 encePairwiseOnDemand]: 76/88 looper letters, 24 selfloop transitions, 9 changer transitions 2/81 dead transitions. [2022-02-20 20:39:25,801 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 81 transitions, 240 flow [2022-02-20 20:39:25,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 20:39:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-02-20 20:39:25,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 362 transitions. [2022-02-20 20:39:25,806 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6856060606060606 [2022-02-20 20:39:25,806 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 362 transitions. [2022-02-20 20:39:25,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 362 transitions. [2022-02-20 20:39:25,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:39:25,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 362 transitions. [2022-02-20 20:39:25,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 60.333333333333336) internal successors, (362), 6 states have internal predecessors, (362), 0 states have call successors, (0), 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:39:25,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 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:39:25,809 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 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:39:25,809 INFO L186 Difference]: Start difference. First operand has 76 places, 73 transitions, 154 flow. Second operand 6 states and 362 transitions. [2022-02-20 20:39:25,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 81 transitions, 240 flow [2022-02-20 20:39:25,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 81 transitions, 240 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-02-20 20:39:25,812 INFO L242 Difference]: Finished difference. Result has 81 places, 74 transitions, 188 flow [2022-02-20 20:39:25,812 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=81, PETRI_TRANSITIONS=74} [2022-02-20 20:39:25,813 INFO L334 CegarLoopForPetriNet]: 75 programPoint places, 6 predicate places. [2022-02-20 20:39:25,813 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 74 transitions, 188 flow [2022-02-20 20:39:25,817 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 155 states, 152 states have (on average 1.480263157894737) internal successors, (225), 154 states have internal predecessors, (225), 0 states have call successors, (0), 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:39:25,817 INFO L78 Accepts]: Start accepts. Automaton has has 155 states, 152 states have (on average 1.480263157894737) internal successors, (225), 154 states have internal predecessors, (225), 0 states have call successors, (0), 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 43 [2022-02-20 20:39:25,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:39:25,818 INFO L470 AbstractCegarLoop]: Abstraction has has 81 places, 74 transitions, 188 flow [2022-02-20 20:39:25,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.166666666666664) internal successors, (337), 6 states have internal predecessors, (337), 0 states have call successors, (0), 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:39:25,818 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:39:25,818 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:39:25,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:39:25,819 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:39:25,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:39:25,819 INFO L85 PathProgramCache]: Analyzing trace with hash -658806082, now seen corresponding path program 1 times [2022-02-20 20:39:25,819 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:39:25,819 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940634899] [2022-02-20 20:39:25,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:39:25,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:39:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:39:25,845 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:39:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:39:25,890 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 20:39:25,891 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:39:25,891 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 2 remaining) [2022-02-20 20:39:25,892 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 20:39:25,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:39:25,895 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 20:39:25,896 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-02-20 20:39:25,896 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-02-20 20:39:25,910 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,910 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,910 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,910 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,911 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,911 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,911 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,911 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,911 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,911 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,911 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,912 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,912 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,912 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,912 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,912 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,913 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,913 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,913 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,913 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,913 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,913 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,913 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,914 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,914 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,914 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,914 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,914 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,915 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,915 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,915 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,915 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,915 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,916 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,916 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,916 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,916 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,916 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:25,920 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-02-20 20:39:25,921 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:39:25,922 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:39:25,922 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:39:25,923 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 92 places, 95 transitions, 208 flow [2022-02-20 20:39:25,944 INFO L129 PetriNetUnfolder]: 23/217 cut-off events. [2022-02-20 20:39:25,944 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-02-20 20:39:25,944 INFO L84 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 217 events. 23/217 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 512 event pairs, 0 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 128. Up to 8 conditions per place. [2022-02-20 20:39:25,945 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 95 transitions, 208 flow [2022-02-20 20:39:25,945 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 85 transitions, 188 flow [2022-02-20 20:39:25,949 INFO L129 PetriNetUnfolder]: 7/76 cut-off events. [2022-02-20 20:39:25,949 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:39:25,949 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:39:25,949 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] [2022-02-20 20:39:25,950 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:39:25,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:39:25,950 INFO L85 PathProgramCache]: Analyzing trace with hash 477382265, now seen corresponding path program 1 times [2022-02-20 20:39:25,950 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:39:25,950 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591672913] [2022-02-20 20:39:25,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:39:25,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:39:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:39:25,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {95#true} [282] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-02-20 20:39:25,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {95#true} [262] 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] {95#true} is VALID [2022-02-20 20:39:25,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {95#true} [291] 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[] {95#true} is VALID [2022-02-20 20:39:25,979 INFO L290 TraceCheckUtils]: 3: Hoare triple {95#true} [294] L-1-2-->L683: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {95#true} is VALID [2022-02-20 20:39:25,979 INFO L290 TraceCheckUtils]: 4: Hoare triple {95#true} [232] L683-->L683-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {95#true} is VALID [2022-02-20 20:39:25,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {95#true} [280] L683-1-->L683-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {95#true} is VALID [2022-02-20 20:39:25,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {95#true} [260] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {95#true} is VALID [2022-02-20 20:39:25,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {95#true} [290] L683-3-->L683-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {95#true} is VALID [2022-02-20 20:39:25,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {95#true} [222] L683-4-->L690: Formula: (and (= |v_~#a~0.offset_1| 0) (= |v_~#a~0.base_1| 3)) InVars {} OutVars{~#a~0.base=|v_~#a~0.base_1|, ~#a~0.offset=|v_~#a~0.offset_1|} AuxVars[] AssignedVars[~#a~0.base, ~#a~0.offset] {95#true} is VALID [2022-02-20 20:39:25,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {95#true} [288] L690-->L690-1: Formula: (and (= (select |v_#valid_4| 3) 1) (= 40 (select |v_#length_3| 3))) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {95#true} is VALID [2022-02-20 20:39:25,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {95#true} [226] L690-1-->L690-2: Formula: (= (store |v_#memory_int_4| |v_~#a~0.base_2| ((as const (Array Int Int)) 0)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ~#a~0.base=|v_~#a~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#a~0.base=|v_~#a~0.base_2|} AuxVars[] AssignedVars[#memory_int] {95#true} is VALID [2022-02-20 20:39:25,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {95#true} [244] L690-2-->L690-3: Formula: (= (store |v_#memory_int_6| |v_~#a~0.base_3| (store (select |v_#memory_int_6| |v_~#a~0.base_3|) |v_~#a~0.offset_2| 0)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ~#a~0.base=|v_~#a~0.base_3|, ~#a~0.offset=|v_~#a~0.offset_2|} OutVars{#memory_int=|v_#memory_int_5|, ~#a~0.base=|v_~#a~0.base_3|, ~#a~0.offset=|v_~#a~0.offset_2|} AuxVars[] AssignedVars[#memory_int] {95#true} is VALID [2022-02-20 20:39:25,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {95#true} [258] L690-3-->L-1-3: Formula: (= v_~x~0_1 0) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] {95#true} is VALID [2022-02-20 20:39:25,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {95#true} [296] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-02-20 20:39:25,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {95#true} [268] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-02-20 20:39:25,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {95#true} [237] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {95#true} is VALID [2022-02-20 20:39:25,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {95#true} [266] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {95#true} is VALID [2022-02-20 20:39:25,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {95#true} [233] L-1-7-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_1|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_1|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t~1#1.offset, ULTIMATE.start_main_~#t~1#1.base, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~sum~0#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_#t~post4#1] {95#true} is VALID [2022-02-20 20:39:25,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {95#true} [256] L697-->L697-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {95#true} is VALID [2022-02-20 20:39:25,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {95#true} [238] L697-1-->L698: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {95#true} is VALID [2022-02-20 20:39:25,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {95#true} [251] L698-->L698-1: Formula: (and (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#t~1#1.base_2| 40)) (not (= |v_ULTIMATE.start_main_~#t~1#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~1#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t~1#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t~1#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t~1#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_2|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~1#1.offset, ULTIMATE.start_main_~#t~1#1.base, #valid, #length] {95#true} is VALID [2022-02-20 20:39:25,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {95#true} [249] L698-1-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {95#true} is VALID [2022-02-20 20:39:25,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {95#true} [295] L700-->L700-1: Formula: (= |v_ULTIMATE.start_main_~n~0#1_2| (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~nondet3#1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_2|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0#1] {95#true} is VALID [2022-02-20 20:39:25,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {95#true} [298] L700-1-->L701: 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] {95#true} is VALID [2022-02-20 20:39:25,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {95#true} [289] L701-->L701-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-02-20 20:39:25,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {95#true} [241] L701-1-->L701-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 5 |v_ULTIMATE.start_main_~n~0#1_3|) (<= |v_ULTIMATE.start_main_~n~0#1_3| 10)) 1 0)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_3|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_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#true} is VALID [2022-02-20 20:39:25,983 INFO L290 TraceCheckUtils]: 26: Hoare triple {95#true} [245] L701-2-->L686: 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#true} is VALID [2022-02-20 20:39:25,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {95#true} [305] L686-->L687: 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] {95#true} is VALID [2022-02-20 20:39:25,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {95#true} [285] L687-->L686-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[] {95#true} is VALID [2022-02-20 20:39:25,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {95#true} [247] L686-1-->L702: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-02-20 20:39:25,984 INFO L290 TraceCheckUtils]: 30: Hoare triple {95#true} [243] L702-->L702-6: Formula: (= |v_ULTIMATE.start_main_~i~0#1_3| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {95#true} is VALID [2022-02-20 20:39:25,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {95#true} [303] L702-6-->L702-7: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_4| |v_ULTIMATE.start_main_~n~0#1_4|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|} AuxVars[] AssignedVars[] {95#true} is VALID [2022-02-20 20:39:25,984 INFO L290 TraceCheckUtils]: 32: Hoare triple {95#true} [235] L702-7-->L705-5: Formula: (= |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {95#true} is VALID [2022-02-20 20:39:25,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {95#true} [228] L705-5-->L705-6: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {96#false} is VALID [2022-02-20 20:39:25,985 INFO L290 TraceCheckUtils]: 34: Hoare triple {96#false} [301] L705-6-->L709: Formula: (= |v_ULTIMATE.start_main_~sum~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~sum~0#1] {96#false} is VALID [2022-02-20 20:39:25,985 INFO L290 TraceCheckUtils]: 35: Hoare triple {96#false} [270] L709-->L709-6: Formula: (= |v_ULTIMATE.start_main_~i~0#1_15| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {96#false} is VALID [2022-02-20 20:39:25,985 INFO L290 TraceCheckUtils]: 36: Hoare triple {96#false} [272] L709-6-->L709-7: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_16| |v_ULTIMATE.start_main_~n~0#1_8|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} AuxVars[] AssignedVars[] {96#false} is VALID [2022-02-20 20:39:25,985 INFO L290 TraceCheckUtils]: 37: Hoare triple {96#false} [253] L709-7-->L712: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {96#false} is VALID [2022-02-20 20:39:25,985 INFO L290 TraceCheckUtils]: 38: Hoare triple {96#false} [299] L712-->L712-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= |v_ULTIMATE.start_main_~sum~0#1_5| 9) 1 0)) InVars {ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_5|} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {96#false} is VALID [2022-02-20 20:39:25,986 INFO L290 TraceCheckUtils]: 39: Hoare triple {96#false} [225] L712-1-->L689: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {96#false} is VALID [2022-02-20 20:39:25,986 INFO L290 TraceCheckUtils]: 40: Hoare triple {96#false} [234] L689-->L689-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {96#false} is VALID [2022-02-20 20:39:25,986 INFO L290 TraceCheckUtils]: 41: Hoare triple {96#false} [239] L689-1-->L689-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_3| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[] {96#false} is VALID [2022-02-20 20:39:25,986 INFO L290 TraceCheckUtils]: 42: Hoare triple {96#false} [292] L689-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {96#false} is VALID [2022-02-20 20:39:25,986 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:39:25,987 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:39:25,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591672913] [2022-02-20 20:39:25,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591672913] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:39:25,987 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:39:25,987 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:39:25,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425000044] [2022-02-20 20:39:25,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:39:25,988 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 20:39:25,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:39:25,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 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:39:26,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:39:26,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 20:39:26,012 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:39:26,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 20:39:26,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 20:39:26,013 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 95 [2022-02-20 20:39:26,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 85 transitions, 188 flow. Second operand has 2 states, 2 states have (on average 85.5) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 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:39:26,013 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:39:26,013 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 95 [2022-02-20 20:39:26,013 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:39:26,029 INFO L129 PetriNetUnfolder]: 7/165 cut-off events. [2022-02-20 20:39:26,029 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-02-20 20:39:26,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 165 events. 7/165 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 344 event pairs, 0 based on Foata normal form. 12/165 useless extension candidates. Maximal degree in co-relation 103. Up to 8 conditions per place. [2022-02-20 20:39:26,030 INFO L132 encePairwiseOnDemand]: 91/95 looper letters, 4 selfloop transitions, 0 changer transitions 1/81 dead transitions. [2022-02-20 20:39:26,030 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 81 transitions, 188 flow [2022-02-20 20:39:26,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 20:39:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-02-20 20:39:26,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 178 transitions. [2022-02-20 20:39:26,033 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9368421052631579 [2022-02-20 20:39:26,033 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 178 transitions. [2022-02-20 20:39:26,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 178 transitions. [2022-02-20 20:39:26,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:39:26,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 178 transitions. [2022-02-20 20:39:26,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 89.0) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 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:39:26,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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:39:26,035 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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:39:26,035 INFO L186 Difference]: Start difference. First operand has 83 places, 85 transitions, 188 flow. Second operand 2 states and 178 transitions. [2022-02-20 20:39:26,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 81 transitions, 188 flow [2022-02-20 20:39:26,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 81 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-02-20 20:39:26,037 INFO L242 Difference]: Finished difference. Result has 84 places, 80 transitions, 178 flow [2022-02-20 20:39:26,038 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=178, PETRI_PLACES=84, PETRI_TRANSITIONS=80} [2022-02-20 20:39:26,038 INFO L334 CegarLoopForPetriNet]: 83 programPoint places, 1 predicate places. [2022-02-20 20:39:26,038 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 80 transitions, 178 flow [2022-02-20 20:39:26,060 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1518 states, 1512 states have (on average 2.4365079365079363) internal successors, (3684), 1517 states have internal predecessors, (3684), 0 states have call successors, (0), 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:39:26,063 INFO L78 Accepts]: Start accepts. Automaton has has 1518 states, 1512 states have (on average 2.4365079365079363) internal successors, (3684), 1517 states have internal predecessors, (3684), 0 states have call successors, (0), 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 43 [2022-02-20 20:39:26,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:39:26,064 INFO L470 AbstractCegarLoop]: Abstraction has has 84 places, 80 transitions, 178 flow [2022-02-20 20:39:26,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 85.5) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 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:39:26,064 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:39:26,064 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] [2022-02-20 20:39:26,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:39:26,065 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:39:26,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:39:26,065 INFO L85 PathProgramCache]: Analyzing trace with hash 280868760, now seen corresponding path program 1 times [2022-02-20 20:39:26,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:39:26,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832835599] [2022-02-20 20:39:26,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:39:26,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:39:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:39:26,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {1617#true} [282] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1617#true} is VALID [2022-02-20 20:39:26,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {1617#true} [262] 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] {1617#true} is VALID [2022-02-20 20:39:26,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {1617#true} [291] 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[] {1617#true} is VALID [2022-02-20 20:39:26,149 INFO L290 TraceCheckUtils]: 3: Hoare triple {1617#true} [294] L-1-2-->L683: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {1617#true} is VALID [2022-02-20 20:39:26,149 INFO L290 TraceCheckUtils]: 4: Hoare triple {1617#true} [232] L683-->L683-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {1617#true} is VALID [2022-02-20 20:39:26,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {1617#true} [280] L683-1-->L683-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {1617#true} is VALID [2022-02-20 20:39:26,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {1617#true} [260] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {1617#true} is VALID [2022-02-20 20:39:26,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {1617#true} [290] L683-3-->L683-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {1617#true} is VALID [2022-02-20 20:39:26,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {1617#true} [222] L683-4-->L690: Formula: (and (= |v_~#a~0.offset_1| 0) (= |v_~#a~0.base_1| 3)) InVars {} OutVars{~#a~0.base=|v_~#a~0.base_1|, ~#a~0.offset=|v_~#a~0.offset_1|} AuxVars[] AssignedVars[~#a~0.base, ~#a~0.offset] {1617#true} is VALID [2022-02-20 20:39:26,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {1617#true} [288] L690-->L690-1: Formula: (and (= (select |v_#valid_4| 3) 1) (= 40 (select |v_#length_3| 3))) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {1617#true} is VALID [2022-02-20 20:39:26,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {1617#true} [226] L690-1-->L690-2: Formula: (= (store |v_#memory_int_4| |v_~#a~0.base_2| ((as const (Array Int Int)) 0)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ~#a~0.base=|v_~#a~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#a~0.base=|v_~#a~0.base_2|} AuxVars[] AssignedVars[#memory_int] {1617#true} is VALID [2022-02-20 20:39:26,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {1617#true} [244] L690-2-->L690-3: Formula: (= (store |v_#memory_int_6| |v_~#a~0.base_3| (store (select |v_#memory_int_6| |v_~#a~0.base_3|) |v_~#a~0.offset_2| 0)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ~#a~0.base=|v_~#a~0.base_3|, ~#a~0.offset=|v_~#a~0.offset_2|} OutVars{#memory_int=|v_#memory_int_5|, ~#a~0.base=|v_~#a~0.base_3|, ~#a~0.offset=|v_~#a~0.offset_2|} AuxVars[] AssignedVars[#memory_int] {1617#true} is VALID [2022-02-20 20:39:26,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {1617#true} [258] L690-3-->L-1-3: Formula: (= v_~x~0_1 0) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] {1617#true} is VALID [2022-02-20 20:39:26,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {1617#true} [296] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1617#true} is VALID [2022-02-20 20:39:26,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {1617#true} [268] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1617#true} is VALID [2022-02-20 20:39:26,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {1617#true} [237] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {1617#true} is VALID [2022-02-20 20:39:26,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {1617#true} [266] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {1617#true} is VALID [2022-02-20 20:39:26,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {1617#true} [233] L-1-7-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_1|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_1|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t~1#1.offset, ULTIMATE.start_main_~#t~1#1.base, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~sum~0#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_#t~post4#1] {1617#true} is VALID [2022-02-20 20:39:26,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {1617#true} [256] L697-->L697-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {1617#true} is VALID [2022-02-20 20:39:26,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {1617#true} [238] L697-1-->L698: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {1617#true} is VALID [2022-02-20 20:39:26,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {1617#true} [251] L698-->L698-1: Formula: (and (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#t~1#1.base_2| 40)) (not (= |v_ULTIMATE.start_main_~#t~1#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~1#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t~1#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t~1#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t~1#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_2|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~1#1.offset, ULTIMATE.start_main_~#t~1#1.base, #valid, #length] {1617#true} is VALID [2022-02-20 20:39:26,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {1617#true} [249] L698-1-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {1617#true} is VALID [2022-02-20 20:39:26,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {1617#true} [295] L700-->L700-1: Formula: (= |v_ULTIMATE.start_main_~n~0#1_2| (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~nondet3#1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_2|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0#1] {1617#true} is VALID [2022-02-20 20:39:26,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {1617#true} [298] L700-1-->L701: 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] {1617#true} is VALID [2022-02-20 20:39:26,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {1617#true} [289] L701-->L701-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1617#true} is VALID [2022-02-20 20:39:26,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {1617#true} [241] L701-1-->L701-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 5 |v_ULTIMATE.start_main_~n~0#1_3|) (<= |v_ULTIMATE.start_main_~n~0#1_3| 10)) 1 0)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_3|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_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] {1619#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:39:26,153 INFO L290 TraceCheckUtils]: 26: Hoare triple {1619#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [245] L701-2-->L686: 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] {1619#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:39:26,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {1619#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [305] L686-->L687: 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] {1620#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))} is VALID [2022-02-20 20:39:26,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {1620#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))} [285] L687-->L686-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[] {1621#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:26,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {1621#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [247] L686-1-->L702: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1621#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:26,155 INFO L290 TraceCheckUtils]: 30: Hoare triple {1621#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [243] L702-->L702-6: Formula: (= |v_ULTIMATE.start_main_~i~0#1_3| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {1622#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:26,155 INFO L290 TraceCheckUtils]: 31: Hoare triple {1622#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [303] L702-6-->L702-7: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_4| |v_ULTIMATE.start_main_~n~0#1_4|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|} AuxVars[] AssignedVars[] {1618#false} is VALID [2022-02-20 20:39:26,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {1618#false} [235] L702-7-->L705-5: Formula: (= |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {1618#false} is VALID [2022-02-20 20:39:26,156 INFO L290 TraceCheckUtils]: 33: Hoare triple {1618#false} [229] L705-5-->L705-6: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_10| |v_ULTIMATE.start_main_~n~0#1_6|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] {1618#false} is VALID [2022-02-20 20:39:26,156 INFO L290 TraceCheckUtils]: 34: Hoare triple {1618#false} [301] L705-6-->L709: Formula: (= |v_ULTIMATE.start_main_~sum~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~sum~0#1] {1618#false} is VALID [2022-02-20 20:39:26,156 INFO L290 TraceCheckUtils]: 35: Hoare triple {1618#false} [270] L709-->L709-6: Formula: (= |v_ULTIMATE.start_main_~i~0#1_15| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {1618#false} is VALID [2022-02-20 20:39:26,156 INFO L290 TraceCheckUtils]: 36: Hoare triple {1618#false} [272] L709-6-->L709-7: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_16| |v_ULTIMATE.start_main_~n~0#1_8|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} AuxVars[] AssignedVars[] {1618#false} is VALID [2022-02-20 20:39:26,156 INFO L290 TraceCheckUtils]: 37: Hoare triple {1618#false} [253] L709-7-->L712: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1618#false} is VALID [2022-02-20 20:39:26,157 INFO L290 TraceCheckUtils]: 38: Hoare triple {1618#false} [299] L712-->L712-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= |v_ULTIMATE.start_main_~sum~0#1_5| 9) 1 0)) InVars {ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_5|} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {1618#false} is VALID [2022-02-20 20:39:26,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {1618#false} [225] L712-1-->L689: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {1618#false} is VALID [2022-02-20 20:39:26,157 INFO L290 TraceCheckUtils]: 40: Hoare triple {1618#false} [234] L689-->L689-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {1618#false} is VALID [2022-02-20 20:39:26,157 INFO L290 TraceCheckUtils]: 41: Hoare triple {1618#false} [239] L689-1-->L689-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_3| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[] {1618#false} is VALID [2022-02-20 20:39:26,157 INFO L290 TraceCheckUtils]: 42: Hoare triple {1618#false} [292] L689-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1618#false} is VALID [2022-02-20 20:39:26,157 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:39:26,158 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:39:26,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832835599] [2022-02-20 20:39:26,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832835599] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:39:26,158 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:39:26,158 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:39:26,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015887917] [2022-02-20 20:39:26,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:39:26,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 20:39:26,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:39:26,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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:39:26,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:39:26,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:39:26,183 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:39:26,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:39:26,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:39:26,185 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 95 [2022-02-20 20:39:26,185 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 80 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 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:39:26,185 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:39:26,185 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 95 [2022-02-20 20:39:26,185 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:39:26,293 INFO L129 PetriNetUnfolder]: 5/169 cut-off events. [2022-02-20 20:39:26,294 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-02-20 20:39:26,294 INFO L84 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 169 events. 5/169 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 322 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 261. Up to 45 conditions per place. [2022-02-20 20:39:26,294 INFO L132 encePairwiseOnDemand]: 83/95 looper letters, 34 selfloop transitions, 9 changer transitions 0/94 dead transitions. [2022-02-20 20:39:26,294 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 94 transitions, 298 flow [2022-02-20 20:39:26,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 20:39:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-02-20 20:39:26,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 400 transitions. [2022-02-20 20:39:26,299 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7017543859649122 [2022-02-20 20:39:26,299 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 400 transitions. [2022-02-20 20:39:26,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 400 transitions. [2022-02-20 20:39:26,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:39:26,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 400 transitions. [2022-02-20 20:39:26,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 66.66666666666667) internal successors, (400), 6 states have internal predecessors, (400), 0 states have call successors, (0), 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:39:26,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 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:39:26,301 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 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:39:26,301 INFO L186 Difference]: Start difference. First operand has 84 places, 80 transitions, 178 flow. Second operand 6 states and 400 transitions. [2022-02-20 20:39:26,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 94 transitions, 298 flow [2022-02-20 20:39:26,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 94 transitions, 298 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-02-20 20:39:26,322 INFO L242 Difference]: Finished difference. Result has 89 places, 83 transitions, 220 flow [2022-02-20 20:39:26,323 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=89, PETRI_TRANSITIONS=83} [2022-02-20 20:39:26,323 INFO L334 CegarLoopForPetriNet]: 83 programPoint places, 6 predicate places. [2022-02-20 20:39:26,323 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 89 places, 83 transitions, 220 flow [2022-02-20 20:39:26,338 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1040 states, 1035 states have (on average 2.2019323671497584) internal successors, (2279), 1039 states have internal predecessors, (2279), 0 states have call successors, (0), 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:39:26,340 INFO L78 Accepts]: Start accepts. Automaton has has 1040 states, 1035 states have (on average 2.2019323671497584) internal successors, (2279), 1039 states have internal predecessors, (2279), 0 states have call successors, (0), 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 43 [2022-02-20 20:39:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:39:26,340 INFO L470 AbstractCegarLoop]: Abstraction has has 89 places, 83 transitions, 220 flow [2022-02-20 20:39:26,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 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:39:26,341 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:39:26,341 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:39:26,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:39:26,341 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:39:26,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:39:26,342 INFO L85 PathProgramCache]: Analyzing trace with hash 618023769, now seen corresponding path program 1 times [2022-02-20 20:39:26,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:39:26,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941421574] [2022-02-20 20:39:26,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:39:26,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:39:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:39:26,369 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:39:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:39:26,389 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 20:39:26,389 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:39:26,389 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 2 remaining) [2022-02-20 20:39:26,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 20:39:26,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:39:26,390 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 20:39:26,390 WARN L235 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-02-20 20:39:26,390 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-02-20 20:39:26,403 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,404 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,404 WARN L322 ript$VariableManager]: TermVariabe thrThread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,404 WARN L322 ript$VariableManager]: TermVariabe thrThread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,404 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,404 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,404 WARN L322 ript$VariableManager]: TermVariabe thrThread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,404 WARN L322 ript$VariableManager]: TermVariabe thrThread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,404 WARN L322 ript$VariableManager]: TermVariabe thrThread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,405 WARN L322 ript$VariableManager]: TermVariabe thrThread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,405 WARN L322 ript$VariableManager]: TermVariabe thrThread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,405 WARN L322 ript$VariableManager]: TermVariabe thrThread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,405 WARN L322 ript$VariableManager]: TermVariabe thrThread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,405 WARN L322 ript$VariableManager]: TermVariabe thrThread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,405 WARN L322 ript$VariableManager]: TermVariabe |thrThread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,405 WARN L322 ript$VariableManager]: TermVariabe |thrThread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,406 WARN L322 ript$VariableManager]: TermVariabe thrThread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,406 WARN L322 ript$VariableManager]: TermVariabe thrThread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,406 WARN L322 ript$VariableManager]: TermVariabe |thrThread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,406 WARN L322 ript$VariableManager]: TermVariabe |thrThread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,406 WARN L322 ript$VariableManager]: TermVariabe thrThread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,406 WARN L322 ript$VariableManager]: TermVariabe thrThread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,406 WARN L322 ript$VariableManager]: TermVariabe thrThread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,406 WARN L322 ript$VariableManager]: TermVariabe thrThread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,407 WARN L322 ript$VariableManager]: TermVariabe thrThread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,407 WARN L322 ript$VariableManager]: TermVariabe thrThread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,407 WARN L322 ript$VariableManager]: TermVariabe thrThread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,407 WARN L322 ript$VariableManager]: TermVariabe thrThread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,407 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,407 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,407 WARN L322 ript$VariableManager]: TermVariabe thrThread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,408 WARN L322 ript$VariableManager]: TermVariabe thrThread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,408 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,408 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,408 WARN L322 ript$VariableManager]: TermVariabe thrThread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,408 WARN L322 ript$VariableManager]: TermVariabe thrThread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,408 WARN L322 ript$VariableManager]: TermVariabe thrThread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,408 WARN L322 ript$VariableManager]: TermVariabe thrThread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,408 WARN L322 ript$VariableManager]: TermVariabe thrThread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,409 WARN L322 ript$VariableManager]: TermVariabe thrThread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,409 WARN L322 ript$VariableManager]: TermVariabe thrThread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,409 WARN L322 ript$VariableManager]: TermVariabe thrThread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,409 WARN L322 ript$VariableManager]: TermVariabe thrThread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,409 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,410 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,410 WARN L322 ript$VariableManager]: TermVariabe thrThread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,410 WARN L322 ript$VariableManager]: TermVariabe thrThread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,410 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,410 WARN L322 ript$VariableManager]: TermVariabe thrThread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,410 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,410 WARN L322 ript$VariableManager]: TermVariabe thrThread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,411 WARN L322 ript$VariableManager]: TermVariabe thrThread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,411 WARN L322 ript$VariableManager]: TermVariabe |thrThread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,411 WARN L322 ript$VariableManager]: TermVariabe |thrThread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,411 WARN L322 ript$VariableManager]: TermVariabe thrThread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,411 WARN L322 ript$VariableManager]: TermVariabe thrThread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,411 WARN L322 ript$VariableManager]: TermVariabe thrThread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:26,416 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-02-20 20:39:26,417 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:39:26,418 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:39:26,418 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:39:26,419 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 100 places, 102 transitions, 234 flow [2022-02-20 20:39:26,446 INFO L129 PetriNetUnfolder]: 45/383 cut-off events. [2022-02-20 20:39:26,446 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-02-20 20:39:26,446 INFO L84 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 383 events. 45/383 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1193 event pairs, 1 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 225. Up to 16 conditions per place. [2022-02-20 20:39:26,446 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 102 transitions, 234 flow [2022-02-20 20:39:26,447 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 92 transitions, 214 flow [2022-02-20 20:39:26,451 INFO L129 PetriNetUnfolder]: 6/74 cut-off events. [2022-02-20 20:39:26,451 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:39:26,451 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:39:26,451 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] [2022-02-20 20:39:26,451 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:39:26,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:39:26,452 INFO L85 PathProgramCache]: Analyzing trace with hash -783703138, now seen corresponding path program 1 times [2022-02-20 20:39:26,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:39:26,452 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097827434] [2022-02-20 20:39:26,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:39:26,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:39:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:39:26,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {103#true} [384] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {103#true} is VALID [2022-02-20 20:39:26,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {103#true} [364] 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] {103#true} is VALID [2022-02-20 20:39:26,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {103#true} [393] 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[] {103#true} is VALID [2022-02-20 20:39:26,470 INFO L290 TraceCheckUtils]: 3: Hoare triple {103#true} [396] L-1-2-->L683: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {103#true} is VALID [2022-02-20 20:39:26,471 INFO L290 TraceCheckUtils]: 4: Hoare triple {103#true} [334] L683-->L683-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {103#true} is VALID [2022-02-20 20:39:26,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {103#true} [382] L683-1-->L683-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {103#true} is VALID [2022-02-20 20:39:26,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {103#true} [362] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {103#true} is VALID [2022-02-20 20:39:26,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {103#true} [392] L683-3-->L683-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {103#true} is VALID [2022-02-20 20:39:26,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {103#true} [324] L683-4-->L690: Formula: (and (= |v_~#a~0.offset_1| 0) (= |v_~#a~0.base_1| 3)) InVars {} OutVars{~#a~0.base=|v_~#a~0.base_1|, ~#a~0.offset=|v_~#a~0.offset_1|} AuxVars[] AssignedVars[~#a~0.base, ~#a~0.offset] {103#true} is VALID [2022-02-20 20:39:26,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {103#true} [390] L690-->L690-1: Formula: (and (= (select |v_#valid_4| 3) 1) (= 40 (select |v_#length_3| 3))) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {103#true} is VALID [2022-02-20 20:39:26,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {103#true} [328] L690-1-->L690-2: Formula: (= (store |v_#memory_int_4| |v_~#a~0.base_2| ((as const (Array Int Int)) 0)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ~#a~0.base=|v_~#a~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#a~0.base=|v_~#a~0.base_2|} AuxVars[] AssignedVars[#memory_int] {103#true} is VALID [2022-02-20 20:39:26,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {103#true} [346] L690-2-->L690-3: Formula: (= (store |v_#memory_int_6| |v_~#a~0.base_3| (store (select |v_#memory_int_6| |v_~#a~0.base_3|) |v_~#a~0.offset_2| 0)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ~#a~0.base=|v_~#a~0.base_3|, ~#a~0.offset=|v_~#a~0.offset_2|} OutVars{#memory_int=|v_#memory_int_5|, ~#a~0.base=|v_~#a~0.base_3|, ~#a~0.offset=|v_~#a~0.offset_2|} AuxVars[] AssignedVars[#memory_int] {103#true} is VALID [2022-02-20 20:39:26,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {103#true} [360] L690-3-->L-1-3: Formula: (= v_~x~0_1 0) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] {103#true} is VALID [2022-02-20 20:39:26,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {103#true} [398] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {103#true} is VALID [2022-02-20 20:39:26,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {103#true} [370] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {103#true} is VALID [2022-02-20 20:39:26,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {103#true} [339] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {103#true} is VALID [2022-02-20 20:39:26,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {103#true} [368] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {103#true} is VALID [2022-02-20 20:39:26,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {103#true} [335] L-1-7-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_1|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_1|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t~1#1.offset, ULTIMATE.start_main_~#t~1#1.base, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~sum~0#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_#t~post4#1] {103#true} is VALID [2022-02-20 20:39:26,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {103#true} [358] L697-->L697-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {103#true} is VALID [2022-02-20 20:39:26,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {103#true} [340] L697-1-->L698: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {103#true} is VALID [2022-02-20 20:39:26,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {103#true} [353] L698-->L698-1: Formula: (and (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#t~1#1.base_2| 40)) (not (= |v_ULTIMATE.start_main_~#t~1#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~1#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t~1#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t~1#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t~1#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_2|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~1#1.offset, ULTIMATE.start_main_~#t~1#1.base, #valid, #length] {103#true} is VALID [2022-02-20 20:39:26,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {103#true} [351] L698-1-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {103#true} is VALID [2022-02-20 20:39:26,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {103#true} [397] L700-->L700-1: Formula: (= |v_ULTIMATE.start_main_~n~0#1_2| (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~nondet3#1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_2|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0#1] {103#true} is VALID [2022-02-20 20:39:26,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {103#true} [400] L700-1-->L701: 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] {103#true} is VALID [2022-02-20 20:39:26,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {103#true} [391] L701-->L701-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {103#true} is VALID [2022-02-20 20:39:26,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {103#true} [343] L701-1-->L701-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 5 |v_ULTIMATE.start_main_~n~0#1_3|) (<= |v_ULTIMATE.start_main_~n~0#1_3| 10)) 1 0)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_3|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_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] {103#true} is VALID [2022-02-20 20:39:26,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {103#true} [347] L701-2-->L686: 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] {103#true} is VALID [2022-02-20 20:39:26,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {103#true} [407] L686-->L687: 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] {103#true} is VALID [2022-02-20 20:39:26,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {103#true} [387] L687-->L686-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[] {103#true} is VALID [2022-02-20 20:39:26,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {103#true} [349] L686-1-->L702: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {103#true} is VALID [2022-02-20 20:39:26,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {103#true} [345] L702-->L702-6: Formula: (= |v_ULTIMATE.start_main_~i~0#1_3| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {103#true} is VALID [2022-02-20 20:39:26,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {103#true} [404] L702-6-->L702-7: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {104#false} is VALID [2022-02-20 20:39:26,475 INFO L290 TraceCheckUtils]: 32: Hoare triple {104#false} [337] L702-7-->L705-5: Formula: (= |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {104#false} is VALID [2022-02-20 20:39:26,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {104#false} [331] L705-5-->L705-6: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_10| |v_ULTIMATE.start_main_~n~0#1_6|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] {104#false} is VALID [2022-02-20 20:39:26,475 INFO L290 TraceCheckUtils]: 34: Hoare triple {104#false} [403] L705-6-->L709: Formula: (= |v_ULTIMATE.start_main_~sum~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~sum~0#1] {104#false} is VALID [2022-02-20 20:39:26,476 INFO L290 TraceCheckUtils]: 35: Hoare triple {104#false} [372] L709-->L709-6: Formula: (= |v_ULTIMATE.start_main_~i~0#1_15| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {104#false} is VALID [2022-02-20 20:39:26,476 INFO L290 TraceCheckUtils]: 36: Hoare triple {104#false} [373] L709-6-->L709-7: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {104#false} is VALID [2022-02-20 20:39:26,476 INFO L290 TraceCheckUtils]: 37: Hoare triple {104#false} [355] L709-7-->L712: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {104#false} is VALID [2022-02-20 20:39:26,476 INFO L290 TraceCheckUtils]: 38: Hoare triple {104#false} [401] L712-->L712-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= |v_ULTIMATE.start_main_~sum~0#1_5| 9) 1 0)) InVars {ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_5|} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {104#false} is VALID [2022-02-20 20:39:26,476 INFO L290 TraceCheckUtils]: 39: Hoare triple {104#false} [327] L712-1-->L689: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {104#false} is VALID [2022-02-20 20:39:26,476 INFO L290 TraceCheckUtils]: 40: Hoare triple {104#false} [336] L689-->L689-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {104#false} is VALID [2022-02-20 20:39:26,476 INFO L290 TraceCheckUtils]: 41: Hoare triple {104#false} [341] L689-1-->L689-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_3| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[] {104#false} is VALID [2022-02-20 20:39:26,477 INFO L290 TraceCheckUtils]: 42: Hoare triple {104#false} [394] L689-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {104#false} is VALID [2022-02-20 20:39:26,477 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:39:26,477 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:39:26,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097827434] [2022-02-20 20:39:26,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097827434] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:39:26,477 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:39:26,477 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:39:26,478 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885418117] [2022-02-20 20:39:26,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:39:26,478 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 20:39:26,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:39:26,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 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:39:26,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:39:26,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 20:39:26,501 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:39:26,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 20:39:26,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 20:39:26,502 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 102 [2022-02-20 20:39:26,503 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 92 transitions, 214 flow. Second operand has 2 states, 2 states have (on average 91.0) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 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:39:26,503 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:39:26,503 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 102 [2022-02-20 20:39:26,503 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:39:26,527 INFO L129 PetriNetUnfolder]: 16/282 cut-off events. [2022-02-20 20:39:26,527 INFO L130 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-02-20 20:39:26,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 282 events. 16/282 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 769 event pairs, 1 based on Foata normal form. 21/282 useless extension candidates. Maximal degree in co-relation 179. Up to 16 conditions per place. [2022-02-20 20:39:26,528 INFO L132 encePairwiseOnDemand]: 98/102 looper letters, 6 selfloop transitions, 0 changer transitions 1/88 dead transitions. [2022-02-20 20:39:26,528 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 88 transitions, 218 flow [2022-02-20 20:39:26,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 20:39:26,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-02-20 20:39:26,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 190 transitions. [2022-02-20 20:39:26,531 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9313725490196079 [2022-02-20 20:39:26,531 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 190 transitions. [2022-02-20 20:39:26,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 190 transitions. [2022-02-20 20:39:26,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:39:26,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 190 transitions. [2022-02-20 20:39:26,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 95.0) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 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:39:26,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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:39:26,532 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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:39:26,532 INFO L186 Difference]: Start difference. First operand has 91 places, 92 transitions, 214 flow. Second operand 2 states and 190 transitions. [2022-02-20 20:39:26,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 88 transitions, 218 flow [2022-02-20 20:39:26,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 88 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-02-20 20:39:26,536 INFO L242 Difference]: Finished difference. Result has 92 places, 87 transitions, 204 flow [2022-02-20 20:39:26,536 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=204, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2022-02-20 20:39:26,536 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 1 predicate places. [2022-02-20 20:39:26,536 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 87 transitions, 204 flow [2022-02-20 20:39:26,732 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 10116 states, 10106 states have (on average 3.1907777557886403) internal successors, (32246), 10115 states have internal predecessors, (32246), 0 states have call successors, (0), 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:39:26,756 INFO L78 Accepts]: Start accepts. Automaton has has 10116 states, 10106 states have (on average 3.1907777557886403) internal successors, (32246), 10115 states have internal predecessors, (32246), 0 states have call successors, (0), 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 43 [2022-02-20 20:39:26,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:39:26,757 INFO L470 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 204 flow [2022-02-20 20:39:26,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 91.0) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 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:39:26,758 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:39:26,758 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] [2022-02-20 20:39:26,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:39:26,758 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:39:26,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:39:26,759 INFO L85 PathProgramCache]: Analyzing trace with hash 232883262, now seen corresponding path program 1 times [2022-02-20 20:39:26,759 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:39:26,759 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474981166] [2022-02-20 20:39:26,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:39:26,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:39:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:39:26,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {10223#true} [384] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10223#true} is VALID [2022-02-20 20:39:26,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {10223#true} [364] 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] {10223#true} is VALID [2022-02-20 20:39:26,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {10223#true} [393] 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[] {10223#true} is VALID [2022-02-20 20:39:26,840 INFO L290 TraceCheckUtils]: 3: Hoare triple {10223#true} [396] L-1-2-->L683: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {10223#true} is VALID [2022-02-20 20:39:26,840 INFO L290 TraceCheckUtils]: 4: Hoare triple {10223#true} [334] L683-->L683-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {10223#true} is VALID [2022-02-20 20:39:26,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {10223#true} [382] L683-1-->L683-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {10223#true} is VALID [2022-02-20 20:39:26,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {10223#true} [362] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {10223#true} is VALID [2022-02-20 20:39:26,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {10223#true} [392] L683-3-->L683-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {10223#true} is VALID [2022-02-20 20:39:26,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {10223#true} [324] L683-4-->L690: Formula: (and (= |v_~#a~0.offset_1| 0) (= |v_~#a~0.base_1| 3)) InVars {} OutVars{~#a~0.base=|v_~#a~0.base_1|, ~#a~0.offset=|v_~#a~0.offset_1|} AuxVars[] AssignedVars[~#a~0.base, ~#a~0.offset] {10223#true} is VALID [2022-02-20 20:39:26,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {10223#true} [390] L690-->L690-1: Formula: (and (= (select |v_#valid_4| 3) 1) (= 40 (select |v_#length_3| 3))) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {10223#true} is VALID [2022-02-20 20:39:26,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {10223#true} [328] L690-1-->L690-2: Formula: (= (store |v_#memory_int_4| |v_~#a~0.base_2| ((as const (Array Int Int)) 0)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ~#a~0.base=|v_~#a~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#a~0.base=|v_~#a~0.base_2|} AuxVars[] AssignedVars[#memory_int] {10223#true} is VALID [2022-02-20 20:39:26,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {10223#true} [346] L690-2-->L690-3: Formula: (= (store |v_#memory_int_6| |v_~#a~0.base_3| (store (select |v_#memory_int_6| |v_~#a~0.base_3|) |v_~#a~0.offset_2| 0)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ~#a~0.base=|v_~#a~0.base_3|, ~#a~0.offset=|v_~#a~0.offset_2|} OutVars{#memory_int=|v_#memory_int_5|, ~#a~0.base=|v_~#a~0.base_3|, ~#a~0.offset=|v_~#a~0.offset_2|} AuxVars[] AssignedVars[#memory_int] {10223#true} is VALID [2022-02-20 20:39:26,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {10223#true} [360] L690-3-->L-1-3: Formula: (= v_~x~0_1 0) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] {10223#true} is VALID [2022-02-20 20:39:26,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {10223#true} [398] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10223#true} is VALID [2022-02-20 20:39:26,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {10223#true} [370] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10223#true} is VALID [2022-02-20 20:39:26,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {10223#true} [339] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {10223#true} is VALID [2022-02-20 20:39:26,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {10223#true} [368] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {10223#true} is VALID [2022-02-20 20:39:26,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {10223#true} [335] L-1-7-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_1|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_1|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t~1#1.offset, ULTIMATE.start_main_~#t~1#1.base, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~sum~0#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_#t~post4#1] {10223#true} is VALID [2022-02-20 20:39:26,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {10223#true} [358] L697-->L697-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {10223#true} is VALID [2022-02-20 20:39:26,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {10223#true} [340] L697-1-->L698: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {10223#true} is VALID [2022-02-20 20:39:26,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {10223#true} [353] L698-->L698-1: Formula: (and (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#t~1#1.base_2| 40)) (not (= |v_ULTIMATE.start_main_~#t~1#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~1#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t~1#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t~1#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t~1#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_2|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~1#1.offset, ULTIMATE.start_main_~#t~1#1.base, #valid, #length] {10223#true} is VALID [2022-02-20 20:39:26,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {10223#true} [351] L698-1-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {10223#true} is VALID [2022-02-20 20:39:26,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {10223#true} [397] L700-->L700-1: Formula: (= |v_ULTIMATE.start_main_~n~0#1_2| (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~nondet3#1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_2|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0#1] {10223#true} is VALID [2022-02-20 20:39:26,844 INFO L290 TraceCheckUtils]: 23: Hoare triple {10223#true} [400] L700-1-->L701: 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] {10223#true} is VALID [2022-02-20 20:39:26,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {10223#true} [391] L701-->L701-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10223#true} is VALID [2022-02-20 20:39:26,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {10223#true} [343] L701-1-->L701-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 5 |v_ULTIMATE.start_main_~n~0#1_3|) (<= |v_ULTIMATE.start_main_~n~0#1_3| 10)) 1 0)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_3|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_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] {10225#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:39:26,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {10225#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [347] L701-2-->L686: 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] {10225#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:39:26,845 INFO L290 TraceCheckUtils]: 27: Hoare triple {10225#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [407] L686-->L687: 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] {10226#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))} is VALID [2022-02-20 20:39:26,845 INFO L290 TraceCheckUtils]: 28: Hoare triple {10226#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))} [387] L687-->L686-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[] {10227#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:26,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {10227#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [349] L686-1-->L702: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10227#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:26,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {10227#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [345] L702-->L702-6: Formula: (= |v_ULTIMATE.start_main_~i~0#1_3| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {10228#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:26,847 INFO L290 TraceCheckUtils]: 31: Hoare triple {10228#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [405] L702-6-->L702-7: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_4| |v_ULTIMATE.start_main_~n~0#1_4|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|} AuxVars[] AssignedVars[] {10224#false} is VALID [2022-02-20 20:39:26,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {10224#false} [337] L702-7-->L705-5: Formula: (= |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {10224#false} is VALID [2022-02-20 20:39:26,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {10224#false} [331] L705-5-->L705-6: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_10| |v_ULTIMATE.start_main_~n~0#1_6|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] {10224#false} is VALID [2022-02-20 20:39:26,847 INFO L290 TraceCheckUtils]: 34: Hoare triple {10224#false} [403] L705-6-->L709: Formula: (= |v_ULTIMATE.start_main_~sum~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~sum~0#1] {10224#false} is VALID [2022-02-20 20:39:26,847 INFO L290 TraceCheckUtils]: 35: Hoare triple {10224#false} [372] L709-->L709-6: Formula: (= |v_ULTIMATE.start_main_~i~0#1_15| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {10224#false} is VALID [2022-02-20 20:39:26,847 INFO L290 TraceCheckUtils]: 36: Hoare triple {10224#false} [374] L709-6-->L709-7: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_16| |v_ULTIMATE.start_main_~n~0#1_8|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} AuxVars[] AssignedVars[] {10224#false} is VALID [2022-02-20 20:39:26,847 INFO L290 TraceCheckUtils]: 37: Hoare triple {10224#false} [355] L709-7-->L712: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10224#false} is VALID [2022-02-20 20:39:26,848 INFO L290 TraceCheckUtils]: 38: Hoare triple {10224#false} [401] L712-->L712-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= |v_ULTIMATE.start_main_~sum~0#1_5| 9) 1 0)) InVars {ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_5|} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {10224#false} is VALID [2022-02-20 20:39:26,848 INFO L290 TraceCheckUtils]: 39: Hoare triple {10224#false} [327] L712-1-->L689: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {10224#false} is VALID [2022-02-20 20:39:26,848 INFO L290 TraceCheckUtils]: 40: Hoare triple {10224#false} [336] L689-->L689-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {10224#false} is VALID [2022-02-20 20:39:26,848 INFO L290 TraceCheckUtils]: 41: Hoare triple {10224#false} [341] L689-1-->L689-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_3| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[] {10224#false} is VALID [2022-02-20 20:39:26,848 INFO L290 TraceCheckUtils]: 42: Hoare triple {10224#false} [394] L689-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10224#false} is VALID [2022-02-20 20:39:26,849 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:39:26,849 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:39:26,849 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474981166] [2022-02-20 20:39:26,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474981166] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:39:26,849 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:39:26,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:39:26,849 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234733246] [2022-02-20 20:39:26,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:39:26,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 20:39:26,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:39:26,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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:39:26,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:39:26,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:39:26,873 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:39:26,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:39:26,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:39:26,874 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 102 [2022-02-20 20:39:26,874 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 66.16666666666667) internal successors, (397), 6 states have internal predecessors, (397), 0 states have call successors, (0), 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:39:26,875 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:39:26,875 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 102 [2022-02-20 20:39:26,875 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:39:27,068 INFO L129 PetriNetUnfolder]: 15/320 cut-off events. [2022-02-20 20:39:27,068 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-02-20 20:39:27,069 INFO L84 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 320 events. 15/320 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1092 event pairs, 0 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 510. Up to 103 conditions per place. [2022-02-20 20:39:27,069 INFO L132 encePairwiseOnDemand]: 90/102 looper letters, 37 selfloop transitions, 9 changer transitions 0/102 dead transitions. [2022-02-20 20:39:27,069 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 102 transitions, 335 flow [2022-02-20 20:39:27,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 20:39:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-02-20 20:39:27,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 433 transitions. [2022-02-20 20:39:27,073 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7075163398692811 [2022-02-20 20:39:27,073 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 433 transitions. [2022-02-20 20:39:27,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 433 transitions. [2022-02-20 20:39:27,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:39:27,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 433 transitions. [2022-02-20 20:39:27,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 72.16666666666667) internal successors, (433), 6 states have internal predecessors, (433), 0 states have call successors, (0), 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:39:27,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 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:39:27,076 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 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:39:27,076 INFO L186 Difference]: Start difference. First operand has 92 places, 87 transitions, 204 flow. Second operand 6 states and 433 transitions. [2022-02-20 20:39:27,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 102 transitions, 335 flow [2022-02-20 20:39:27,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 102 transitions, 335 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-02-20 20:39:27,115 INFO L242 Difference]: Finished difference. Result has 97 places, 90 transitions, 246 flow [2022-02-20 20:39:27,115 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=97, PETRI_TRANSITIONS=90} [2022-02-20 20:39:27,116 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 6 predicate places. [2022-02-20 20:39:27,116 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 97 places, 90 transitions, 246 flow [2022-02-20 20:39:27,249 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 7586 states, 7577 states have (on average 2.933218952091857) internal successors, (22225), 7585 states have internal predecessors, (22225), 0 states have call successors, (0), 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:39:27,259 INFO L78 Accepts]: Start accepts. Automaton has has 7586 states, 7577 states have (on average 2.933218952091857) internal successors, (22225), 7585 states have internal predecessors, (22225), 0 states have call successors, (0), 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 43 [2022-02-20 20:39:27,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:39:27,260 INFO L470 AbstractCegarLoop]: Abstraction has has 97 places, 90 transitions, 246 flow [2022-02-20 20:39:27,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.16666666666667) internal successors, (397), 6 states have internal predecessors, (397), 0 states have call successors, (0), 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:39:27,260 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:39:27,260 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:27,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 20:39:27,261 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:39:27,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:39:27,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1470109151, now seen corresponding path program 1 times [2022-02-20 20:39:27,261 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:39:27,261 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464402071] [2022-02-20 20:39:27,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:39:27,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:39:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:39:27,279 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:39:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:39:27,298 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 20:39:27,298 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:39:27,298 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 2 remaining) [2022-02-20 20:39:27,298 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 20:39:27,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 20:39:27,299 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 20:39:27,299 WARN L235 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-02-20 20:39:27,299 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-02-20 20:39:27,311 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,311 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,311 WARN L322 ript$VariableManager]: TermVariabe thrThread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,311 WARN L322 ript$VariableManager]: TermVariabe thrThread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,311 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,311 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,312 WARN L322 ript$VariableManager]: TermVariabe thrThread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,312 WARN L322 ript$VariableManager]: TermVariabe thrThread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,312 WARN L322 ript$VariableManager]: TermVariabe thrThread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,312 WARN L322 ript$VariableManager]: TermVariabe thrThread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,312 WARN L322 ript$VariableManager]: TermVariabe thrThread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,312 WARN L322 ript$VariableManager]: TermVariabe thrThread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,313 WARN L322 ript$VariableManager]: TermVariabe thrThread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,313 WARN L322 ript$VariableManager]: TermVariabe thrThread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,313 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,313 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,313 WARN L322 ript$VariableManager]: TermVariabe thrThread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,313 WARN L322 ript$VariableManager]: TermVariabe thrThread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,313 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,313 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,313 WARN L322 ript$VariableManager]: TermVariabe thrThread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,314 WARN L322 ript$VariableManager]: TermVariabe thrThread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,314 WARN L322 ript$VariableManager]: TermVariabe thrThread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,314 WARN L322 ript$VariableManager]: TermVariabe thrThread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,314 WARN L322 ript$VariableManager]: TermVariabe thrThread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,314 WARN L322 ript$VariableManager]: TermVariabe thrThread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,314 WARN L322 ript$VariableManager]: TermVariabe thrThread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,314 WARN L322 ript$VariableManager]: TermVariabe thrThread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,315 WARN L322 ript$VariableManager]: TermVariabe |thrThread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,315 WARN L322 ript$VariableManager]: TermVariabe |thrThread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,315 WARN L322 ript$VariableManager]: TermVariabe thrThread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,315 WARN L322 ript$VariableManager]: TermVariabe thrThread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,315 WARN L322 ript$VariableManager]: TermVariabe |thrThread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,315 WARN L322 ript$VariableManager]: TermVariabe |thrThread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,315 WARN L322 ript$VariableManager]: TermVariabe thrThread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,315 WARN L322 ript$VariableManager]: TermVariabe thrThread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,316 WARN L322 ript$VariableManager]: TermVariabe thrThread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,316 WARN L322 ript$VariableManager]: TermVariabe thrThread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,316 WARN L322 ript$VariableManager]: TermVariabe thrThread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,316 WARN L322 ript$VariableManager]: TermVariabe thrThread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,316 WARN L322 ript$VariableManager]: TermVariabe thrThread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,316 WARN L322 ript$VariableManager]: TermVariabe thrThread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,317 WARN L322 ript$VariableManager]: TermVariabe |thrThread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,317 WARN L322 ript$VariableManager]: TermVariabe |thrThread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,317 WARN L322 ript$VariableManager]: TermVariabe thrThread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,317 WARN L322 ript$VariableManager]: TermVariabe thrThread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,317 WARN L322 ript$VariableManager]: TermVariabe |thrThread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,317 WARN L322 ript$VariableManager]: TermVariabe |thrThread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,317 WARN L322 ript$VariableManager]: TermVariabe thrThread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,317 WARN L322 ript$VariableManager]: TermVariabe thrThread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,317 WARN L322 ript$VariableManager]: TermVariabe thrThread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,318 WARN L322 ript$VariableManager]: TermVariabe thrThread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,318 WARN L322 ript$VariableManager]: TermVariabe thrThread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,318 WARN L322 ript$VariableManager]: TermVariabe thrThread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,318 WARN L322 ript$VariableManager]: TermVariabe thrThread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,318 WARN L322 ript$VariableManager]: TermVariabe thrThread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,318 WARN L322 ript$VariableManager]: TermVariabe thrThread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,319 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,319 WARN L322 ript$VariableManager]: TermVariabe thrThread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,319 WARN L322 ript$VariableManager]: TermVariabe thrThread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,319 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,319 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,319 WARN L322 ript$VariableManager]: TermVariabe thrThread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,320 WARN L322 ript$VariableManager]: TermVariabe thrThread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,320 WARN L322 ript$VariableManager]: TermVariabe thrThread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,320 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,320 WARN L322 ript$VariableManager]: TermVariabe |thrThread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,320 WARN L322 ript$VariableManager]: TermVariabe thrThread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,320 WARN L322 ript$VariableManager]: TermVariabe thrThread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,320 WARN L322 ript$VariableManager]: TermVariabe thrThread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,320 WARN L322 ript$VariableManager]: TermVariabe |thrThread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,321 WARN L322 ript$VariableManager]: TermVariabe thrThread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,321 WARN L322 ript$VariableManager]: TermVariabe |thrThread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,321 WARN L322 ript$VariableManager]: TermVariabe thrThread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,321 WARN L322 ript$VariableManager]: TermVariabe thrThread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,321 WARN L322 ript$VariableManager]: TermVariabe |thrThread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:27,327 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-02-20 20:39:27,328 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:39:27,328 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:39:27,328 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:39:27,329 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 109 transitions, 262 flow [2022-02-20 20:39:27,372 INFO L129 PetriNetUnfolder]: 91/701 cut-off events. [2022-02-20 20:39:27,373 INFO L130 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-02-20 20:39:27,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 701 events. 91/701 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3012 event pairs, 6 based on Foata normal form. 0/594 useless extension candidates. Maximal degree in co-relation 403. Up to 32 conditions per place. [2022-02-20 20:39:27,374 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 109 transitions, 262 flow [2022-02-20 20:39:27,375 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 99 transitions, 242 flow [2022-02-20 20:39:27,378 INFO L129 PetriNetUnfolder]: 6/74 cut-off events. [2022-02-20 20:39:27,378 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:39:27,378 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:39:27,378 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:39:27,379 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:39:27,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:39:27,379 INFO L85 PathProgramCache]: Analyzing trace with hash -888353237, now seen corresponding path program 1 times [2022-02-20 20:39:27,379 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:39:27,379 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448539031] [2022-02-20 20:39:27,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:39:27,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:39:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:39:27,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {111#true} [493] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#true} is VALID [2022-02-20 20:39:27,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {111#true} [473] 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] {111#true} is VALID [2022-02-20 20:39:27,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {111#true} [502] 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[] {111#true} is VALID [2022-02-20 20:39:27,403 INFO L290 TraceCheckUtils]: 3: Hoare triple {111#true} [505] L-1-2-->L683: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {111#true} is VALID [2022-02-20 20:39:27,404 INFO L290 TraceCheckUtils]: 4: Hoare triple {111#true} [443] L683-->L683-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {111#true} is VALID [2022-02-20 20:39:27,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {111#true} [491] L683-1-->L683-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {111#true} is VALID [2022-02-20 20:39:27,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {111#true} [471] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {111#true} is VALID [2022-02-20 20:39:27,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {111#true} [501] L683-3-->L683-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {111#true} is VALID [2022-02-20 20:39:27,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {111#true} [433] L683-4-->L690: Formula: (and (= |v_~#a~0.offset_1| 0) (= |v_~#a~0.base_1| 3)) InVars {} OutVars{~#a~0.base=|v_~#a~0.base_1|, ~#a~0.offset=|v_~#a~0.offset_1|} AuxVars[] AssignedVars[~#a~0.base, ~#a~0.offset] {111#true} is VALID [2022-02-20 20:39:27,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {111#true} [499] L690-->L690-1: Formula: (and (= (select |v_#valid_4| 3) 1) (= 40 (select |v_#length_3| 3))) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {111#true} is VALID [2022-02-20 20:39:27,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {111#true} [437] L690-1-->L690-2: Formula: (= (store |v_#memory_int_4| |v_~#a~0.base_2| ((as const (Array Int Int)) 0)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ~#a~0.base=|v_~#a~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#a~0.base=|v_~#a~0.base_2|} AuxVars[] AssignedVars[#memory_int] {111#true} is VALID [2022-02-20 20:39:27,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {111#true} [455] L690-2-->L690-3: Formula: (= (store |v_#memory_int_6| |v_~#a~0.base_3| (store (select |v_#memory_int_6| |v_~#a~0.base_3|) |v_~#a~0.offset_2| 0)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ~#a~0.base=|v_~#a~0.base_3|, ~#a~0.offset=|v_~#a~0.offset_2|} OutVars{#memory_int=|v_#memory_int_5|, ~#a~0.base=|v_~#a~0.base_3|, ~#a~0.offset=|v_~#a~0.offset_2|} AuxVars[] AssignedVars[#memory_int] {111#true} is VALID [2022-02-20 20:39:27,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {111#true} [469] L690-3-->L-1-3: Formula: (= v_~x~0_1 0) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] {111#true} is VALID [2022-02-20 20:39:27,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {111#true} [507] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#true} is VALID [2022-02-20 20:39:27,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {111#true} [479] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#true} is VALID [2022-02-20 20:39:27,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {111#true} [448] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {111#true} is VALID [2022-02-20 20:39:27,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {111#true} [477] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {111#true} is VALID [2022-02-20 20:39:27,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {111#true} [444] L-1-7-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_1|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_1|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t~1#1.offset, ULTIMATE.start_main_~#t~1#1.base, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~sum~0#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_#t~post4#1] {111#true} is VALID [2022-02-20 20:39:27,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {111#true} [467] L697-->L697-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {111#true} is VALID [2022-02-20 20:39:27,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {111#true} [449] L697-1-->L698: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {111#true} is VALID [2022-02-20 20:39:27,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {111#true} [462] L698-->L698-1: Formula: (and (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#t~1#1.base_2| 40)) (not (= |v_ULTIMATE.start_main_~#t~1#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~1#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t~1#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t~1#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t~1#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_2|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~1#1.offset, ULTIMATE.start_main_~#t~1#1.base, #valid, #length] {111#true} is VALID [2022-02-20 20:39:27,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {111#true} [460] L698-1-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {111#true} is VALID [2022-02-20 20:39:27,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {111#true} [506] L700-->L700-1: Formula: (= |v_ULTIMATE.start_main_~n~0#1_2| (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~nondet3#1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_2|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0#1] {111#true} is VALID [2022-02-20 20:39:27,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {111#true} [509] L700-1-->L701: 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] {111#true} is VALID [2022-02-20 20:39:27,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {111#true} [500] L701-->L701-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#true} is VALID [2022-02-20 20:39:27,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {111#true} [452] L701-1-->L701-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 5 |v_ULTIMATE.start_main_~n~0#1_3|) (<= |v_ULTIMATE.start_main_~n~0#1_3| 10)) 1 0)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_3|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_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] {111#true} is VALID [2022-02-20 20:39:27,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {111#true} [456] L701-2-->L686: 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] {111#true} is VALID [2022-02-20 20:39:27,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {111#true} [516] L686-->L687: 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] {111#true} is VALID [2022-02-20 20:39:27,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {111#true} [496] L687-->L686-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[] {111#true} is VALID [2022-02-20 20:39:27,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {111#true} [458] L686-1-->L702: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#true} is VALID [2022-02-20 20:39:27,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {111#true} [454] L702-->L702-6: Formula: (= |v_ULTIMATE.start_main_~i~0#1_3| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {111#true} is VALID [2022-02-20 20:39:27,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {111#true} [514] L702-6-->L702-7: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_4| |v_ULTIMATE.start_main_~n~0#1_4|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|} AuxVars[] AssignedVars[] {111#true} is VALID [2022-02-20 20:39:27,409 INFO L290 TraceCheckUtils]: 32: Hoare triple {111#true} [446] L702-7-->L705-5: Formula: (= |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {111#true} is VALID [2022-02-20 20:39:27,409 INFO L290 TraceCheckUtils]: 33: Hoare triple {111#true} [439] L705-5-->L705-6: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {112#false} is VALID [2022-02-20 20:39:27,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {112#false} [512] L705-6-->L709: Formula: (= |v_ULTIMATE.start_main_~sum~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~sum~0#1] {112#false} is VALID [2022-02-20 20:39:27,409 INFO L290 TraceCheckUtils]: 35: Hoare triple {112#false} [481] L709-->L709-6: Formula: (= |v_ULTIMATE.start_main_~i~0#1_15| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {112#false} is VALID [2022-02-20 20:39:27,409 INFO L290 TraceCheckUtils]: 36: Hoare triple {112#false} [482] L709-6-->L709-7: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {112#false} is VALID [2022-02-20 20:39:27,410 INFO L290 TraceCheckUtils]: 37: Hoare triple {112#false} [464] L709-7-->L712: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {112#false} is VALID [2022-02-20 20:39:27,410 INFO L290 TraceCheckUtils]: 38: Hoare triple {112#false} [510] L712-->L712-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= |v_ULTIMATE.start_main_~sum~0#1_5| 9) 1 0)) InVars {ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_5|} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {112#false} is VALID [2022-02-20 20:39:27,410 INFO L290 TraceCheckUtils]: 39: Hoare triple {112#false} [436] L712-1-->L689: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {112#false} is VALID [2022-02-20 20:39:27,410 INFO L290 TraceCheckUtils]: 40: Hoare triple {112#false} [445] L689-->L689-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {112#false} is VALID [2022-02-20 20:39:27,410 INFO L290 TraceCheckUtils]: 41: Hoare triple {112#false} [450] L689-1-->L689-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_3| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[] {112#false} is VALID [2022-02-20 20:39:27,410 INFO L290 TraceCheckUtils]: 42: Hoare triple {112#false} [503] L689-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {112#false} is VALID [2022-02-20 20:39:27,411 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:39:27,411 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:39:27,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448539031] [2022-02-20 20:39:27,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448539031] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:39:27,411 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:39:27,411 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:39:27,412 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048033527] [2022-02-20 20:39:27,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:39:27,412 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 20:39:27,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:39:27,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 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:39:27,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:39:27,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 20:39:27,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:39:27,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 20:39:27,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 20:39:27,435 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 109 [2022-02-20 20:39:27,436 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 99 transitions, 242 flow. Second operand has 2 states, 2 states have (on average 96.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 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:39:27,436 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:39:27,436 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 109 [2022-02-20 20:39:27,436 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:39:27,487 INFO L129 PetriNetUnfolder]: 37/503 cut-off events. [2022-02-20 20:39:27,487 INFO L130 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-02-20 20:39:27,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 503 events. 37/503 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2010 event pairs, 6 based on Foata normal form. 38/503 useless extension candidates. Maximal degree in co-relation 317. Up to 37 conditions per place. [2022-02-20 20:39:27,489 INFO L132 encePairwiseOnDemand]: 105/109 looper letters, 8 selfloop transitions, 0 changer transitions 1/95 dead transitions. [2022-02-20 20:39:27,490 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 95 transitions, 250 flow [2022-02-20 20:39:27,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 20:39:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-02-20 20:39:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2022-02-20 20:39:27,492 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.926605504587156 [2022-02-20 20:39:27,492 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 202 transitions. [2022-02-20 20:39:27,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 202 transitions. [2022-02-20 20:39:27,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:39:27,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 202 transitions. [2022-02-20 20:39:27,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 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:39:27,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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:39:27,493 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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:39:27,494 INFO L186 Difference]: Start difference. First operand has 99 places, 99 transitions, 242 flow. Second operand 2 states and 202 transitions. [2022-02-20 20:39:27,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 95 transitions, 250 flow [2022-02-20 20:39:27,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 95 transitions, 250 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-02-20 20:39:27,501 INFO L242 Difference]: Finished difference. Result has 100 places, 94 transitions, 232 flow [2022-02-20 20:39:27,501 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=232, PETRI_PLACES=100, PETRI_TRANSITIONS=94} [2022-02-20 20:39:27,502 INFO L334 CegarLoopForPetriNet]: 99 programPoint places, 1 predicate places. [2022-02-20 20:39:27,502 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 100 places, 94 transitions, 232 flow [2022-02-20 20:39:29,018 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 68466 states, 68448 states have (on average 3.9313347358578774) internal successors, (269092), 68465 states have internal predecessors, (269092), 0 states have call successors, (0), 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:39:29,221 INFO L78 Accepts]: Start accepts. Automaton has has 68466 states, 68448 states have (on average 3.9313347358578774) internal successors, (269092), 68465 states have internal predecessors, (269092), 0 states have call successors, (0), 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 43 [2022-02-20 20:39:29,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:39:29,222 INFO L470 AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 232 flow [2022-02-20 20:39:29,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 96.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 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:39:29,222 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:39:29,222 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] [2022-02-20 20:39:29,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 20:39:29,223 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:39:29,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:39:29,223 INFO L85 PathProgramCache]: Analyzing trace with hash -197363061, now seen corresponding path program 1 times [2022-02-20 20:39:29,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:39:29,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622019844] [2022-02-20 20:39:29,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:39:29,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:39:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:39:29,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {68581#true} [493] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68581#true} is VALID [2022-02-20 20:39:29,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {68581#true} [473] 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] {68581#true} is VALID [2022-02-20 20:39:29,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {68581#true} [502] 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[] {68581#true} is VALID [2022-02-20 20:39:29,294 INFO L290 TraceCheckUtils]: 3: Hoare triple {68581#true} [505] L-1-2-->L683: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {68581#true} is VALID [2022-02-20 20:39:29,294 INFO L290 TraceCheckUtils]: 4: Hoare triple {68581#true} [443] L683-->L683-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {68581#true} is VALID [2022-02-20 20:39:29,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {68581#true} [491] L683-1-->L683-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {68581#true} is VALID [2022-02-20 20:39:29,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {68581#true} [471] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {68581#true} is VALID [2022-02-20 20:39:29,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {68581#true} [501] L683-3-->L683-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {68581#true} is VALID [2022-02-20 20:39:29,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {68581#true} [433] L683-4-->L690: Formula: (and (= |v_~#a~0.offset_1| 0) (= |v_~#a~0.base_1| 3)) InVars {} OutVars{~#a~0.base=|v_~#a~0.base_1|, ~#a~0.offset=|v_~#a~0.offset_1|} AuxVars[] AssignedVars[~#a~0.base, ~#a~0.offset] {68581#true} is VALID [2022-02-20 20:39:29,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {68581#true} [499] L690-->L690-1: Formula: (and (= (select |v_#valid_4| 3) 1) (= 40 (select |v_#length_3| 3))) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {68581#true} is VALID [2022-02-20 20:39:29,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {68581#true} [437] L690-1-->L690-2: Formula: (= (store |v_#memory_int_4| |v_~#a~0.base_2| ((as const (Array Int Int)) 0)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ~#a~0.base=|v_~#a~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#a~0.base=|v_~#a~0.base_2|} AuxVars[] AssignedVars[#memory_int] {68581#true} is VALID [2022-02-20 20:39:29,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {68581#true} [455] L690-2-->L690-3: Formula: (= (store |v_#memory_int_6| |v_~#a~0.base_3| (store (select |v_#memory_int_6| |v_~#a~0.base_3|) |v_~#a~0.offset_2| 0)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ~#a~0.base=|v_~#a~0.base_3|, ~#a~0.offset=|v_~#a~0.offset_2|} OutVars{#memory_int=|v_#memory_int_5|, ~#a~0.base=|v_~#a~0.base_3|, ~#a~0.offset=|v_~#a~0.offset_2|} AuxVars[] AssignedVars[#memory_int] {68581#true} is VALID [2022-02-20 20:39:29,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {68581#true} [469] L690-3-->L-1-3: Formula: (= v_~x~0_1 0) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] {68581#true} is VALID [2022-02-20 20:39:29,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {68581#true} [507] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68581#true} is VALID [2022-02-20 20:39:29,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {68581#true} [479] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68581#true} is VALID [2022-02-20 20:39:29,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {68581#true} [448] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {68581#true} is VALID [2022-02-20 20:39:29,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {68581#true} [477] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {68581#true} is VALID [2022-02-20 20:39:29,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {68581#true} [444] L-1-7-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_1|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_1|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t~1#1.offset, ULTIMATE.start_main_~#t~1#1.base, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~sum~0#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_#t~post4#1] {68581#true} is VALID [2022-02-20 20:39:29,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {68581#true} [467] L697-->L697-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {68581#true} is VALID [2022-02-20 20:39:29,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {68581#true} [449] L697-1-->L698: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {68581#true} is VALID [2022-02-20 20:39:29,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {68581#true} [462] L698-->L698-1: Formula: (and (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#t~1#1.base_2| 40)) (not (= |v_ULTIMATE.start_main_~#t~1#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~1#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t~1#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t~1#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t~1#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_2|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~1#1.offset, ULTIMATE.start_main_~#t~1#1.base, #valid, #length] {68581#true} is VALID [2022-02-20 20:39:29,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {68581#true} [460] L698-1-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {68581#true} is VALID [2022-02-20 20:39:29,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {68581#true} [506] L700-->L700-1: Formula: (= |v_ULTIMATE.start_main_~n~0#1_2| (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~nondet3#1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_2|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0#1] {68581#true} is VALID [2022-02-20 20:39:29,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {68581#true} [509] L700-1-->L701: 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] {68581#true} is VALID [2022-02-20 20:39:29,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {68581#true} [500] L701-->L701-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68581#true} is VALID [2022-02-20 20:39:29,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {68581#true} [452] L701-1-->L701-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 5 |v_ULTIMATE.start_main_~n~0#1_3|) (<= |v_ULTIMATE.start_main_~n~0#1_3| 10)) 1 0)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_3|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_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] {68583#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:39:29,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {68583#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [456] L701-2-->L686: 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] {68583#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:39:29,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {68583#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [516] L686-->L687: 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] {68584#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))} is VALID [2022-02-20 20:39:29,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {68584#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))} [496] L687-->L686-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[] {68585#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:29,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {68585#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [458] L686-1-->L702: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68585#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:29,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {68585#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [454] L702-->L702-6: Formula: (= |v_ULTIMATE.start_main_~i~0#1_3| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {68586#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:29,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {68586#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [514] L702-6-->L702-7: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_4| |v_ULTIMATE.start_main_~n~0#1_4|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|} AuxVars[] AssignedVars[] {68582#false} is VALID [2022-02-20 20:39:29,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {68582#false} [446] L702-7-->L705-5: Formula: (= |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {68582#false} is VALID [2022-02-20 20:39:29,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {68582#false} [440] L705-5-->L705-6: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_10| |v_ULTIMATE.start_main_~n~0#1_6|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] {68582#false} is VALID [2022-02-20 20:39:29,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {68582#false} [512] L705-6-->L709: Formula: (= |v_ULTIMATE.start_main_~sum~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~sum~0#1] {68582#false} is VALID [2022-02-20 20:39:29,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {68582#false} [481] L709-->L709-6: Formula: (= |v_ULTIMATE.start_main_~i~0#1_15| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {68582#false} is VALID [2022-02-20 20:39:29,302 INFO L290 TraceCheckUtils]: 36: Hoare triple {68582#false} [483] L709-6-->L709-7: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_16| |v_ULTIMATE.start_main_~n~0#1_8|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} AuxVars[] AssignedVars[] {68582#false} is VALID [2022-02-20 20:39:29,302 INFO L290 TraceCheckUtils]: 37: Hoare triple {68582#false} [464] L709-7-->L712: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68582#false} is VALID [2022-02-20 20:39:29,302 INFO L290 TraceCheckUtils]: 38: Hoare triple {68582#false} [510] L712-->L712-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= |v_ULTIMATE.start_main_~sum~0#1_5| 9) 1 0)) InVars {ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_5|} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {68582#false} is VALID [2022-02-20 20:39:29,302 INFO L290 TraceCheckUtils]: 39: Hoare triple {68582#false} [436] L712-1-->L689: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {68582#false} is VALID [2022-02-20 20:39:29,302 INFO L290 TraceCheckUtils]: 40: Hoare triple {68582#false} [445] L689-->L689-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {68582#false} is VALID [2022-02-20 20:39:29,302 INFO L290 TraceCheckUtils]: 41: Hoare triple {68582#false} [450] L689-1-->L689-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_3| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[] {68582#false} is VALID [2022-02-20 20:39:29,303 INFO L290 TraceCheckUtils]: 42: Hoare triple {68582#false} [503] L689-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68582#false} is VALID [2022-02-20 20:39:29,303 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:39:29,303 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:39:29,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622019844] [2022-02-20 20:39:29,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622019844] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:39:29,304 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:39:29,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:39:29,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977297904] [2022-02-20 20:39:29,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:39:29,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 20:39:29,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:39:29,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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:39:29,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:39:29,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:39:29,328 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:39:29,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:39:29,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:39:29,329 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 109 [2022-02-20 20:39:29,329 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 94 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 71.16666666666667) internal successors, (427), 6 states have internal predecessors, (427), 0 states have call successors, (0), 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:39:29,329 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:39:29,330 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 109 [2022-02-20 20:39:29,330 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:39:33,567 INFO L129 PetriNetUnfolder]: 38/603 cut-off events. [2022-02-20 20:39:33,567 INFO L130 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-02-20 20:39:33,569 INFO L84 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 603 events. 38/603 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2859 event pairs, 1 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 980. Up to 218 conditions per place. [2022-02-20 20:39:33,571 INFO L132 encePairwiseOnDemand]: 97/109 looper letters, 40 selfloop transitions, 9 changer transitions 0/110 dead transitions. [2022-02-20 20:39:33,571 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 110 transitions, 374 flow [2022-02-20 20:39:33,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 20:39:33,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-02-20 20:39:33,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 466 transitions. [2022-02-20 20:39:33,575 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7125382262996942 [2022-02-20 20:39:33,575 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 466 transitions. [2022-02-20 20:39:33,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 466 transitions. [2022-02-20 20:39:33,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:39:33,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 466 transitions. [2022-02-20 20:39:33,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 0 states have call successors, (0), 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:39:33,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 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:39:33,578 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 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:39:33,578 INFO L186 Difference]: Start difference. First operand has 100 places, 94 transitions, 232 flow. Second operand 6 states and 466 transitions. [2022-02-20 20:39:33,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 110 transitions, 374 flow [2022-02-20 20:39:37,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 110 transitions, 374 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-02-20 20:39:37,948 INFO L242 Difference]: Finished difference. Result has 105 places, 97 transitions, 274 flow [2022-02-20 20:39:37,949 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=274, PETRI_PLACES=105, PETRI_TRANSITIONS=97} [2022-02-20 20:39:37,949 INFO L334 CegarLoopForPetriNet]: 99 programPoint places, 6 predicate places. [2022-02-20 20:39:37,949 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 97 transitions, 274 flow [2022-02-20 20:39:38,935 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 55496 states, 55479 states have (on average 3.6625209538744388) internal successors, (203193), 55495 states have internal predecessors, (203193), 0 states have call successors, (0), 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:39:39,036 INFO L78 Accepts]: Start accepts. Automaton has has 55496 states, 55479 states have (on average 3.6625209538744388) internal successors, (203193), 55495 states have internal predecessors, (203193), 0 states have call successors, (0), 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 43 [2022-02-20 20:39:39,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:39:39,037 INFO L470 AbstractCegarLoop]: Abstraction has has 105 places, 97 transitions, 274 flow [2022-02-20 20:39:39,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.16666666666667) internal successors, (427), 6 states have internal predecessors, (427), 0 states have call successors, (0), 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:39:39,037 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:39:39,037 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:39:39,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 20:39:39,038 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:39:39,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:39:39,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1092255810, now seen corresponding path program 1 times [2022-02-20 20:39:39,038 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:39:39,038 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748839911] [2022-02-20 20:39:39,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:39:39,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:39:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:39:39,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {124088#true} [493] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:39,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {124088#true} [473] 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] {124088#true} is VALID [2022-02-20 20:39:39,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {124088#true} [502] 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[] {124088#true} is VALID [2022-02-20 20:39:39,200 INFO L290 TraceCheckUtils]: 3: Hoare triple {124088#true} [505] L-1-2-->L683: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:39,200 INFO L290 TraceCheckUtils]: 4: Hoare triple {124088#true} [443] L683-->L683-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:39,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {124088#true} [491] L683-1-->L683-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:39,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {124088#true} [471] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:39,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {124088#true} [501] L683-3-->L683-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:39,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {124088#true} [433] L683-4-->L690: Formula: (and (= |v_~#a~0.offset_1| 0) (= |v_~#a~0.base_1| 3)) InVars {} OutVars{~#a~0.base=|v_~#a~0.base_1|, ~#a~0.offset=|v_~#a~0.offset_1|} AuxVars[] AssignedVars[~#a~0.base, ~#a~0.offset] {124088#true} is VALID [2022-02-20 20:39:39,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {124088#true} [499] L690-->L690-1: Formula: (and (= (select |v_#valid_4| 3) 1) (= 40 (select |v_#length_3| 3))) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:39,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {124088#true} [437] L690-1-->L690-2: Formula: (= (store |v_#memory_int_4| |v_~#a~0.base_2| ((as const (Array Int Int)) 0)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ~#a~0.base=|v_~#a~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#a~0.base=|v_~#a~0.base_2|} AuxVars[] AssignedVars[#memory_int] {124088#true} is VALID [2022-02-20 20:39:39,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {124088#true} [455] L690-2-->L690-3: Formula: (= (store |v_#memory_int_6| |v_~#a~0.base_3| (store (select |v_#memory_int_6| |v_~#a~0.base_3|) |v_~#a~0.offset_2| 0)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ~#a~0.base=|v_~#a~0.base_3|, ~#a~0.offset=|v_~#a~0.offset_2|} OutVars{#memory_int=|v_#memory_int_5|, ~#a~0.base=|v_~#a~0.base_3|, ~#a~0.offset=|v_~#a~0.offset_2|} AuxVars[] AssignedVars[#memory_int] {124088#true} is VALID [2022-02-20 20:39:39,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {124088#true} [469] L690-3-->L-1-3: Formula: (= v_~x~0_1 0) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] {124088#true} is VALID [2022-02-20 20:39:39,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {124088#true} [507] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:39,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {124088#true} [479] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:39,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {124088#true} [448] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {124088#true} is VALID [2022-02-20 20:39:39,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {124088#true} [477] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {124088#true} is VALID [2022-02-20 20:39:39,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {124088#true} [444] L-1-7-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_1|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_1|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t~1#1.offset, ULTIMATE.start_main_~#t~1#1.base, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~sum~0#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_#t~post4#1] {124088#true} is VALID [2022-02-20 20:39:39,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {124088#true} [467] L697-->L697-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {124088#true} is VALID [2022-02-20 20:39:39,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {124088#true} [449] L697-1-->L698: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {124088#true} is VALID [2022-02-20 20:39:39,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {124088#true} [462] L698-->L698-1: Formula: (and (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#t~1#1.base_2| 40)) (not (= |v_ULTIMATE.start_main_~#t~1#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~1#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t~1#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t~1#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t~1#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_2|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~1#1.offset, ULTIMATE.start_main_~#t~1#1.base, #valid, #length] {124088#true} is VALID [2022-02-20 20:39:39,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {124088#true} [460] L698-1-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {124088#true} is VALID [2022-02-20 20:39:39,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {124088#true} [506] L700-->L700-1: Formula: (= |v_ULTIMATE.start_main_~n~0#1_2| (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~nondet3#1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_2|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0#1] {124088#true} is VALID [2022-02-20 20:39:39,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {124088#true} [509] L700-1-->L701: 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] {124088#true} is VALID [2022-02-20 20:39:39,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {124088#true} [500] L701-->L701-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:39,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {124088#true} [452] L701-1-->L701-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 5 |v_ULTIMATE.start_main_~n~0#1_3|) (<= |v_ULTIMATE.start_main_~n~0#1_3| 10)) 1 0)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_3|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_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] {124090#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:39:39,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {124090#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [456] L701-2-->L686: 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] {124090#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:39:39,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {124090#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [516] L686-->L687: 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] {124091#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))} is VALID [2022-02-20 20:39:39,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {124091#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))} [496] L687-->L686-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[] {124092#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {124092#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [458] L686-1-->L702: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124092#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {124092#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [454] L702-->L702-6: Formula: (= |v_ULTIMATE.start_main_~i~0#1_3| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {124093#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {124093#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [515] L702-6-->L703: Formula: (< |v_ULTIMATE.start_main_~i~0#1_5| |v_ULTIMATE.start_main_~n~0#1_5|) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] {124093#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,217 INFO L290 TraceCheckUtils]: 32: Hoare triple {124093#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [442] L703-->L703-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {124093#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {124093#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [485] L703-1-->L703-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {124093#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,219 INFO L290 TraceCheckUtils]: 34: Hoare triple {124093#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [461] L703-2-->L703-3: Formula: (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t~1#1.base_3| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t~1#1.base_3|) (+ |v_ULTIMATE.start_main_~#t~1#1.offset_3| (* |v_ULTIMATE.start_main_~i~0#1_6| 4)) |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_7|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_3|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_3|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_3|} AuxVars[] AssignedVars[#memory_int] {124093#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,219 INFO L290 TraceCheckUtils]: 35: Hoare triple {124093#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [539] L703-3-->thrENTRY: Formula: (and (= |v_thrThread1of4ForFork0_#in~arg.base_4| 0) (= |v_thrThread1of4ForFork0_#in~arg.offset_4| 0) (= v_thrThread1of4ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre5#1_18|)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_18|} OutVars{thrThread1of4ForFork0_~arg.base=v_thrThread1of4ForFork0_~arg.base_4, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_18|, thrThread1of4ForFork0_#in~arg.offset=|v_thrThread1of4ForFork0_#in~arg.offset_4|, thrThread1of4ForFork0_#res.base=|v_thrThread1of4ForFork0_#res.base_2|, thrThread1of4ForFork0_~t~0=v_thrThread1of4ForFork0_~t~0_8, thrThread1of4ForFork0_~arg.offset=v_thrThread1of4ForFork0_~arg.offset_4, thrThread1of4ForFork0_thidvar0=v_thrThread1of4ForFork0_thidvar0_2, thrThread1of4ForFork0_#in~arg.base=|v_thrThread1of4ForFork0_#in~arg.base_4|, thrThread1of4ForFork0_#res.offset=|v_thrThread1of4ForFork0_#res.offset_2|} AuxVars[] AssignedVars[thrThread1of4ForFork0_~arg.base, thrThread1of4ForFork0_#in~arg.offset, thrThread1of4ForFork0_#res.base, thrThread1of4ForFork0_~t~0, thrThread1of4ForFork0_~arg.offset, thrThread1of4ForFork0_thidvar0, thrThread1of4ForFork0_#in~arg.base, thrThread1of4ForFork0_#res.offset] {124093#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,219 INFO L290 TraceCheckUtils]: 36: Hoare triple {124093#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [480] L703-4-->L703-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {124093#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,222 INFO L290 TraceCheckUtils]: 37: Hoare triple {124093#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [459] L703-5-->L702-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {124093#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,223 INFO L290 TraceCheckUtils]: 38: Hoare triple {124093#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [453] L702-3-->L702-4: Formula: (= |v_ULTIMATE.start_main_#t~post4#1_2| |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post4#1] {124094#(and (= |ULTIMATE.start_main_#t~post4#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,225 INFO L290 TraceCheckUtils]: 39: Hoare triple {124094#(and (= |ULTIMATE.start_main_#t~post4#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [494] L702-4-->L702-5: Formula: (= (+ |v_ULTIMATE.start_main_#t~post4#1_3| 1) |v_ULTIMATE.start_main_~i~0#1_8|) InVars {ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_3|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {124095#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= (+ |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,226 INFO L290 TraceCheckUtils]: 40: Hoare triple {124095#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= (+ |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~n~0#1|))} [438] L702-5-->L702-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post4#1] {124095#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= (+ |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,226 INFO L290 TraceCheckUtils]: 41: Hoare triple {124095#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= (+ |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~n~0#1|))} [514] L702-6-->L702-7: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_4| |v_ULTIMATE.start_main_~n~0#1_4|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:39,226 INFO L290 TraceCheckUtils]: 42: Hoare triple {124089#false} [446] L702-7-->L705-5: Formula: (= |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {124089#false} is VALID [2022-02-20 20:39:39,227 INFO L290 TraceCheckUtils]: 43: Hoare triple {124089#false} [441] L705-5-->L706: Formula: (< |v_ULTIMATE.start_main_~i~0#1_11| |v_ULTIMATE.start_main_~n~0#1_7|) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:39,227 INFO L290 TraceCheckUtils]: 44: Hoare triple {124089#false} [475] L706-->L706-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8#1_2| (select (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#t~1#1.base_4|) (+ |v_ULTIMATE.start_main_~#t~1#1.offset_4| (* |v_ULTIMATE.start_main_~i~0#1_12| 4)))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_4|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_4|} OutVars{#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_2|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_4|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {124089#false} is VALID [2022-02-20 20:39:39,227 INFO L290 TraceCheckUtils]: 45: Hoare triple {124089#false} [518] thrENTRY-->L693: Formula: (and (= |v_thrThread1of4ForFork0_#in~arg.base_1| v_thrThread1of4ForFork0_~arg.base_1) (= v_thrThread1of4ForFork0_~arg.offset_1 |v_thrThread1of4ForFork0_#in~arg.offset_1|)) InVars {thrThread1of4ForFork0_#in~arg.base=|v_thrThread1of4ForFork0_#in~arg.base_1|, thrThread1of4ForFork0_#in~arg.offset=|v_thrThread1of4ForFork0_#in~arg.offset_1|} OutVars{thrThread1of4ForFork0_~arg.base=v_thrThread1of4ForFork0_~arg.base_1, thrThread1of4ForFork0_#in~arg.offset=|v_thrThread1of4ForFork0_#in~arg.offset_1|, thrThread1of4ForFork0_#in~arg.base=|v_thrThread1of4ForFork0_#in~arg.base_1|, thrThread1of4ForFork0_~arg.offset=v_thrThread1of4ForFork0_~arg.offset_1} AuxVars[] AssignedVars[thrThread1of4ForFork0_~arg.base, thrThread1of4ForFork0_~arg.offset] {124089#false} is VALID [2022-02-20 20:39:39,227 INFO L290 TraceCheckUtils]: 46: Hoare triple {124089#false} [519] L693-->L694: Formula: (= v_thrThread1of4ForFork0_~t~0_1 v_~x~0_2) InVars {~x~0=v_~x~0_2} OutVars{~x~0=v_~x~0_2, thrThread1of4ForFork0_~t~0=v_thrThread1of4ForFork0_~t~0_1} AuxVars[] AssignedVars[thrThread1of4ForFork0_~t~0] {124089#false} is VALID [2022-02-20 20:39:39,227 INFO L290 TraceCheckUtils]: 47: Hoare triple {124089#false} [520] L694-->L694-1: Formula: (= (store |v_#memory_int_12| |v_~#a~0.base_5| (store (select |v_#memory_int_12| |v_~#a~0.base_5|) (+ |v_~#a~0.offset_4| (* v_thrThread1of4ForFork0_~t~0_3 4)) 1)) |v_#memory_int_11|) InVars {#memory_int=|v_#memory_int_12|, ~#a~0.base=|v_~#a~0.base_5|, ~#a~0.offset=|v_~#a~0.offset_4|, thrThread1of4ForFork0_~t~0=v_thrThread1of4ForFork0_~t~0_3} OutVars{#memory_int=|v_#memory_int_11|, ~#a~0.base=|v_~#a~0.base_5|, ~#a~0.offset=|v_~#a~0.offset_4|, thrThread1of4ForFork0_~t~0=v_thrThread1of4ForFork0_~t~0_3} AuxVars[] AssignedVars[#memory_int] {124089#false} is VALID [2022-02-20 20:39:39,227 INFO L290 TraceCheckUtils]: 48: Hoare triple {124089#false} [521] L694-1-->thrFINAL: Formula: (= (+ v_thrThread1of4ForFork0_~t~0_5 1) v_~x~0_3) InVars {thrThread1of4ForFork0_~t~0=v_thrThread1of4ForFork0_~t~0_5} OutVars{~x~0=v_~x~0_3, thrThread1of4ForFork0_~t~0=v_thrThread1of4ForFork0_~t~0_5} AuxVars[] AssignedVars[~x~0] {124089#false} is VALID [2022-02-20 20:39:39,228 INFO L290 TraceCheckUtils]: 49: Hoare triple {124089#false} [522] thrFINAL-->thrEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:39,228 INFO L290 TraceCheckUtils]: 50: Hoare triple {124089#false} [543] thrEXIT-->L706-2: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem8#1_17| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thrThread1of4ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_17|, thrThread1of4ForFork0_thidvar0=v_thrThread1of4ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_17|, thrThread1of4ForFork0_thidvar0=v_thrThread1of4ForFork0_thidvar0_4} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:39,228 INFO L290 TraceCheckUtils]: 51: Hoare triple {124089#false} [463] L706-2-->L705-2: 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] {124089#false} is VALID [2022-02-20 20:39:39,228 INFO L290 TraceCheckUtils]: 52: Hoare triple {124089#false} [498] L705-2-->L705-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_13| |v_ULTIMATE.start_main_#t~post7#1_2|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post7#1] {124089#false} is VALID [2022-02-20 20:39:39,228 INFO L290 TraceCheckUtils]: 53: Hoare triple {124089#false} [508] L705-3-->L705-4: Formula: (= |v_ULTIMATE.start_main_~i~0#1_14| (+ |v_ULTIMATE.start_main_#t~post7#1_3| 1)) InVars {ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_3|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {124089#false} is VALID [2022-02-20 20:39:39,228 INFO L290 TraceCheckUtils]: 54: Hoare triple {124089#false} [489] L705-4-->L705-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post7#1] {124089#false} is VALID [2022-02-20 20:39:39,228 INFO L290 TraceCheckUtils]: 55: Hoare triple {124089#false} [440] L705-5-->L705-6: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_10| |v_ULTIMATE.start_main_~n~0#1_6|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:39,229 INFO L290 TraceCheckUtils]: 56: Hoare triple {124089#false} [512] L705-6-->L709: Formula: (= |v_ULTIMATE.start_main_~sum~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~sum~0#1] {124089#false} is VALID [2022-02-20 20:39:39,229 INFO L290 TraceCheckUtils]: 57: Hoare triple {124089#false} [481] L709-->L709-6: Formula: (= |v_ULTIMATE.start_main_~i~0#1_15| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {124089#false} is VALID [2022-02-20 20:39:39,229 INFO L290 TraceCheckUtils]: 58: Hoare triple {124089#false} [484] L709-6-->L710: Formula: (< |v_ULTIMATE.start_main_~i~0#1_17| |v_ULTIMATE.start_main_~n~0#1_9|) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:39,229 INFO L290 TraceCheckUtils]: 59: Hoare triple {124089#false} [431] L710-->L710-1: Formula: (= |v_ULTIMATE.start_main_#t~mem10#1_2| (select (select |v_#memory_int_10| |v_~#a~0.base_4|) (+ |v_~#a~0.offset_3| (* |v_ULTIMATE.start_main_~i~0#1_18| 4)))) InVars {#memory_int=|v_#memory_int_10|, ~#a~0.base=|v_~#a~0.base_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_18|, ~#a~0.offset=|v_~#a~0.offset_3|} OutVars{#memory_int=|v_#memory_int_10|, ~#a~0.base=|v_~#a~0.base_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_18|, ~#a~0.offset=|v_~#a~0.offset_3|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10#1] {124089#false} is VALID [2022-02-20 20:39:39,229 INFO L290 TraceCheckUtils]: 60: Hoare triple {124089#false} [511] L710-1-->L710-2: Formula: (= |v_ULTIMATE.start_main_~sum~0#1_3| (+ |v_ULTIMATE.start_main_~sum~0#1_4| |v_ULTIMATE.start_main_#t~mem10#1_3|)) InVars {ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_4|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_3|} OutVars{ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_3|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~sum~0#1] {124089#false} is VALID [2022-02-20 20:39:39,229 INFO L290 TraceCheckUtils]: 61: Hoare triple {124089#false} [474] L710-2-->L709-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10#1] {124089#false} is VALID [2022-02-20 20:39:39,229 INFO L290 TraceCheckUtils]: 62: Hoare triple {124089#false} [470] L709-3-->L709-4: Formula: (= |v_ULTIMATE.start_main_~i~0#1_19| |v_ULTIMATE.start_main_#t~post9#1_2|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_19|} OutVars{ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post9#1] {124089#false} is VALID [2022-02-20 20:39:39,230 INFO L290 TraceCheckUtils]: 63: Hoare triple {124089#false} [492] L709-4-->L709-5: Formula: (= |v_ULTIMATE.start_main_~i~0#1_20| (+ |v_ULTIMATE.start_main_#t~post9#1_3| 1)) InVars {ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_3|} OutVars{ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {124089#false} is VALID [2022-02-20 20:39:39,230 INFO L290 TraceCheckUtils]: 64: Hoare triple {124089#false} [478] L709-5-->L709-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post9#1] {124089#false} is VALID [2022-02-20 20:39:39,230 INFO L290 TraceCheckUtils]: 65: Hoare triple {124089#false} [483] L709-6-->L709-7: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_16| |v_ULTIMATE.start_main_~n~0#1_8|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:39,230 INFO L290 TraceCheckUtils]: 66: Hoare triple {124089#false} [464] L709-7-->L712: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:39,230 INFO L290 TraceCheckUtils]: 67: Hoare triple {124089#false} [510] L712-->L712-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= |v_ULTIMATE.start_main_~sum~0#1_5| 9) 1 0)) InVars {ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_5|} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {124089#false} is VALID [2022-02-20 20:39:39,230 INFO L290 TraceCheckUtils]: 68: Hoare triple {124089#false} [436] L712-1-->L689: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {124089#false} is VALID [2022-02-20 20:39:39,230 INFO L290 TraceCheckUtils]: 69: Hoare triple {124089#false} [445] L689-->L689-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {124089#false} is VALID [2022-02-20 20:39:39,230 INFO L290 TraceCheckUtils]: 70: Hoare triple {124089#false} [450] L689-1-->L689-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_3| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:39,231 INFO L290 TraceCheckUtils]: 71: Hoare triple {124089#false} [503] L689-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 20:39:39,232 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:39:39,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748839911] [2022-02-20 20:39:39,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748839911] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 20:39:39,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261280626] [2022-02-20 20:39:39,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:39:39,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 20:39:39,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:39:39,234 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 20:39:39,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 20:39:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:39:39,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 20:39:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:39:39,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 20:39:39,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {124088#true} [493] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:39,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {124088#true} [473] 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] {124088#true} is VALID [2022-02-20 20:39:39,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {124088#true} [502] 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[] {124088#true} is VALID [2022-02-20 20:39:39,804 INFO L290 TraceCheckUtils]: 3: Hoare triple {124088#true} [505] L-1-2-->L683: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:39,804 INFO L290 TraceCheckUtils]: 4: Hoare triple {124088#true} [443] L683-->L683-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:39,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {124088#true} [491] L683-1-->L683-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:39,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {124088#true} [471] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:39,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {124088#true} [501] L683-3-->L683-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:39,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {124088#true} [433] L683-4-->L690: Formula: (and (= |v_~#a~0.offset_1| 0) (= |v_~#a~0.base_1| 3)) InVars {} OutVars{~#a~0.base=|v_~#a~0.base_1|, ~#a~0.offset=|v_~#a~0.offset_1|} AuxVars[] AssignedVars[~#a~0.base, ~#a~0.offset] {124088#true} is VALID [2022-02-20 20:39:39,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {124088#true} [499] L690-->L690-1: Formula: (and (= (select |v_#valid_4| 3) 1) (= 40 (select |v_#length_3| 3))) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:39,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {124088#true} [437] L690-1-->L690-2: Formula: (= (store |v_#memory_int_4| |v_~#a~0.base_2| ((as const (Array Int Int)) 0)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ~#a~0.base=|v_~#a~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#a~0.base=|v_~#a~0.base_2|} AuxVars[] AssignedVars[#memory_int] {124088#true} is VALID [2022-02-20 20:39:39,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {124088#true} [455] L690-2-->L690-3: Formula: (= (store |v_#memory_int_6| |v_~#a~0.base_3| (store (select |v_#memory_int_6| |v_~#a~0.base_3|) |v_~#a~0.offset_2| 0)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ~#a~0.base=|v_~#a~0.base_3|, ~#a~0.offset=|v_~#a~0.offset_2|} OutVars{#memory_int=|v_#memory_int_5|, ~#a~0.base=|v_~#a~0.base_3|, ~#a~0.offset=|v_~#a~0.offset_2|} AuxVars[] AssignedVars[#memory_int] {124088#true} is VALID [2022-02-20 20:39:39,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {124088#true} [469] L690-3-->L-1-3: Formula: (= v_~x~0_1 0) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] {124088#true} is VALID [2022-02-20 20:39:39,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {124088#true} [507] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:39,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {124088#true} [479] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:39,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {124088#true} [448] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {124088#true} is VALID [2022-02-20 20:39:39,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {124088#true} [477] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {124088#true} is VALID [2022-02-20 20:39:39,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {124088#true} [444] L-1-7-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_1|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_1|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t~1#1.offset, ULTIMATE.start_main_~#t~1#1.base, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~sum~0#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_#t~post4#1] {124088#true} is VALID [2022-02-20 20:39:39,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {124088#true} [467] L697-->L697-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {124088#true} is VALID [2022-02-20 20:39:39,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {124088#true} [449] L697-1-->L698: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {124088#true} is VALID [2022-02-20 20:39:39,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {124088#true} [462] L698-->L698-1: Formula: (and (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#t~1#1.base_2| 40)) (not (= |v_ULTIMATE.start_main_~#t~1#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~1#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t~1#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t~1#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t~1#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_2|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~1#1.offset, ULTIMATE.start_main_~#t~1#1.base, #valid, #length] {124088#true} is VALID [2022-02-20 20:39:39,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {124088#true} [460] L698-1-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {124088#true} is VALID [2022-02-20 20:39:39,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {124088#true} [506] L700-->L700-1: Formula: (= |v_ULTIMATE.start_main_~n~0#1_2| (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~nondet3#1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_2|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0#1] {124088#true} is VALID [2022-02-20 20:39:39,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {124088#true} [509] L700-1-->L701: 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] {124088#true} is VALID [2022-02-20 20:39:39,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {124088#true} [500] L701-->L701-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:39,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {124088#true} [452] L701-1-->L701-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 5 |v_ULTIMATE.start_main_~n~0#1_3|) (<= |v_ULTIMATE.start_main_~n~0#1_3| 10)) 1 0)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_3|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_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] {124174#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (and (or (not (<= |ULTIMATE.start_main_~n~0#1| 10)) (not (<= 5 |ULTIMATE.start_main_~n~0#1|))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)))} is VALID [2022-02-20 20:39:39,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {124174#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (and (or (not (<= |ULTIMATE.start_main_~n~0#1| 10)) (not (<= 5 |ULTIMATE.start_main_~n~0#1|))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)))} [456] L701-2-->L686: 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] {124174#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (and (or (not (<= |ULTIMATE.start_main_~n~0#1| 10)) (not (<= 5 |ULTIMATE.start_main_~n~0#1|))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)))} is VALID [2022-02-20 20:39:39,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {124174#(or (and (<= |ULTIMATE.start_main_~n~0#1| 10) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (and (or (not (<= |ULTIMATE.start_main_~n~0#1| 10)) (not (<= 5 |ULTIMATE.start_main_~n~0#1|))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)))} [516] L686-->L687: 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] {124181#(or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not (<= |ULTIMATE.start_main_~n~0#1| 10)) (not (<= 5 |ULTIMATE.start_main_~n~0#1|)))))} is VALID [2022-02-20 20:39:39,810 INFO L290 TraceCheckUtils]: 28: Hoare triple {124181#(or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not (<= |ULTIMATE.start_main_~n~0#1| 10)) (not (<= 5 |ULTIMATE.start_main_~n~0#1|)))))} [496] L687-->L686-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[] {124092#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {124092#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [458] L686-1-->L702: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124092#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {124092#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [454] L702-->L702-6: Formula: (= |v_ULTIMATE.start_main_~i~0#1_3| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {124191#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {124191#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [515] L702-6-->L703: Formula: (< |v_ULTIMATE.start_main_~i~0#1_5| |v_ULTIMATE.start_main_~n~0#1_5|) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] {124191#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {124191#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [442] L703-->L703-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {124191#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {124191#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [485] L703-1-->L703-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {124191#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {124191#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [461] L703-2-->L703-3: Formula: (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t~1#1.base_3| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t~1#1.base_3|) (+ |v_ULTIMATE.start_main_~#t~1#1.offset_3| (* |v_ULTIMATE.start_main_~i~0#1_6| 4)) |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_7|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_3|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_3|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_3|} AuxVars[] AssignedVars[#memory_int] {124191#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {124191#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [539] L703-3-->thrENTRY: Formula: (and (= |v_thrThread1of4ForFork0_#in~arg.base_4| 0) (= |v_thrThread1of4ForFork0_#in~arg.offset_4| 0) (= v_thrThread1of4ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre5#1_18|)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_18|} OutVars{thrThread1of4ForFork0_~arg.base=v_thrThread1of4ForFork0_~arg.base_4, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_18|, thrThread1of4ForFork0_#in~arg.offset=|v_thrThread1of4ForFork0_#in~arg.offset_4|, thrThread1of4ForFork0_#res.base=|v_thrThread1of4ForFork0_#res.base_2|, thrThread1of4ForFork0_~t~0=v_thrThread1of4ForFork0_~t~0_8, thrThread1of4ForFork0_~arg.offset=v_thrThread1of4ForFork0_~arg.offset_4, thrThread1of4ForFork0_thidvar0=v_thrThread1of4ForFork0_thidvar0_2, thrThread1of4ForFork0_#in~arg.base=|v_thrThread1of4ForFork0_#in~arg.base_4|, thrThread1of4ForFork0_#res.offset=|v_thrThread1of4ForFork0_#res.offset_2|} AuxVars[] AssignedVars[thrThread1of4ForFork0_~arg.base, thrThread1of4ForFork0_#in~arg.offset, thrThread1of4ForFork0_#res.base, thrThread1of4ForFork0_~t~0, thrThread1of4ForFork0_~arg.offset, thrThread1of4ForFork0_thidvar0, thrThread1of4ForFork0_#in~arg.base, thrThread1of4ForFork0_#res.offset] {124191#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,814 INFO L290 TraceCheckUtils]: 36: Hoare triple {124191#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [480] L703-4-->L703-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {124191#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,814 INFO L290 TraceCheckUtils]: 37: Hoare triple {124191#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [459] L703-5-->L702-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {124191#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,815 INFO L290 TraceCheckUtils]: 38: Hoare triple {124191#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [453] L702-3-->L702-4: Formula: (= |v_ULTIMATE.start_main_#t~post4#1_2| |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post4#1] {124216#(and (<= |ULTIMATE.start_main_#t~post4#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:39,815 INFO L290 TraceCheckUtils]: 39: Hoare triple {124216#(and (<= |ULTIMATE.start_main_#t~post4#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|))} [494] L702-4-->L702-5: Formula: (= (+ |v_ULTIMATE.start_main_#t~post4#1_3| 1) |v_ULTIMATE.start_main_~i~0#1_8|) InVars {ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_3|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {124220#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 20:39:39,815 INFO L290 TraceCheckUtils]: 40: Hoare triple {124220#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} [438] L702-5-->L702-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post4#1] {124220#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 20:39:39,816 INFO L290 TraceCheckUtils]: 41: Hoare triple {124220#(and (<= |ULTIMATE.start_main_~n~0#1| 10) (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} [514] L702-6-->L702-7: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_4| |v_ULTIMATE.start_main_~n~0#1_4|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:39,816 INFO L290 TraceCheckUtils]: 42: Hoare triple {124089#false} [446] L702-7-->L705-5: Formula: (= |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {124089#false} is VALID [2022-02-20 20:39:39,816 INFO L290 TraceCheckUtils]: 43: Hoare triple {124089#false} [441] L705-5-->L706: Formula: (< |v_ULTIMATE.start_main_~i~0#1_11| |v_ULTIMATE.start_main_~n~0#1_7|) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:39,816 INFO L290 TraceCheckUtils]: 44: Hoare triple {124089#false} [475] L706-->L706-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8#1_2| (select (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#t~1#1.base_4|) (+ |v_ULTIMATE.start_main_~#t~1#1.offset_4| (* |v_ULTIMATE.start_main_~i~0#1_12| 4)))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_4|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_4|} OutVars{#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_2|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_4|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {124089#false} is VALID [2022-02-20 20:39:39,816 INFO L290 TraceCheckUtils]: 45: Hoare triple {124089#false} [518] thrENTRY-->L693: Formula: (and (= |v_thrThread1of4ForFork0_#in~arg.base_1| v_thrThread1of4ForFork0_~arg.base_1) (= v_thrThread1of4ForFork0_~arg.offset_1 |v_thrThread1of4ForFork0_#in~arg.offset_1|)) InVars {thrThread1of4ForFork0_#in~arg.base=|v_thrThread1of4ForFork0_#in~arg.base_1|, thrThread1of4ForFork0_#in~arg.offset=|v_thrThread1of4ForFork0_#in~arg.offset_1|} OutVars{thrThread1of4ForFork0_~arg.base=v_thrThread1of4ForFork0_~arg.base_1, thrThread1of4ForFork0_#in~arg.offset=|v_thrThread1of4ForFork0_#in~arg.offset_1|, thrThread1of4ForFork0_#in~arg.base=|v_thrThread1of4ForFork0_#in~arg.base_1|, thrThread1of4ForFork0_~arg.offset=v_thrThread1of4ForFork0_~arg.offset_1} AuxVars[] AssignedVars[thrThread1of4ForFork0_~arg.base, thrThread1of4ForFork0_~arg.offset] {124089#false} is VALID [2022-02-20 20:39:39,817 INFO L290 TraceCheckUtils]: 46: Hoare triple {124089#false} [519] L693-->L694: Formula: (= v_thrThread1of4ForFork0_~t~0_1 v_~x~0_2) InVars {~x~0=v_~x~0_2} OutVars{~x~0=v_~x~0_2, thrThread1of4ForFork0_~t~0=v_thrThread1of4ForFork0_~t~0_1} AuxVars[] AssignedVars[thrThread1of4ForFork0_~t~0] {124089#false} is VALID [2022-02-20 20:39:39,817 INFO L290 TraceCheckUtils]: 47: Hoare triple {124089#false} [520] L694-->L694-1: Formula: (= (store |v_#memory_int_12| |v_~#a~0.base_5| (store (select |v_#memory_int_12| |v_~#a~0.base_5|) (+ |v_~#a~0.offset_4| (* v_thrThread1of4ForFork0_~t~0_3 4)) 1)) |v_#memory_int_11|) InVars {#memory_int=|v_#memory_int_12|, ~#a~0.base=|v_~#a~0.base_5|, ~#a~0.offset=|v_~#a~0.offset_4|, thrThread1of4ForFork0_~t~0=v_thrThread1of4ForFork0_~t~0_3} OutVars{#memory_int=|v_#memory_int_11|, ~#a~0.base=|v_~#a~0.base_5|, ~#a~0.offset=|v_~#a~0.offset_4|, thrThread1of4ForFork0_~t~0=v_thrThread1of4ForFork0_~t~0_3} AuxVars[] AssignedVars[#memory_int] {124089#false} is VALID [2022-02-20 20:39:39,817 INFO L290 TraceCheckUtils]: 48: Hoare triple {124089#false} [521] L694-1-->thrFINAL: Formula: (= (+ v_thrThread1of4ForFork0_~t~0_5 1) v_~x~0_3) InVars {thrThread1of4ForFork0_~t~0=v_thrThread1of4ForFork0_~t~0_5} OutVars{~x~0=v_~x~0_3, thrThread1of4ForFork0_~t~0=v_thrThread1of4ForFork0_~t~0_5} AuxVars[] AssignedVars[~x~0] {124089#false} is VALID [2022-02-20 20:39:39,817 INFO L290 TraceCheckUtils]: 49: Hoare triple {124089#false} [522] thrFINAL-->thrEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:39,817 INFO L290 TraceCheckUtils]: 50: Hoare triple {124089#false} [543] thrEXIT-->L706-2: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem8#1_17| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thrThread1of4ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_17|, thrThread1of4ForFork0_thidvar0=v_thrThread1of4ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_17|, thrThread1of4ForFork0_thidvar0=v_thrThread1of4ForFork0_thidvar0_4} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:39,817 INFO L290 TraceCheckUtils]: 51: Hoare triple {124089#false} [463] L706-2-->L705-2: 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] {124089#false} is VALID [2022-02-20 20:39:39,817 INFO L290 TraceCheckUtils]: 52: Hoare triple {124089#false} [498] L705-2-->L705-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_13| |v_ULTIMATE.start_main_#t~post7#1_2|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post7#1] {124089#false} is VALID [2022-02-20 20:39:39,818 INFO L290 TraceCheckUtils]: 53: Hoare triple {124089#false} [508] L705-3-->L705-4: Formula: (= |v_ULTIMATE.start_main_~i~0#1_14| (+ |v_ULTIMATE.start_main_#t~post7#1_3| 1)) InVars {ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_3|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {124089#false} is VALID [2022-02-20 20:39:39,818 INFO L290 TraceCheckUtils]: 54: Hoare triple {124089#false} [489] L705-4-->L705-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post7#1] {124089#false} is VALID [2022-02-20 20:39:39,818 INFO L290 TraceCheckUtils]: 55: Hoare triple {124089#false} [440] L705-5-->L705-6: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_10| |v_ULTIMATE.start_main_~n~0#1_6|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:39,818 INFO L290 TraceCheckUtils]: 56: Hoare triple {124089#false} [512] L705-6-->L709: Formula: (= |v_ULTIMATE.start_main_~sum~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~sum~0#1] {124089#false} is VALID [2022-02-20 20:39:39,818 INFO L290 TraceCheckUtils]: 57: Hoare triple {124089#false} [481] L709-->L709-6: Formula: (= |v_ULTIMATE.start_main_~i~0#1_15| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {124089#false} is VALID [2022-02-20 20:39:39,818 INFO L290 TraceCheckUtils]: 58: Hoare triple {124089#false} [484] L709-6-->L710: Formula: (< |v_ULTIMATE.start_main_~i~0#1_17| |v_ULTIMATE.start_main_~n~0#1_9|) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:39,818 INFO L290 TraceCheckUtils]: 59: Hoare triple {124089#false} [431] L710-->L710-1: Formula: (= |v_ULTIMATE.start_main_#t~mem10#1_2| (select (select |v_#memory_int_10| |v_~#a~0.base_4|) (+ |v_~#a~0.offset_3| (* |v_ULTIMATE.start_main_~i~0#1_18| 4)))) InVars {#memory_int=|v_#memory_int_10|, ~#a~0.base=|v_~#a~0.base_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_18|, ~#a~0.offset=|v_~#a~0.offset_3|} OutVars{#memory_int=|v_#memory_int_10|, ~#a~0.base=|v_~#a~0.base_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_18|, ~#a~0.offset=|v_~#a~0.offset_3|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10#1] {124089#false} is VALID [2022-02-20 20:39:39,819 INFO L290 TraceCheckUtils]: 60: Hoare triple {124089#false} [511] L710-1-->L710-2: Formula: (= |v_ULTIMATE.start_main_~sum~0#1_3| (+ |v_ULTIMATE.start_main_~sum~0#1_4| |v_ULTIMATE.start_main_#t~mem10#1_3|)) InVars {ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_4|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_3|} OutVars{ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_3|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~sum~0#1] {124089#false} is VALID [2022-02-20 20:39:39,819 INFO L290 TraceCheckUtils]: 61: Hoare triple {124089#false} [474] L710-2-->L709-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10#1] {124089#false} is VALID [2022-02-20 20:39:39,819 INFO L290 TraceCheckUtils]: 62: Hoare triple {124089#false} [470] L709-3-->L709-4: Formula: (= |v_ULTIMATE.start_main_~i~0#1_19| |v_ULTIMATE.start_main_#t~post9#1_2|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_19|} OutVars{ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post9#1] {124089#false} is VALID [2022-02-20 20:39:39,819 INFO L290 TraceCheckUtils]: 63: Hoare triple {124089#false} [492] L709-4-->L709-5: Formula: (= |v_ULTIMATE.start_main_~i~0#1_20| (+ |v_ULTIMATE.start_main_#t~post9#1_3| 1)) InVars {ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_3|} OutVars{ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {124089#false} is VALID [2022-02-20 20:39:39,819 INFO L290 TraceCheckUtils]: 64: Hoare triple {124089#false} [478] L709-5-->L709-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post9#1] {124089#false} is VALID [2022-02-20 20:39:39,819 INFO L290 TraceCheckUtils]: 65: Hoare triple {124089#false} [483] L709-6-->L709-7: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_16| |v_ULTIMATE.start_main_~n~0#1_8|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:39,819 INFO L290 TraceCheckUtils]: 66: Hoare triple {124089#false} [464] L709-7-->L712: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:39,820 INFO L290 TraceCheckUtils]: 67: Hoare triple {124089#false} [510] L712-->L712-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= |v_ULTIMATE.start_main_~sum~0#1_5| 9) 1 0)) InVars {ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_5|} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {124089#false} is VALID [2022-02-20 20:39:39,820 INFO L290 TraceCheckUtils]: 68: Hoare triple {124089#false} [436] L712-1-->L689: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {124089#false} is VALID [2022-02-20 20:39:39,820 INFO L290 TraceCheckUtils]: 69: Hoare triple {124089#false} [445] L689-->L689-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {124089#false} is VALID [2022-02-20 20:39:39,820 INFO L290 TraceCheckUtils]: 70: Hoare triple {124089#false} [450] L689-1-->L689-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_3| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:39,820 INFO L290 TraceCheckUtils]: 71: Hoare triple {124089#false} [503] L689-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:39,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 20:39:39,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 20:39:40,063 INFO L290 TraceCheckUtils]: 71: Hoare triple {124089#false} [503] L689-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:40,063 INFO L290 TraceCheckUtils]: 70: Hoare triple {124089#false} [450] L689-1-->L689-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_3| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:40,063 INFO L290 TraceCheckUtils]: 69: Hoare triple {124089#false} [445] L689-->L689-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {124089#false} is VALID [2022-02-20 20:39:40,063 INFO L290 TraceCheckUtils]: 68: Hoare triple {124089#false} [436] L712-1-->L689: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {124089#false} is VALID [2022-02-20 20:39:40,063 INFO L290 TraceCheckUtils]: 67: Hoare triple {124089#false} [510] L712-->L712-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= |v_ULTIMATE.start_main_~sum~0#1_5| 9) 1 0)) InVars {ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_5|} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {124089#false} is VALID [2022-02-20 20:39:40,064 INFO L290 TraceCheckUtils]: 66: Hoare triple {124089#false} [464] L709-7-->L712: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:40,064 INFO L290 TraceCheckUtils]: 65: Hoare triple {124089#false} [483] L709-6-->L709-7: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_16| |v_ULTIMATE.start_main_~n~0#1_8|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:40,064 INFO L290 TraceCheckUtils]: 64: Hoare triple {124089#false} [478] L709-5-->L709-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post9#1] {124089#false} is VALID [2022-02-20 20:39:40,064 INFO L290 TraceCheckUtils]: 63: Hoare triple {124089#false} [492] L709-4-->L709-5: Formula: (= |v_ULTIMATE.start_main_~i~0#1_20| (+ |v_ULTIMATE.start_main_#t~post9#1_3| 1)) InVars {ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_3|} OutVars{ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {124089#false} is VALID [2022-02-20 20:39:40,064 INFO L290 TraceCheckUtils]: 62: Hoare triple {124089#false} [470] L709-3-->L709-4: Formula: (= |v_ULTIMATE.start_main_~i~0#1_19| |v_ULTIMATE.start_main_#t~post9#1_2|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_19|} OutVars{ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post9#1] {124089#false} is VALID [2022-02-20 20:39:40,064 INFO L290 TraceCheckUtils]: 61: Hoare triple {124089#false} [474] L710-2-->L709-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10#1] {124089#false} is VALID [2022-02-20 20:39:40,064 INFO L290 TraceCheckUtils]: 60: Hoare triple {124089#false} [511] L710-1-->L710-2: Formula: (= |v_ULTIMATE.start_main_~sum~0#1_3| (+ |v_ULTIMATE.start_main_~sum~0#1_4| |v_ULTIMATE.start_main_#t~mem10#1_3|)) InVars {ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_4|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_3|} OutVars{ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_3|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~sum~0#1] {124089#false} is VALID [2022-02-20 20:39:40,064 INFO L290 TraceCheckUtils]: 59: Hoare triple {124089#false} [431] L710-->L710-1: Formula: (= |v_ULTIMATE.start_main_#t~mem10#1_2| (select (select |v_#memory_int_10| |v_~#a~0.base_4|) (+ |v_~#a~0.offset_3| (* |v_ULTIMATE.start_main_~i~0#1_18| 4)))) InVars {#memory_int=|v_#memory_int_10|, ~#a~0.base=|v_~#a~0.base_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_18|, ~#a~0.offset=|v_~#a~0.offset_3|} OutVars{#memory_int=|v_#memory_int_10|, ~#a~0.base=|v_~#a~0.base_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_18|, ~#a~0.offset=|v_~#a~0.offset_3|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10#1] {124089#false} is VALID [2022-02-20 20:39:40,064 INFO L290 TraceCheckUtils]: 58: Hoare triple {124089#false} [484] L709-6-->L710: Formula: (< |v_ULTIMATE.start_main_~i~0#1_17| |v_ULTIMATE.start_main_~n~0#1_9|) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:40,064 INFO L290 TraceCheckUtils]: 57: Hoare triple {124089#false} [481] L709-->L709-6: Formula: (= |v_ULTIMATE.start_main_~i~0#1_15| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {124089#false} is VALID [2022-02-20 20:39:40,065 INFO L290 TraceCheckUtils]: 56: Hoare triple {124089#false} [512] L705-6-->L709: Formula: (= |v_ULTIMATE.start_main_~sum~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~sum~0#1] {124089#false} is VALID [2022-02-20 20:39:40,065 INFO L290 TraceCheckUtils]: 55: Hoare triple {124089#false} [440] L705-5-->L705-6: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_10| |v_ULTIMATE.start_main_~n~0#1_6|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:40,065 INFO L290 TraceCheckUtils]: 54: Hoare triple {124089#false} [489] L705-4-->L705-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post7#1] {124089#false} is VALID [2022-02-20 20:39:40,065 INFO L290 TraceCheckUtils]: 53: Hoare triple {124089#false} [508] L705-3-->L705-4: Formula: (= |v_ULTIMATE.start_main_~i~0#1_14| (+ |v_ULTIMATE.start_main_#t~post7#1_3| 1)) InVars {ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_3|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {124089#false} is VALID [2022-02-20 20:39:40,065 INFO L290 TraceCheckUtils]: 52: Hoare triple {124089#false} [498] L705-2-->L705-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_13| |v_ULTIMATE.start_main_#t~post7#1_2|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post7#1] {124089#false} is VALID [2022-02-20 20:39:40,066 INFO L290 TraceCheckUtils]: 51: Hoare triple {124089#false} [463] L706-2-->L705-2: 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] {124089#false} is VALID [2022-02-20 20:39:40,066 INFO L290 TraceCheckUtils]: 50: Hoare triple {124089#false} [543] thrEXIT-->L706-2: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem8#1_17| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thrThread1of4ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_17|, thrThread1of4ForFork0_thidvar0=v_thrThread1of4ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_17|, thrThread1of4ForFork0_thidvar0=v_thrThread1of4ForFork0_thidvar0_4} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:40,066 INFO L290 TraceCheckUtils]: 49: Hoare triple {124089#false} [522] thrFINAL-->thrEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:40,066 INFO L290 TraceCheckUtils]: 48: Hoare triple {124089#false} [521] L694-1-->thrFINAL: Formula: (= (+ v_thrThread1of4ForFork0_~t~0_5 1) v_~x~0_3) InVars {thrThread1of4ForFork0_~t~0=v_thrThread1of4ForFork0_~t~0_5} OutVars{~x~0=v_~x~0_3, thrThread1of4ForFork0_~t~0=v_thrThread1of4ForFork0_~t~0_5} AuxVars[] AssignedVars[~x~0] {124089#false} is VALID [2022-02-20 20:39:40,066 INFO L290 TraceCheckUtils]: 47: Hoare triple {124089#false} [520] L694-->L694-1: Formula: (= (store |v_#memory_int_12| |v_~#a~0.base_5| (store (select |v_#memory_int_12| |v_~#a~0.base_5|) (+ |v_~#a~0.offset_4| (* v_thrThread1of4ForFork0_~t~0_3 4)) 1)) |v_#memory_int_11|) InVars {#memory_int=|v_#memory_int_12|, ~#a~0.base=|v_~#a~0.base_5|, ~#a~0.offset=|v_~#a~0.offset_4|, thrThread1of4ForFork0_~t~0=v_thrThread1of4ForFork0_~t~0_3} OutVars{#memory_int=|v_#memory_int_11|, ~#a~0.base=|v_~#a~0.base_5|, ~#a~0.offset=|v_~#a~0.offset_4|, thrThread1of4ForFork0_~t~0=v_thrThread1of4ForFork0_~t~0_3} AuxVars[] AssignedVars[#memory_int] {124089#false} is VALID [2022-02-20 20:39:40,066 INFO L290 TraceCheckUtils]: 46: Hoare triple {124089#false} [519] L693-->L694: Formula: (= v_thrThread1of4ForFork0_~t~0_1 v_~x~0_2) InVars {~x~0=v_~x~0_2} OutVars{~x~0=v_~x~0_2, thrThread1of4ForFork0_~t~0=v_thrThread1of4ForFork0_~t~0_1} AuxVars[] AssignedVars[thrThread1of4ForFork0_~t~0] {124089#false} is VALID [2022-02-20 20:39:40,066 INFO L290 TraceCheckUtils]: 45: Hoare triple {124089#false} [518] thrENTRY-->L693: Formula: (and (= |v_thrThread1of4ForFork0_#in~arg.base_1| v_thrThread1of4ForFork0_~arg.base_1) (= v_thrThread1of4ForFork0_~arg.offset_1 |v_thrThread1of4ForFork0_#in~arg.offset_1|)) InVars {thrThread1of4ForFork0_#in~arg.base=|v_thrThread1of4ForFork0_#in~arg.base_1|, thrThread1of4ForFork0_#in~arg.offset=|v_thrThread1of4ForFork0_#in~arg.offset_1|} OutVars{thrThread1of4ForFork0_~arg.base=v_thrThread1of4ForFork0_~arg.base_1, thrThread1of4ForFork0_#in~arg.offset=|v_thrThread1of4ForFork0_#in~arg.offset_1|, thrThread1of4ForFork0_#in~arg.base=|v_thrThread1of4ForFork0_#in~arg.base_1|, thrThread1of4ForFork0_~arg.offset=v_thrThread1of4ForFork0_~arg.offset_1} AuxVars[] AssignedVars[thrThread1of4ForFork0_~arg.base, thrThread1of4ForFork0_~arg.offset] {124089#false} is VALID [2022-02-20 20:39:40,066 INFO L290 TraceCheckUtils]: 44: Hoare triple {124089#false} [475] L706-->L706-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8#1_2| (select (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#t~1#1.base_4|) (+ |v_ULTIMATE.start_main_~#t~1#1.offset_4| (* |v_ULTIMATE.start_main_~i~0#1_12| 4)))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_4|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_4|} OutVars{#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_2|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_4|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1] {124089#false} is VALID [2022-02-20 20:39:40,066 INFO L290 TraceCheckUtils]: 43: Hoare triple {124089#false} [441] L705-5-->L706: Formula: (< |v_ULTIMATE.start_main_~i~0#1_11| |v_ULTIMATE.start_main_~n~0#1_7|) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:40,066 INFO L290 TraceCheckUtils]: 42: Hoare triple {124089#false} [446] L702-7-->L705-5: Formula: (= |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {124089#false} is VALID [2022-02-20 20:39:40,067 INFO L290 TraceCheckUtils]: 41: Hoare triple {124407#(< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|)} [514] L702-6-->L702-7: Formula: (not (< |v_ULTIMATE.start_main_~i~0#1_4| |v_ULTIMATE.start_main_~n~0#1_4|)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|} AuxVars[] AssignedVars[] {124089#false} is VALID [2022-02-20 20:39:40,067 INFO L290 TraceCheckUtils]: 40: Hoare triple {124407#(< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|)} [438] L702-5-->L702-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post4#1] {124407#(< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 20:39:40,067 INFO L290 TraceCheckUtils]: 39: Hoare triple {124414#(< (+ |ULTIMATE.start_main_#t~post4#1| 1) |ULTIMATE.start_main_~n~0#1|)} [494] L702-4-->L702-5: Formula: (= (+ |v_ULTIMATE.start_main_#t~post4#1_3| 1) |v_ULTIMATE.start_main_~i~0#1_8|) InVars {ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_3|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {124407#(< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 20:39:40,068 INFO L290 TraceCheckUtils]: 38: Hoare triple {124418#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} [453] L702-3-->L702-4: Formula: (= |v_ULTIMATE.start_main_#t~post4#1_2| |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post4#1] {124414#(< (+ |ULTIMATE.start_main_#t~post4#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 20:39:40,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {124418#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} [459] L703-5-->L702-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {124418#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 20:39:40,069 INFO L290 TraceCheckUtils]: 36: Hoare triple {124418#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} [480] L703-4-->L703-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {124418#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 20:39:40,069 INFO L290 TraceCheckUtils]: 35: Hoare triple {124418#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} [539] L703-3-->thrENTRY: Formula: (and (= |v_thrThread1of4ForFork0_#in~arg.base_4| 0) (= |v_thrThread1of4ForFork0_#in~arg.offset_4| 0) (= v_thrThread1of4ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre5#1_18|)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_18|} OutVars{thrThread1of4ForFork0_~arg.base=v_thrThread1of4ForFork0_~arg.base_4, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_18|, thrThread1of4ForFork0_#in~arg.offset=|v_thrThread1of4ForFork0_#in~arg.offset_4|, thrThread1of4ForFork0_#res.base=|v_thrThread1of4ForFork0_#res.base_2|, thrThread1of4ForFork0_~t~0=v_thrThread1of4ForFork0_~t~0_8, thrThread1of4ForFork0_~arg.offset=v_thrThread1of4ForFork0_~arg.offset_4, thrThread1of4ForFork0_thidvar0=v_thrThread1of4ForFork0_thidvar0_2, thrThread1of4ForFork0_#in~arg.base=|v_thrThread1of4ForFork0_#in~arg.base_4|, thrThread1of4ForFork0_#res.offset=|v_thrThread1of4ForFork0_#res.offset_2|} AuxVars[] AssignedVars[thrThread1of4ForFork0_~arg.base, thrThread1of4ForFork0_#in~arg.offset, thrThread1of4ForFork0_#res.base, thrThread1of4ForFork0_~t~0, thrThread1of4ForFork0_~arg.offset, thrThread1of4ForFork0_thidvar0, thrThread1of4ForFork0_#in~arg.base, thrThread1of4ForFork0_#res.offset] {124418#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 20:39:40,070 INFO L290 TraceCheckUtils]: 34: Hoare triple {124418#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} [461] L703-2-->L703-3: Formula: (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t~1#1.base_3| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t~1#1.base_3|) (+ |v_ULTIMATE.start_main_~#t~1#1.offset_3| (* |v_ULTIMATE.start_main_~i~0#1_6| 4)) |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_7|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_3|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_3|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_3|} AuxVars[] AssignedVars[#memory_int] {124418#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 20:39:40,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {124418#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} [485] L703-1-->L703-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {124418#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 20:39:40,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {124418#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} [442] L703-->L703-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {124418#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 20:39:40,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {124418#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} [515] L702-6-->L703: Formula: (< |v_ULTIMATE.start_main_~i~0#1_5| |v_ULTIMATE.start_main_~n~0#1_5|) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] {124418#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 20:39:40,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {124443#(< 1 |ULTIMATE.start_main_~n~0#1|)} [454] L702-->L702-6: Formula: (= |v_ULTIMATE.start_main_~i~0#1_3| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {124418#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 20:39:40,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {124443#(< 1 |ULTIMATE.start_main_~n~0#1|)} [458] L686-1-->L702: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124443#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 20:39:40,071 INFO L290 TraceCheckUtils]: 28: Hoare triple {124450#(or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 1 |ULTIMATE.start_main_~n~0#1|))} [496] L687-->L686-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[] {124443#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 20:39:40,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {124454#(or (< 1 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [516] L686-->L687: 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] {124450#(or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 20:39:40,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {124454#(or (< 1 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [456] L701-2-->L686: 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] {124454#(or (< 1 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:39:40,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {124088#true} [452] L701-1-->L701-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 5 |v_ULTIMATE.start_main_~n~0#1_3|) (<= |v_ULTIMATE.start_main_~n~0#1_3| 10)) 1 0)) InVars {ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_3|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_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] {124454#(or (< 1 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:39:40,072 INFO L290 TraceCheckUtils]: 24: Hoare triple {124088#true} [500] L701-->L701-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:40,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {124088#true} [509] L700-1-->L701: 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] {124088#true} is VALID [2022-02-20 20:39:40,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {124088#true} [506] L700-->L700-1: Formula: (= |v_ULTIMATE.start_main_~n~0#1_2| (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~nondet3#1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_2|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0#1] {124088#true} is VALID [2022-02-20 20:39:40,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {124088#true} [460] L698-1-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {124088#true} is VALID [2022-02-20 20:39:40,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {124088#true} [462] L698-->L698-1: Formula: (and (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#t~1#1.base_2| 40)) (not (= |v_ULTIMATE.start_main_~#t~1#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~1#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t~1#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t~1#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t~1#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_2|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~1#1.offset, ULTIMATE.start_main_~#t~1#1.base, #valid, #length] {124088#true} is VALID [2022-02-20 20:39:40,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {124088#true} [449] L697-1-->L698: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {124088#true} is VALID [2022-02-20 20:39:40,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {124088#true} [467] L697-->L697-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {124088#true} is VALID [2022-02-20 20:39:40,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {124088#true} [444] L-1-7-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t~1#1.offset=|v_ULTIMATE.start_main_~#t~1#1.offset_1|, ULTIMATE.start_main_~#t~1#1.base=|v_ULTIMATE.start_main_~#t~1#1.base_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~sum~0#1=|v_ULTIMATE.start_main_~sum~0#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~n~0#1=|v_ULTIMATE.start_main_~n~0#1_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_1|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t~1#1.offset, ULTIMATE.start_main_~#t~1#1.base, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~sum~0#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_#t~post4#1] {124088#true} is VALID [2022-02-20 20:39:40,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {124088#true} [477] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {124088#true} is VALID [2022-02-20 20:39:40,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {124088#true} [448] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {124088#true} is VALID [2022-02-20 20:39:40,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {124088#true} [479] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:40,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {124088#true} [507] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:40,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {124088#true} [469] L690-3-->L-1-3: Formula: (= v_~x~0_1 0) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] {124088#true} is VALID [2022-02-20 20:39:40,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {124088#true} [455] L690-2-->L690-3: Formula: (= (store |v_#memory_int_6| |v_~#a~0.base_3| (store (select |v_#memory_int_6| |v_~#a~0.base_3|) |v_~#a~0.offset_2| 0)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ~#a~0.base=|v_~#a~0.base_3|, ~#a~0.offset=|v_~#a~0.offset_2|} OutVars{#memory_int=|v_#memory_int_5|, ~#a~0.base=|v_~#a~0.base_3|, ~#a~0.offset=|v_~#a~0.offset_2|} AuxVars[] AssignedVars[#memory_int] {124088#true} is VALID [2022-02-20 20:39:40,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {124088#true} [437] L690-1-->L690-2: Formula: (= (store |v_#memory_int_4| |v_~#a~0.base_2| ((as const (Array Int Int)) 0)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ~#a~0.base=|v_~#a~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#a~0.base=|v_~#a~0.base_2|} AuxVars[] AssignedVars[#memory_int] {124088#true} is VALID [2022-02-20 20:39:40,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {124088#true} [499] L690-->L690-1: Formula: (and (= (select |v_#valid_4| 3) 1) (= 40 (select |v_#length_3| 3))) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:40,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {124088#true} [433] L683-4-->L690: Formula: (and (= |v_~#a~0.offset_1| 0) (= |v_~#a~0.base_1| 3)) InVars {} OutVars{~#a~0.base=|v_~#a~0.base_1|, ~#a~0.offset=|v_~#a~0.offset_1|} AuxVars[] AssignedVars[~#a~0.base, ~#a~0.offset] {124088#true} is VALID [2022-02-20 20:39:40,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {124088#true} [501] L683-3-->L683-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:40,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {124088#true} [471] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:40,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {124088#true} [491] L683-1-->L683-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:40,074 INFO L290 TraceCheckUtils]: 4: Hoare triple {124088#true} [443] L683-->L683-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:40,074 INFO L290 TraceCheckUtils]: 3: Hoare triple {124088#true} [505] L-1-2-->L683: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:40,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {124088#true} [502] 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[] {124088#true} is VALID [2022-02-20 20:39:40,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {124088#true} [473] 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] {124088#true} is VALID [2022-02-20 20:39:40,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {124088#true} [493] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124088#true} is VALID [2022-02-20 20:39:40,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 20:39:40,075 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261280626] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 20:39:40,075 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 20:39:40,075 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-02-20 20:39:40,076 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104603271] [2022-02-20 20:39:40,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 20:39:40,078 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 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 72 [2022-02-20 20:39:40,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:39:40,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 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:39:40,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:39:40,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 20:39:40,140 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:39:40,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 20:39:40,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2022-02-20 20:39:40,142 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 109 [2022-02-20 20:39:40,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 97 transitions, 274 flow. Second operand has 19 states, 19 states have (on average 70.73684210526316) internal successors, (1344), 19 states have internal predecessors, (1344), 0 states have call successors, (0), 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:39:40,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:39:40,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 109 [2022-02-20 20:39:40,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:22,309 INFO L129 PetriNetUnfolder]: 35/583 cut-off events. [2022-02-20 20:40:22,310 INFO L130 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2022-02-20 20:40:22,311 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 583 events. 35/583 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2944 event pairs, 2 based on Foata normal form. 2/585 useless extension candidates. Maximal degree in co-relation 1072. Up to 125 conditions per place. [2022-02-20 20:40:22,312 INFO L132 encePairwiseOnDemand]: 94/109 looper letters, 37 selfloop transitions, 20 changer transitions 0/117 dead transitions. [2022-02-20 20:40:22,312 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 117 transitions, 442 flow [2022-02-20 20:40:22,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:40:22,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-02-20 20:40:22,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 875 transitions. [2022-02-20 20:40:22,319 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.668960244648318 [2022-02-20 20:40:22,319 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 875 transitions. [2022-02-20 20:40:22,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 875 transitions. [2022-02-20 20:40:22,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:22,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 875 transitions. [2022-02-20 20:40:22,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 72.91666666666667) internal successors, (875), 12 states have internal predecessors, (875), 0 states have call successors, (0), 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:40:22,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 109.0) internal successors, (1417), 13 states have internal predecessors, (1417), 0 states have call successors, (0), 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:40:22,323 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 109.0) internal successors, (1417), 13 states have internal predecessors, (1417), 0 states have call successors, (0), 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:40:22,323 INFO L186 Difference]: Start difference. First operand has 105 places, 97 transitions, 274 flow. Second operand 12 states and 875 transitions. [2022-02-20 20:40:22,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 117 transitions, 442 flow